1
Fork 0
mirror of https://github.com/thegeneralist01/aoc synced 2026-03-07 10:59:54 +01:00

day 6, 7; working on 8

This commit is contained in:
TheGeneralist 2024-12-23 22:04:55 +01:00
parent d0fbf0cc5e
commit 2b3a95fa49
Signed by: thegeneralist01
SSH key fingerprint: SHA256:pp9qddbCNmVNoSjevdvQvM5z0DHN7LTa8qBMbcMq/R4
6 changed files with 8463 additions and 0 deletions

4
day6/alr Normal file
View file

@ -0,0 +1,4 @@
.#..
...#
#^..
..#.

174
day6/day6_part2.zig Normal file
View file

@ -0,0 +1,174 @@
const std = @import("std");
const in = @embedFile("in");
const Direction = struct {
x: i32,
y: i32,
const Left = Direction{ .x = -1, .y = 0 };
const Right = Direction{ .x = 1, .y = 0 };
const Up = Direction{ .x = 0, .y = -1 };
const Down = Direction{ .x = 0, .y = 1 };
pub fn eql(self: Direction, other: Direction) bool {
return self.x == other.x and self.y == other.y;
}
};
const Point = struct {
x: i32,
y: i32,
dir: Direction,
};
fn array_includes(comptime T: type, haystack: []T, needle: T) bool {
for (haystack) |item| {
if (item == needle) {
return true;
}
}
return false;
}
fn turn_right(direction: Direction) Direction {
if (direction.eql(Direction.Up)) {
return Direction.Right;
} else if (direction.eql(Direction.Right)) {
return Direction.Down;
} else if (direction.eql(Direction.Down)) {
return Direction.Left;
} else if (direction.eql(Direction.Left)) {
return Direction.Up;
}
unreachable;
}
fn find_guard(lines: std.ArrayList(std.ArrayList(i8))) [2]i32 {
for (lines.items, 0..) |line, y| {
for (line.items, 0..) |item, x| {
if (item == 1) {
return .{ @intCast(x), @intCast(y) };
}
}
}
unreachable;
}
fn print_lines(lines: std.ArrayList(std.ArrayList(i8))) void {
for (lines.items) |line| {
for (line.items) |item| {
switch (item) {
-1 => std.debug.print("#", .{}),
0 => std.debug.print(".", .{}),
1 => std.debug.print("^", .{}),
2 => std.debug.print("V", .{}),
else => std.debug.print(" ", .{}),
}
}
std.debug.print("\n", .{});
}
}
fn count_visited(lines: std.ArrayList(std.ArrayList(i8))) u32 {
var count: u32 = 0;
for (lines.items) |line| {
for (line.items) |e| {
if (e == 2 or e == 1) count += 1;
}
}
return count;
}
fn is_cycle(lines: std.ArrayList(std.ArrayList(i8)), direction: Direction, iters: u64) bool {
const pos = find_guard(lines);
var x = pos[0];
var y = pos[1];
var current_direction = direction;
var current_iters = iters;
while (true) {
lines.items[@intCast(y)].items[@intCast(x)] = 0;
x += current_direction.x;
y += current_direction.y;
if (y < 0 or y >= lines.items.len or x < 0 or x >= lines.items[@intCast(y)].items.len) {
return false;
}
if (current_iters >= 100_000) {
return true;
}
if (lines.items[@intCast(y)].items[@intCast(x)] == -1) {
x -= current_direction.x;
y -= current_direction.y;
lines.items[@intCast(y)].items[@intCast(x)] = 1;
current_direction = turn_right(current_direction);
current_iters += 1;
continue;
}
lines.items[@intCast(y)].items[@intCast(x)] = 1;
current_iters += 1;
}
}
pub fn main() !void {
var gpa = std.heap.GeneralPurposeAllocator(.{}){};
const ally = gpa.allocator();
defer _ = gpa.deinit();
var lines = std.ArrayList(std.ArrayList(i8)).init(ally);
defer {
for (lines.items) |*line| {
line.deinit();
}
lines.deinit();
}
var in_lines = std.mem.tokenize(u8, in, "\n");
var original_me = Point{ .x = 0, .y = 0, .dir = Direction.Up };
var _i: u32 = 0;
while (in_lines.next()) |linestr| {
var line = std.ArrayList(i8).init(ally);
for (linestr, 0..) |c, j| {
const value: i8 = switch (c) {
'#' => -1,
'.' => 0,
'^' => 1,
else => -2,
};
if (value == 1) {
original_me.x = @intCast(j);
original_me.y = @intCast(_i);
}
try line.append(value);
}
try lines.append(line);
_i += 1;
}
var ncycles: u32 = 0;
for (lines.items, 0..) |line, i| {
for (line.items, 0..) |c, j| {
std.debug.print("\n\nx{}y{}\n", .{j, i});
if (c == -1 or c == 1) continue;
const value = lines.items[i].items[j];
lines.items[i].items[j] = -1;
if (is_cycle(lines, Direction.Up, 0))
ncycles += 1;
for (lines.items, 0..) |l, _i2| {
for (l.items, 0..) |e, j2| {
if (e == 2) {
lines.items[_i2].items[j2] = 1;
}
}
}
lines.items[@intCast(original_me.y)].items[@intCast(original_me.x)] = 1;
lines.items[i].items[j] = value;
}
}
std.debug.print("{d}\n", .{ncycles});
}

7366
day6/out Normal file

File diff suppressed because it is too large Load diff