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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162

#![allow(
    confusable_idents,
    uncommon_codepoints,
    non_upper_case_globals,
    internal_features,
    mixed_script_confusables,
    incomplete_features
)]
#![feature(
    slice_swap_unchecked,
    iter_repeat_n,
    generic_const_exprs,
    iter_array_chunks,
    get_many_mut,
    maybe_uninit_uninit_array,
    iter_collect_into,
    let_chains,
    anonymous_lifetime_in_impl_trait,
    vec_into_raw_parts,
    array_windows,
    slice_take,
    test,
    slice_as_chunks,
    array_chunks,
    slice_split_once,
    core_intrinsics,
    portable_simd,
    hint_assert_unchecked
)]
mod util;
pub mod day9 {
    use super::util::prelude::*;

    #[no_mangle]
    pub fn part1(i: &str) -> impl Display {
        let i = i.as_bytes();
        let size = memchr::memchr(b'\n', i).ψ();
        let max = size * (size + 1);
        unsafe { core::hint::assert_unchecked(i.len() == max) };
        let get = |j: u16| (j < max as u16).then(|| i[j as usize]);

        // fimg::Image::<Vec<u8>, 1>::build(SIZE as _, SIZE as _)
        //     .buf(
        //         grid.iter()
        //             .flat_map(|x| &x[..SIZE])
        //             .map(|x| (((*x - b'0') as f32 / 10.0) * 255.0) as u8)
        //             .collect_vec(),
        //     )
        //     .scale::<fimg::scale::Nearest>(SIZE as u32 * 8, SIZE as u32 * 8)
        //     .save("hmm.png");
        let mut tot = 0;
        pub fn p1(
            start: u16,
            graph: &mut impl Fn(u16) -> [u16; 4],
            ok: &mut impl Fn(u16, u16) -> bool,
            end: &mut impl Fn(u16) -> bool,
            reached: &mut [u8],
        ) -> u16 {
            if end(start) && reached[start as usize] == 0 {
                reached[start as usize] = 1;
                return 1;
            } else {
                graph(start)
                    .into_iter()
                    .map(|x| {
                        if ok(start, x) {
                            p1(x, graph, ok, end, reached)
                        } else {
                            0
                        }
                    })
                    .sum()
            }
        }

        let mut dp = vec![0; max];
        // let mut dp = vec![u16::MAX; max];
        for i in memchr::memchr_iter(b'9', i) {
            dp.fill(0);
            tot += p1(
                i as u16,
                &mut |i| {
                    [
                        i.wrapping_add(1),
                        i.wrapping_sub(1),
                        i.wrapping_add(size as u16 + 1),
                        i.wrapping_sub(size as u16 + 1),
                    ]
                },
                &mut |i1, i2| match get(i2) {
                    Some(x) => get(i1).ψ().wrapping_sub(x) == 1,
                    None => false,
                },
                &mut |i| get(i) == Some(b'0'),
                &mut dp,
            );
        }
        tot
    }

    #[no_mangle]
    pub fn part2(i: &str) -> impl Display {
        let i = i.as_bytes();
        let size = memchr::memchr(b'\n', i).ψ();
        let max = size * (size + 1);
        unsafe { core::hint::assert_unchecked(i.len() == max) };
        let get = |j: u16| (j < max as u16).then(|| i[j as usize]);
        let mut tot = 0;

        pub fn p2(
            start: u16,
            graph: &mut impl Fn(u16) -> [u16; 4],
            ok: &mut impl Fn(u16, u16) -> bool,
            end: &mut impl Fn(u16) -> bool,
            dp: &mut [u16],
        ) -> u16 {
            if end(start) {
                return 1;
            } else {
                graph(start)
                    .into_iter()
                    .map(|x| {
                        if ok(start, x) {
                            #[allow(irrefutable_let_patterns)]
                            if let x = dp[x as usize]
                                && x != 0xffff
                            {
                                return x;
                            }
                            let n = p2(x, graph, ok, end, dp);
                            dp[x as usize] = n;
                            n
                        } else {
                            0
                        }
                    })
                    .sum()
            }
        }
        let mut dp = vec![u16::MAX; max];
        for i in memchr::memchr_iter(b'9', i) {
            tot += p2(
                i as u16,
                &mut |i| {
                    [
                        i.wrapping_add(1),
                        i.wrapping_sub(1),
                        i.wrapping_add(size as u16 + 1),
                        i.wrapping_sub(size as u16 + 1),
                    ]
                },
                &mut |i1, i2| match get(i2) {
                    Some(x) => get(i1).ψ().wrapping_sub(x) == 1,
                    None => false,
                },
                &mut |i| get(i) == Some(b'0'),
                &mut dp,
            );
        }
        tot
    }
}