bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Optimizations for day 16.

Browse Source 
Don't use checks that are idempotent more than once, and reduce hashmap
use.
This commit is contained in:
Bert Peters
2020-12-16 19:04:52 +01:00
parent 796d854838
commit 54d61e11f1
1 changed files with 6 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
2020/src/day16.rs
View File

@@ -86,26 +86,21 @@ impl Solution for Day16 {
let mut fixed_fields = HashMap::new(); let mut fixed_fields = HashMap::new();
while fixed_fields.len() != rules.len() { for ticket in &tickets {
for ticket in &tickets { for (field, ranges) in &rules {
for (pos, value) in ticket.iter().enumerate() { for (pos, value) in ticket.iter().enumerate() {
if pos_can_be[pos].len() <= 1 { if pos_can_be[pos].len() <= 1 {
continue; continue;
} }
for (field, ranges) in &rules { if !ranges.iter().any(|r| r.contains(value)) {
// If we already assigned this field, don't continue pos_can_be[pos].remove(field);
if fixed_fields.contains_key(field) || !pos_can_be[pos].contains(field) {
continue;
}
if !ranges.iter().any(|r| r.contains(value)) {
pos_can_be[pos].remove(field);
}
} }
} }
} }
}
while fixed_fields.len() != rules.len() {
// Fix fields that are the only option for a certain spot // Fix fields that are the only option for a certain spot
for pos in 0..pos_can_be.len() { for pos in 0..pos_can_be.len() {
if pos_can_be[pos].len() == 1 { if pos_can_be[pos].len() == 1 {