voroskoi/aoc2023-zig - Change QPKXJMLTEE4YLKJELSVSAMSQYEQDILNIOJVZUD43VOJSFN6LBS2QC

Solve day7

Created by voroskoi on February 22, 2024

QPKXJMLTEE4YLKJELSVSAMSQYEQDILNIOJVZUD43VOJSFN6LBS2QC

Dependencies

In channels

main

Change contents

Replacement in src/main.zig at line 5 [3.50]
B:BD[3.105] → [2.0:16]
```
const DAYS = 6;
```
[3.105]
[3.121]
```
const DAYS = 7;
```
Insertion in src/main.zig at line 14 [3.50]
[2.57]
[3.187]
```
    const day07 = @import("day07.zig");
```
Insertion in src/main.zig at line 24 [3.50]
[2.88]
[3.228]
```
    _ = @import("day07.zig");
```

File addition: day07.txt (----------)

[3.2193]

File addition: day07.zig (----------)

[3.15]

const std = @import("std");
const PATH = "input/day07.txt";
pub fn first(allocator: std.mem.Allocator) !usize {
    const hands = try First.parseInput(allocator, @embedFile(PATH));
    defer allocator.free(hands);
    std.mem.sort(First.Hand, hands, {}, First.Hand.lessThan);
    var ret: usize = 0;
    for (hands, 1..) |hand, i| {
        ret += hand.bid * i;
    }
    return ret;
}
pub fn second(allocator: std.mem.Allocator) !usize {
    const hands = try Second.parseInput(allocator, @embedFile(PATH));
    defer allocator.free(hands);
    std.mem.sort(Second.Hand, hands, {}, Second.Hand.lessThan);
    var ret: usize = 0;
    for (hands, 1..) |hand, i| {
        ret += hand.bid * i;
    }
    return ret;
}
const BidType = u16;
const HandType = enum {
    high_card,
    one_pair,
    two_pair,
    three_of_a_kind,
    full_house,
    four_of_a_kind,
    five_of_a_kind,
};
const First = struct {
    const Card = enum { @"2", @"3", @"4", @"5", @"6", @"7", @"8", @"9", T, J, Q, K, A };
    const Hand = struct {
        cards: [5]Card,
        bid: BidType,
        type: HandType,
        fn getType(self: @This(), allocator: std.mem.Allocator) !HandType {
            var map = std.AutoHashMap(Card, u3).init(allocator);
            defer map.deinit();
            for (self.cards) |card| {
                const res = try map.getOrPut(card);
                if (res.found_existing) res.value_ptr.* += 1 else res.value_ptr.* = 1;
            }
            switch (map.count()) {
                1 => return .five_of_a_kind,
                2 => {
                    var it = map.valueIterator();
                    while (it.next()) |v| {
                        if (v.* == 4) return .four_of_a_kind;
                    }
                    return .full_house;
                },
                3 => {
                    var it = map.valueIterator();
                    while (it.next()) |v| {
                        if (v.* == 3) return .three_of_a_kind;
                    }
                    return .two_pair;
                },
                4 => return .one_pair,
                5 => return .high_card,
                else => unreachable,
            }
            unreachable;
        }
        fn lessThan(context: void, a: @This(), b: @This()) bool {
            _ = context;
            if (@intFromEnum(a.type) < @intFromEnum(b.type)) {
                return true;
            } else if (@intFromEnum(a.type) > @intFromEnum(b.type)) {
                return false;
            } else {
                for (0..5) |i| {
                    if (@intFromEnum(a.cards[i]) < @intFromEnum(b.cards[i])) {
                        return true;
                    } else if (@intFromEnum(a.cards[i]) > @intFromEnum(b.cards[i])) {
                        return false;
                    }
                }
            }
            unreachable;
        }
    };
    fn parseInput(allocator: std.mem.Allocator, input: []const u8) ![]Hand {
        var hands = std.ArrayList(Hand).init(allocator);
        var lines = std.mem.splitScalar(u8, input, '\n');
        while (lines.next()) |line| {
            if (line.len == 0) break;
            var hand: Hand = undefined;
            var cb = std.mem.tokenizeScalar(u8, line, ' ');
            for (cb.next().?, 0..) |ch, i| {
                switch (ch) {
                    '2' => hand.cards[i] = .@"2",
                    '3' => hand.cards[i] = .@"3",
                    '4' => hand.cards[i] = .@"4",
                    '5' => hand.cards[i] = .@"5",
                    '6' => hand.cards[i] = .@"6",
                    '7' => hand.cards[i] = .@"7",
                    '8' => hand.cards[i] = .@"8",
                    '9' => hand.cards[i] = .@"9",
                    'T' => hand.cards[i] = .T,
                    'J' => hand.cards[i] = .J,
                    'Q' => hand.cards[i] = .Q,
                    'K' => hand.cards[i] = .K,
                    'A' => hand.cards[i] = .A,
                    else => unreachable,
                }
            }
            hand.bid = try std.fmt.parseUnsigned(BidType, cb.next().?, 10);
            hand.type = try hand.getType(allocator);
            try hands.append(hand);
        }
        return hands.toOwnedSlice();
    }
};
const Second = struct {
    const Card = enum { J, @"2", @"3", @"4", @"5", @"6", @"7", @"8", @"9", T, Q, K, A };
    const Hand = struct {
        cards: [5]Card,
        bid: BidType,
        type: HandType,
        fn getType(self: @This(), allocator: std.mem.Allocator) !HandType {
            var map = std.AutoHashMap(Card, u3).init(allocator);
            defer map.deinit();
            for (self.cards) |card| {
                if (card == .J) continue;
                const res = try map.getOrPut(card);
                if (res.found_existing) res.value_ptr.* += 1 else res.value_ptr.* = 1;
            }
            for (self.cards) |card| {
                var it = map.valueIterator();
                if (card == .J) {
                    while (it.next()) |v| {
                        v.* += 1;
                    }
                }
            }
            switch (map.count()) {
                0, 1 => return .five_of_a_kind,
                2 => {
                    var it = map.valueIterator();
                    while (it.next()) |v| {
                        if (v.* == 4) return .four_of_a_kind;
                    }
                    return .full_house;
                },
                3 => {
                    var it = map.valueIterator();
                    while (it.next()) |v| {
                        if (v.* == 3) return .three_of_a_kind;
                    }
                    return .two_pair;
                },
                4 => return .one_pair,
                5 => return .high_card,
                else => unreachable,
            }
            unreachable;
        }
        fn lessThan(context: void, a: @This(), b: @This()) bool {
            _ = context;
            if (@intFromEnum(a.type) < @intFromEnum(b.type)) {
                return true;
            } else if (@intFromEnum(a.type) > @intFromEnum(b.type)) {
                return false;
            } else {
                for (0..5) |i| {
                    if (@intFromEnum(a.cards[i]) < @intFromEnum(b.cards[i])) {
                        return true;
                    } else if (@intFromEnum(a.cards[i]) > @intFromEnum(b.cards[i])) {
                        return false;
                    }
                }
            }
            unreachable;
        }
    };
    fn parseInput(allocator: std.mem.Allocator, input: []const u8) ![]Hand {
        var hands = std.ArrayList(Hand).init(allocator);
        var lines = std.mem.splitScalar(u8, input, '\n');
        while (lines.next()) |line| {
            if (line.len == 0) break;
            var hand: Hand = undefined;
            var cb = std.mem.tokenizeScalar(u8, line, ' ');
            for (cb.next().?, 0..) |ch, i| {
                switch (ch) {
                    '2' => hand.cards[i] = .@"2",
                    '3' => hand.cards[i] = .@"3",
                    '4' => hand.cards[i] = .@"4",
                    '5' => hand.cards[i] = .@"5",
                    '6' => hand.cards[i] = .@"6",
                    '7' => hand.cards[i] = .@"7",
                    '8' => hand.cards[i] = .@"8",
                    '9' => hand.cards[i] = .@"9",
                    'T' => hand.cards[i] = .T,
                    'J' => hand.cards[i] = .J,
                    'Q' => hand.cards[i] = .Q,
                    'K' => hand.cards[i] = .K,
                    'A' => hand.cards[i] = .A,
                    else => unreachable,
                }
            }
            hand.bid = try std.fmt.parseUnsigned(BidType, cb.next().?, 10);
            hand.type = try hand.getType(allocator);
            try hands.append(hand);
        }
        return hands.toOwnedSlice();
    }
};
test "day07a" {
    try std.testing.expectEqual(@as(usize, 248453531), try first(std.testing.allocator));
}
test "day07b" {
    try std.testing.expectEqual(@as(usize, 248781813), try second(std.testing.allocator));
}
const test_input =
    \\32T3K 765
    \\T55J5 684
    \\KK677 28
    \\KTJJT 220
    \\QQQJA 483
;

Solve day7

Dependencies

In channels

Change contents

Replacement in src/main.zig at line 5 [3.50]

Insertion in src/main.zig at line 14 [3.50]

Insertion in src/main.zig at line 24 [3.50]

File addition: day07.txt (----------)

File addition: day07.zig (----------)