summaryrefslogtreecommitdiffstats
path: root/src/bin/2023/day20.rs
blob: 045c07b472f13ab4dfe8e4408a6ca51b9c8c5aa1 (plain) (blame)
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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
#![allow(dead_code)]
#![allow(unused_variables)]

use advent_of_code::prelude::*;

pub enum ModuleType {
    Broadcast,
    FlipFlop(bool),
    Conjunction(HashMap<String, bool>),
}

pub struct Module {
    name: String,
    ty: ModuleType,
    destinations: Vec<String>,
    low_pulses: i64,
    high_pulses: i64,
}

impl std::str::FromStr for Module {
    type Err = anyhow::Error;

    fn from_str(s: &str) -> std::result::Result<Self, Self::Err> {
        let mut parts = s.split(" -> ");
        let module_name = parts.next().unwrap();
        let destinations = parts.next().unwrap();
        let destinations: Vec<_> =
            destinations.split(", ").map(|s| s.to_string()).collect();
        let (ty, name) = match module_name.chars().next().unwrap() {
            '&' => (
                ModuleType::Conjunction(HashMap::new()),
                module_name.chars().skip(1).collect(),
            ),
            '%' => (
                ModuleType::FlipFlop(false),
                module_name.chars().skip(1).collect(),
            ),
            _ => {
                if module_name == "broadcaster" {
                    (ModuleType::Broadcast, module_name.to_string())
                } else {
                    bail!("failed to parse module {module_name}")
                }
            }
        };

        Ok(Self {
            name,
            ty,
            destinations,
            low_pulses: 0,
            high_pulses: 0,
        })
    }
}

pub struct Network {
    modules: HashMap<String, Module>,
}

impl Network {
    fn pulse(&mut self) {
        let mut pulses = VecDeque::new();
        pulses.push_front(("".to_string(), "broadcaster".to_string(), false));
        while let Some((src, dest, high)) = pulses.pop_back() {
            let module = self.modules.get_mut(&dest).unwrap();

            if high {
                module.high_pulses += 1;
            } else {
                module.low_pulses += 1;
            }

            let mut pulse = None;
            match module.ty {
                ModuleType::Broadcast => {
                    pulse = Some(high);
                }
                ModuleType::FlipFlop(ref mut on) => {
                    if !high {
                        *on = !*on;
                        pulse = Some(*on);
                    }
                }
                ModuleType::Conjunction(ref mut inputs) => {
                    *inputs.get_mut(&src).unwrap() = high;
                    pulse = Some(!inputs.values().all(|high| *high));
                }
            }

            if let Some(pulse) = pulse {
                for new_dest in module.destinations.clone() {
                    pulses.push_back((dest.to_string(), new_dest, pulse));
                }
            }
        }
    }
}

impl std::str::FromStr for Network {
    type Err = anyhow::Error;

    fn from_str(s: &str) -> std::result::Result<Self, Self::Err> {
        let mut modules: HashMap<_, _> = s
            .trim()
            .split('\n')
            .map(|s| {
                let module: Module = s.parse()?;
                Ok::<_, Self::Err>((module.name.clone(), module))
            })
            .collect::<Result<_, _>>()?;
        let module_names: Vec<_> = modules.keys().cloned().collect();
        for name in module_names {
            let destinations = modules[&name].destinations.clone();
            for dest in destinations {
                if let Some(ModuleType::Conjunction(ref mut inputs)) =
                    modules.get_mut(&dest).map(|module| &mut module.ty)
                {
                    inputs.insert(name.clone(), false);
                }
            }
        }
        let destinations: HashSet<String> = modules
            .values()
            .flat_map(|module| module.destinations.iter())
            .cloned()
            .collect();
        for destination in destinations {
            if !modules.contains_key(&destination) {
                modules.insert(
                    destination.clone(),
                    Module {
                        name: destination,
                        ty: ModuleType::Broadcast,
                        destinations: vec![],
                        low_pulses: 0,
                        high_pulses: 0,
                    },
                );
            }
        }
        Ok(Self { modules })
    }
}

pub fn parse(mut fh: File) -> Result<Network> {
    let mut s = String::new();
    fh.read_to_string(&mut s)?;
    s.parse()
}

pub fn part1(mut network: Network) -> Result<i64> {
    for _ in 0..1000 {
        network.pulse();
    }
    Ok(network
        .modules
        .values()
        .map(|module| module.low_pulses)
        .sum::<i64>()
        * network
            .modules
            .values()
            .map(|module| module.high_pulses)
            .sum::<i64>())
}

pub fn part2(_: Network) -> Result<i64> {
    // let mut count = 0;
    // loop {
    //     network.pulse();
    //     count += 1;
    //     if network.modules.get("rx").unwrap().low_pulses > 0 {
    //         return Ok(count);
    //     }
    // }
    todo!()
}

#[test]
fn test() {
    assert_eq!(
        part1(parse(parse::data(2023, 20).unwrap()).unwrap()).unwrap(),
        681194780
    );
    assert_eq!(
        part2(parse(parse::data(2023, 20).unwrap()).unwrap()).unwrap(),
        0
    );
}