day-1/main.zig


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

const std = @import("std");
const min_idx = @import("util/mem.zig").min_idx;

pub fn puzzle_1(input: []const u8) !i32 {
    var iter = std.mem.split(u8, input, "\n");
    var count: i32 = 0;
    var max: i32 = 0;

    while (iter.next()) |line| {
        if (line.len == 0) {
            if (count > max) {
                max = count;
            }
            count = 0;
        } else {
            count += try std.fmt.parseInt(i32, line, 0);
        }
    }

    return max;
}

pub fn puzzle_2(input: []const u8) !i32 {
    var iter = std.mem.split(u8, input, "\n");
    var count: i32 = 0;
    var max: [3]i32 = std.mem.zeroes([3]i32);

    while (iter.next()) |line| {
        if (line.len == 0) {
            const lowest_u = min_idx(i32, &max);
            if (count > max[lowest_u]) {
                max[lowest_u] = count;
            }
            count = 0;
        } else {
            count += try std.fmt.parseInt(i32, line, 0);
        }
    }

    count = 0;
    for (max) |v| {
        count += v;
    }

    return count;
}