adrien/Advent-of-Code
1
0
Fork 0
Code

Update day 5

Browse Source
This commit is contained in:
Adrien Bouvais 2024-12-08 01:27:58 +01:00
parent 67337332c8
commit f9448c3986
2 changed files with 8 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
day5/part1.zig
View File

@ -69,10 +69,10 @@ pub fn main() !void {
while (iter.next()) |line| { while (iter.next()) |line| {
if (std.mem.eql(u8, line, "")) break; if (std.mem.eql(u8, line, "")) break;
_ = try bad_rules.getOrPut(Rule{ _ = try bad_rules.put(Rule{
.right = try std.fmt.parseInt(usize, line[0..2], 10), .right = try std.fmt.parseInt(usize, line[0..2], 10),
.left = try std.fmt.parseInt(usize, line[3..5], 10), .left = try std.fmt.parseInt(usize, line[3..5], 10),
}); }, {});
} }
// ========= Evaluate =========== // ========= Evaluate ===========

34
day5/part2.zig
View File

@ -6,8 +6,7 @@ const Rule = struct {
right: usize, right: usize,
fn ok(self: Rule, sub_page: Rule) bool { fn ok(self: Rule, sub_page: Rule) bool {
if (sub_page.left == self.right and sub_page.right == self.left) return false; return !(sub_page.left == self.right and sub_page.right == self.left);
return true;
} }
}; };
@ -70,10 +69,10 @@ pub fn main() !void {
while (iter.next()) |line| { while (iter.next()) |line| {
if (std.mem.eql(u8, line, "")) break; if (std.mem.eql(u8, line, "")) break;
_ = try bad_rules.getOrPut(Rule{ _ = try bad_rules.put(Rule{
.right = try std.fmt.parseInt(usize, line[0..2], 10), .right = try std.fmt.parseInt(usize, line[0..2], 10),
.left = try std.fmt.parseInt(usize, line[3..5], 10), .left = try std.fmt.parseInt(usize, line[3..5], 10),
}); }, {});
} }
// ========= Evaluate =========== // ========= Evaluate ===========
@ -93,36 +92,15 @@ pub fn main() !void {
total += try evaluate(bad_rules, page.items); total += try evaluate(bad_rules, page.items);
} }
try std.testing.expectEqual(4145, total); try std.testing.expectEqual(6949, total);
} }
fn pageOk(bad_rules: std.AutoHashMap(Rule, void), page: []usize) bool { fn evaluate(bad_rules: std.AutoHashMap(Rule, void), page: []usize) !usize {
var iter = PageIterator{ .indexL = 0, .indexR = 0, .buff = page }; var iter = PageIterator{ .indexL = 0, .indexR = 0, .buff = page };
defer iter.reset(); defer iter.reset();
while (iter.next()) |sub_page| { while (iter.next()) |sub_page| {
if (bad_rules.contains(sub_page)) return false; if (bad_rules.contains(sub_page)) return 0;
}
return true;
}
fn evaluate(bad_rules: std.AutoHashMap(Rule, void), page: []usize) !usize {
var notOk = true;
var iter = PageIterator{ .indexL = 0, .indexR = 0, .buff = page };
if (pageOk(bad_rules, page)) return 0;
while (notOk) {
notOk = false;
blk: {
while (iter.next()) |sub_page| {
if (bad_rules.contains(sub_page)) {
notOk = true;
iter.swap();
break :blk;
}
}
}
} }
const middle = try std.math.divFloor(usize, page.len, 2); const middle = try std.math.divFloor(usize, page.len, 2);
return page[middle]; return page[middle];