summaryrefslogtreecommitdiff
path: root/day_06.zig
blob: 71729349b7c13f4990e43e95ac5d01ff5e34640e (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
const std = @import("std");
const Result = @import("util/aoc.zig").Result;

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

    var i: usize = 0;
    mainLoop: while (iter.next()) |line| {
        var buf = std.mem.zeroes([4]u32);
        var buf_idx: usize = 0;
        for (line) |c, idx| {
            if (buf_idx > 3) buf_idx = 0;
            buf[buf_idx] = @as(u32, 1) << @intCast(u5, c - 97); // 97 == 'a'
            buf_idx += 1;
            if (@popCount(buf[0] | buf[1] | buf[2] | buf[3]) == 4) {
                i = idx + 1;
                break :mainLoop;
            }
        }
    }

    return .{ .int = @intCast(i32, i) };
}

pub fn puzzle_2(input: []const u8) Result {
    var iter = std.mem.split(u8, input, "\n");

    var i: usize = 0;
    mainLoop: while (iter.next()) |line| {
        var buf = std.mem.zeroes([14]u32);
        var buf_idx: usize = 0;
        for (line) |c, idx| {
            if (buf_idx > 13) buf_idx = 0;
            buf[buf_idx] = @as(u32, 1) << @intCast(u5, c - 97); // 97 == 'a'
            buf_idx += 1;

            const hammer: u32 = blk: {
                var hidx: usize = 0;
                var tmp: u32 = 0;
                while (hidx < 14) : (hidx += 1) tmp |= buf[hidx];
                break :blk tmp;
            };

            if (@popCount(hammer) == 14) {
                i = idx + 1;
                break :mainLoop;
            }
        }
    }

    return .{ .int = @intCast(i32, i) };
}