codspeed-aoc -


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137

#![allow(
    confusable_idents,
    uncommon_codepoints,
    non_upper_case_globals,
    internal_features,
    mixed_script_confusables,
    incomplete_features
)]
#![feature(
    slice_swap_unchecked,
    generic_const_exprs,
    iter_array_chunks,
    get_many_mut,
    maybe_uninit_uninit_array,
    iter_collect_into,
    let_chains,
    anonymous_lifetime_in_impl_trait,
    array_windows,
    slice_take,
    test,
    slice_as_chunks,
    array_chunks,
    slice_split_once,
    core_intrinsics,
    portable_simd
)]
mod util;
pub mod day5 {
    use crate::util::prelude::*;
    struct Setz {
        bits: [u128; 100],
    }
    impl Setz {
        fn new() -> Self {
            Self { bits: [0; 100] }
        }
        fn insert(&mut self, a: u8, b: u8) {
            unsafe { *self.bits.get_unchecked_mut(a as usize) |= 1 << b };
        }
        fn test(&self, a: u8, b: u8) -> bool {
            unsafe { (*self.bits.get_unchecked(a as usize) & 1 << b) != 0 }
        }
    }

    #[no_mangle]
    pub fn part1(i: &str) -> impl Display {
        let i = i.as_bytes();
        let c = unsafe { C! { &i[..1176 * 6]}.as_chunks_unchecked::<6>() };
        let mut bitsets = Setz::new();
        for i in 0..1176 {
            let [a, b, _, c, d, _] = C! { c[i] };
            bitsets.insert((a - b'0') * 10 + (b - b'0'), (c - b'0') * 10 + (d - b'0'));
        }
        let mut sum = 0;
        let mut v = Vec::with_capacity(25);
        'out: for mut pages in C!(&i[1176 * 6 + 1..]).行() {
            v.clear();
            let [a, b, rest @ ..] = pages else {
                unsafe { std::hint::unreachable_unchecked() }
            };
            pages = rest;
            v.push((a - b'0') * 10 + (b - b'0'));
            let mut i = 0;
            loop {
                mat!(pages {
                    [b',', a, b, rest @ ..] => {
                        v.push((a - b'0') * 10 + (b - b'0'));
                        if let &[a, b] = C!{ &v[i..] } {
                            // valid ones always have a rule
                            if !bitsets.test(a, b) {
                                continue 'out;
                            }
                            i += 1;
                        }
                        pages = rest;
                    },
                    [] => break,
                })
            }
            sum += C! { v[(v.len() - 1) / 2] } as u32;
        }
        leek!(v);
        sum
    }

    #[no_mangle]
    pub fn part2(i: &str) -> impl Display {
        let i = i.as_bytes();
        let c = unsafe { C! { &i[..1176 * 6]}.as_chunks_unchecked::<6>() };
        let mut bitsets = Setz::new();
        for i in 0..1176 {
            let [a, b, _, c, d, _] = C! { c[i]};
            bitsets.insert((a - b'0') * 10 + (b - b'0'), (c - b'0') * 10 + (d - b'0'));
        }
        let mut sum = 0;
        let mut v = Vec::with_capacity(25);
        for mut pages in C!(&i[1176 * 6 + 1..]).行() {
            v.clear();
            let [a, b, rest @ ..] = pages else {
                unsafe { std::hint::unreachable_unchecked() }
            };
            pages = rest;
            v.push((a - b'0') * 10 + (b - b'0'));
            let mut i = 0;
            let mut faults = 0;
            loop {
                mat!(pages {
                    [b',', a, b, rest @ ..] => {
                        v.push((a - b'0') * 10 + (b - b'0'));
                        if let &[a, b] = C! { &v[i..] } {
                            if !bitsets.test(a, b) {
                                faults += 1;
                            }
                            i += 1;
                        }
                        pages = rest;
                    },
                    [] => break,
                })
            }
            if faults == 0 {
                continue;
            }
            let mid = (v.len() - 1) / 2;
            let (_, &mut mid, _) = v.select_nth_unstable_by(mid, |&a, &b| {
                if bitsets.test(a, b) {
                    std::cmp::Ordering::Greater
                } else {
                    std::cmp::Ordering::Less
                }
            });
            sum += mid as u32;
        }
        leek!(v);
        sum
    }
}