summaryrefslogtreecommitdiff
path: root/2025/d3.rs
blob: b8e3f231c08ddd7003358afa07fcae4e3ae34dc8 (plain)
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
use aoc::{fetch::fetch, joltage::Joltage, read::read};

struct JoltageBank {
    inner: Vec<Joltage>,
}

impl JoltageBank {
    fn new(inner: Vec<Joltage>) -> Self {
        Self {
            inner,
        }
    }

    fn get_biggest_two(&mut self) -> usize {
        let mut res = 0;
        for i in 0..self
            .inner
            .len()
        {
            for j in (i + 1)
                ..self
                    .inner
                    .len()
            {
                let max1 = *self.inner[i] as usize;
                let max2 = *self.inner[j] as usize;
                let value = max1 * 10 + max2;
                if value > res {
                    res = value;
                }
            }
        }
        res
    }

    fn get_biggest_12(&mut self) -> usize {
        let digits: Vec<usize> = self
            .inner
            .iter()
            .map(|j| **j as usize)
            .collect();
        let n = digits.len();
        let k = 12;
        let to_remove = n - k;

        // Use monotonic stack to find largest number by removing `to_remove` digits
        let mut stack: Vec<usize> = Vec::new();
        let mut removed = 0;

        for &digit in &digits {
            while removed < to_remove
                && !stack.is_empty()
                && *stack
                    .last()
                    .unwrap()
                    < digit
            {
                stack.pop();
                removed += 1;
            }
            stack.push(digit);
        }

        // If we haven't removed enough, remove from the end
        while stack.len() > k {
            stack.pop();
        }

        let mut res = 0;
        for val in stack {
            res = res * 10 + val;
        }
        res
    }
}

pub fn part1() {
    let input = fetch(
        3, '\n',
    );
    let mut res = 0;
    for i in input {
        if i.is_empty() {
            break;
        }
        let mut vec = Vec::new();
        for c in i.chars() {
            vec.push(
                Joltage::parse(
                    c.to_digit(10)
                        .unwrap() as u8,
                )
                .unwrap(),
            );
        }
        res += JoltageBank::new(vec).get_biggest_two();
    }
    println!("{res}");
}

pub fn part2() {
    // let input = fetch(3, '\n');
    let input = read(
        "d", '\n',
    );
    let mut res = 0;
    for i in input {
        if i.is_empty() {
            break;
        }
        let mut vec = Vec::new();
        for c in i.chars() {
            vec.push(
                Joltage::parse(
                    c.to_digit(10)
                        .unwrap() as u8,
                )
                .unwrap(),
            );
        }
        res += JoltageBank::new(vec).get_biggest_12();
    }
    println!("{res}");
}