aboutsummaryrefslogtreecommitdiff
path: root/2022/02-rock-paper-scissors/second.zig
blob: dec985389fa0448f0bb49b632e5ee8eef6b05292 (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
const std = @import("std");

const example = @embedFile("example");
const input = @embedFile("input");

pub fn main() anyerror!void {
    try std.testing.expectEqual(solve(example), 12);
    const result = try solve(input);
    try std.io.getStdOut().writer().print("{}\n", .{result});
}

const scores = [3][3]u8{ // X  Y  Z
    [3]u8{ 4, 8, 3 }, // A  4  8  3
    [3]u8{ 1, 5, 9 }, // B  1  5  9
    [3]u8{ 7, 2, 6 }, // C  7  2  6
};

const strategy = [3][3]u8{ // X  Y  Z
    [3]u8{ 2, 0, 1 }, //   A  2  0  1
    [3]u8{ 0, 1, 2 }, //   B  0  1  2
    [3]u8{ 1, 2, 0 }, //   C  1  2  0
};

fn solve(puzzle: []const u8) !u64 {
    var it = std.mem.tokenize(u8, puzzle, "\n");
    var tot: u64 = 0;
    while (it.next()) |line| {
        const move = strategy[line[0] - 'A'][line[2] - 'X'];
        tot += scores[line[0] - 'A'][move];
    }
    return tot;
}