summary refs log tree commit diff homepage
path: root/src/bin/day06.rs
blob: bdd9147c2efa6f5fce14cd0d3ff0acb40268371e (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
use std::io::{self, Read};

struct Runs<T, I> {
    inner: I,
    current: Option<T>,
    count: usize,
}

impl<T, I> From<I> for Runs<T, I> {
    fn from(iter: I) -> Self {
        Runs {
            inner: iter,
            current: None,
            count: 0,
        }
    }
}

// Gross.
impl<T: Copy + PartialEq, I: Iterator<Item = T>> Iterator for Runs<T, I> {
    type Item = (T, usize);

    fn next(&mut self) -> Option<(T, usize)> {
        for c in &mut self.inner {
            match self.current {
                None => {
                    self.current = Some(c);
                    self.count = 1;
                },
                Some(r) if r == c => {
                    self.count += 1;
                },
                Some(r) => {
                    self.current = Some(c);
                    let run = self.count;
                    self.count = 1;
                    return Some((r, run));
                },
            }
        }

        self.current.take().map(|c| (c, self.count))
    }
}

fn solve(input: &str) -> String {
    let len = input.find('\n').unwrap_or(input.len());
    let mut columns = vec![Vec::new(); len];

    for line in input.lines() {
        for (i, c) in line.chars().enumerate() {
            columns[i].push(c);
        }
    }

    columns.into_iter()
        .map(|mut column| {
            column.sort();
            Runs::from(column.into_iter())
                .max_by_key(|run| run.1)
                .unwrap()
                .0
        })
        .collect()
}

fn main() {
    let mut input = String::new();
    io::stdin().read_to_string(&mut input).unwrap();

    println!("Part 1: {}", solve(&input));
}

#[test]
fn part1() {
    let input = "
eedadn
drvtee
eandsr
raavrd
atevrs
tsrnev
sdttsa
rasrtv
nssdts
ntnada
svetve
tesnvt
vntsnd
vrdear
dvrsen
enarar
";
    assert_eq!("easter", solve(input.trim()));
}
'2018-07-23 01:17:10 -0400'>2018-07-23Fix NaNs in serverMapJune McEnroe When there are very few touched tiles, even if they are recent, they will appear blue, because timeMin is also recent. I should figure out how to fix that. 2018-07-22Add libm.so to chroot.tarJune McEnroe 2018-07-22Link with -lmJune McEnroe Darwin's lack of separation strikes again. 2018-07-22Add map to clientJune McEnroe 2018-07-21Refactor readInput for each modeJune McEnroe 2018-07-19Add ARRAY_LEN macroJune McEnroe 2018-07-17Add server map generationJune McEnroe 2018-07-17Tabify sourceJune McEnroe And other style changes. 2018-05-13Fix ncurses color pair numberingJune McEnroe This was dumb. Of course all the color pairs fit in 64, but I was shifting too much because my own representation includes the bright bit. 2018-04-09Use anonymous unionJune McEnroe 2018-04-09Replace #define with enum or const where possibleJune McEnroe 2018-03-31Link against ncursesJune McEnroe 2018-03-05Miscellaneous code cleanupJune McEnroe 2018-03-05Pass message structs by valueJune McEnroe 2018-03-05Use stdio in merge and metaJune McEnroe 2018-03-05Clean up spawn constantsJune McEnroe 2018-03-05Rename Tile timestamps {create,modify,access}TimeJune McEnroe 2018-03-05Pack message type enumsJune McEnroe 2018-03-05Undef COLOR_ constants in torus.hJune McEnroe 2018-03-05Generate tagsJune McEnroe 2017-10-03Simplify Makefile with pattern ruleJune McEnroe Insert rant about how GNU make handles the .c rule with extra dependencies. Also I don't care that everything links curses now. 2017-09-27Remove leading blank linesJune McEnroe 2017-09-27Add merge.c to READMEJune McEnroe 2017-09-03Assert client coords are valid after movementJune McEnroe 2017-09-03Relicense AGPLJune McEnroe I know it's already published under a permissive license in what is probably its final form, but I want to license it AGPL anyway on principle following some conversations I had about open source, corporations and copyleft. 2017-09-01Revert "Add client readOnly mode"June McEnroe This reverts commit 34f25ae40a3db9369e9d98b3814f2b93bbc21451. 2017-09-01Remove clientRemove call from clientCastJune McEnroe If an error occurs on a client socket during a broadcast, that client will show up in the kqueue loop with EV_EOF and get removed that way. Tested by sending SIGKILL to a client and watching its cursor disappear. 2017-09-01Add client readOnly modeJune McEnroe 2017-08-31Clean up merge toolJune McEnroe Choose the version with the most recent access if the modify times are the same. 2017-08-31Choose B for tiles with equal modify timesJune McEnroe This way newer access counts and times will be preserved. 2017-08-31Add quick data file merge toolJune McEnroe Hopefully I won't have to use it ever again. 2017-08-30Use only foreground color for selecting spawnJune McEnroe 2017-08-29Add four additional spawnsJune McEnroe 2017-08-28Add respawningJune McEnroe 2017-08-26Move license above includesJune McEnroe Why was it down there? 2017-08-26Snapshot metadataJune McEnroe 2017-08-26Add meta.c to READMEJune McEnroe 2017-08-26Use MakefileJune McEnroe