kageru/advent-of-code
1
0
Fork 0
Code Issues 1 Pull Requests Releases Wiki Activity

make part1 part2

This commit is contained in:
kageru 2023-12-13 12:40:23 +01:00
parent 1338681cf4
commit b0ebf8e3d4
Signed by: kageru
GPG Key ID: 8282A2BEA4ADA3D2
1 changed files with 14 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
2023/src/bin/day13.rs
View File

@ -17,17 +17,12 @@ fn find_reflection<const DEVIATIONS: u32>(block: &[I]) -> Option<usize> {
let mut offset = 0; let mut offset = 0;
let mut deviations = DEVIATIONS; let mut deviations = DEVIATIONS;
loop { loop {
match try { block.get(i.checked_sub(offset)?)? ^ block.get(i + 1 + offset)? } { match try { (block.get(i.checked_sub(offset)?)? ^ block.get(i + 1 + offset)?).count_ones() } {
None if deviations == 0 => return Some(i + 1), None if deviations == 0 => return Some(i + 1),
Some(0) => offset += 1, Some(0) => offset += 1,
Some(diff) => { Some(diff) if diff <= deviations => {
let diff = diff.count_ones(); offset += 1;
if diff > deviations { deviations -= diff;
continue 'outer;
} else {
offset += 1;
deviations -= diff;
}
} }
_ => continue 'outer, _ => continue 'outer,
} }
@ -42,26 +37,27 @@ fn transpose(orig: &[I]) -> Vec<I> {
let mut out = vec![0; len]; let mut out = vec![0; len];
for j in 0..len { for j in 0..len {
for (i, &value) in orig.iter().enumerate() { for (i, &value) in orig.iter().enumerate() {
if (value & (1 << j)) != 0 { let src_bit = value & (1 << j);
out[len - 1 - j] |= 1 << (orig.len() - 1) >> i; let dst_position = orig.len() - 1 - i;
} out[len - 1 - j] |= ((src_bit != 0) as I) << dst_position;
} }
} }
out out
} }
fn part1(blocks: &Parsed) -> usize { fn solve<const DEV: u32>(blocks: &Parsed) -> usize {
blocks blocks
.iter() .iter()
.map(|block| find_reflection::<0>(block).map(|n| n * 100).or_else(|| find_reflection::<0>(&transpose(block))).unwrap()) .map(|block| find_reflection::<DEV>(block).map(|n| n * 100).or_else(|| find_reflection::<DEV>(&transpose(block))).unwrap())
.sum() .sum()
} }
fn part1(blocks: &Parsed) -> usize {
solve::<0>(blocks)
}
fn part2(blocks: &Parsed) -> usize { fn part2(blocks: &Parsed) -> usize {
blocks solve::<1>(blocks)
.iter()
.map(|block| find_reflection::<1>(&block).map(|n| n * 100).or_else(|| find_reflection::<1>(&transpose(&block))).unwrap())
.sum()
} }
boilerplate! { boilerplate! {