lucia/aoc2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: lucia:d5bd0322c7cad0e2a33d3d912dfaaee702706064
Branches Tags
lucia:master
...
compare: lucia:master
Branches Tags
lucia:master

6 Commits
d5bd0322c7 ... master

Author SHA1 Message Date
Lucia Ceionia
10ed356fb2 day 15 2024-12-15 01:10:07 -06:00
Lucia Ceionia
f977c15e5f day 14 2024-12-14 17:23:15 -06:00
Lucia Ceionia
22e2987cfc day 13 2024-12-13 01:59:27 -06:00
Lucia Ceionia
fe0a773138 day 12 (awful) 2024-12-12 00:28:39 -06:00
Lucia Ceionia
eff926cd5b day 11 2024-12-11 01:02:00 -06:00
Lucia Ceionia
78e2d8c6be day 10 2024-12-11 01:01:57 -06:00
19 changed files with 1963 additions and 0 deletions
Expand all files Collapse all files

67
10/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "10",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
10/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "10",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

154
10/src/main.zig Normal file
View File

@@ -0,0 +1,154 @@
// zig is growing on me tbh
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(36, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(81, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
fn run2(input: []const u8) !u64 {
var map: [64][64]u8 = [_][64]u8{[_]u8{0}**64}**64;
var lines = std.mem.splitScalar(u8, input, '\n');
var y: usize = 0;
var x: usize = 0;
var dim: usize = undefined;
while (lines.next()) |line| {
if (std.mem.eql(u8, line, "")) continue;
std.mem.copyForwards(u8, &map[y], line);
std.debug.print("{s}\n",.{line});
dim = line.len;
y += 1;
}
std.debug.print("map max {}\n", .{dim});
var total: u64 = 0;
var outmap: [64][64]u8 = [_][64]u8{[_]u8{0}**64}**64;
y = 0;
while (y < dim) : (y += 1) {
x = 0;
while (x < dim) : (x += 1) {
if (map[y][x] == '9') {
checkpath2(y, x, dim, &map, &outmap);
}
}
}
y = 0;
while (y < dim) : (y += 1) {
x = 0;
while (x < dim) : (x += 1) {
total += outmap[y][x];
}
}
return total;
}
fn checkpath2(y: usize, x: usize, dim: usize, map: *[64][64]u8, outmap: *[64][64]u8) void {
const c = map[y][x];
if (c == '0') {
outmap[y][x] += 1;
return;
}
if (y > 0) if (map[y-1][x] == c-1) { checkpath2(y-1, x, dim, map, outmap); };
if (x > 0) if (map[y][x-1] == c-1) { checkpath2(y, x-1, dim, map, outmap); };
if (y < dim-1) if (map[y+1][x] == c-1) { checkpath2(y+1, x, dim, map, outmap); };
if (x < dim-1) if (map[y][x+1] == c-1) { checkpath2(y, x+1, dim, map, outmap); };
}
fn checkpath(y: usize, x: usize, dim: usize, map: *[64][64]u8, outmap: *[64][64]u8) void {
const c = map[y][x];
if (c == '0') {
outmap[y][x] = 1;
return;
}
if (y > 0) if (map[y-1][x] == c-1) { checkpath(y-1, x, dim, map, outmap); };
if (x > 0) if (map[y][x-1] == c-1) { checkpath(y, x-1, dim, map, outmap); };
if (y < dim-1) if (map[y+1][x] == c-1) { checkpath(y+1, x, dim, map, outmap); };
if (x < dim-1) if (map[y][x+1] == c-1) { checkpath(y, x+1, dim, map, outmap); };
}
fn run1(input: []const u8) !u64 {
var map: [64][64]u8 = [_][64]u8{[_]u8{0}**64}**64;
var lines = std.mem.splitScalar(u8, input, '\n');
var y: usize = 0;
var x: usize = 0;
var dim: usize = undefined;
while (lines.next()) |line| {
if (std.mem.eql(u8, line, "")) continue;
std.mem.copyForwards(u8, &map[y], line);
std.debug.print("{s}\n",.{line});
dim = line.len;
y += 1;
}
std.debug.print("map max {}\n", .{dim});
var total: u64 = 0;
var outmap: [64][64]u8 = undefined;
y = 0;
while (y < dim) : (y += 1) {
x = 0;
while (x < dim) : (x += 1) {
if (map[y][x] == '9') {
outmap = [_][64]u8{[_]u8{0}**64}**64;
checkpath(y, x, dim, &map, &outmap);
var iy: usize = 0;
while (iy < dim) : (iy += 1) {
var ix: usize = 0;
while (ix < dim) : (ix += 1) {
total += outmap[iy][ix];
}
}
}
}
}
return total;
}

67
11/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "11",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
11/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "11",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

147
11/src/main.zig Normal file
View File

@@ -0,0 +1,147 @@
// i bruteforced part 1 at first but then i made it the part 2 implementation cause it's just better
// quite tipsy and zig is nice tbh . fuck .
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(55312, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(0, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
fn run2(input: []const u8) !u64 {
var stones = std.AutoArrayHashMap(u64, u64).init(alloc);
var fbs = std.io.fixedBufferStream(input);
var reader = fbs.reader();
while (true) {
const i = parseIntFromReader(&reader) catch break;
const v = stones.get(i) orelse 0;
try stones.put(i, v+1);
}
for (0..75) |n| {
std.debug.print("{}...",.{n});
var new = std.AutoArrayHashMap(u64, u64).init(alloc);
var iter = stones.iterator();
while (iter.next()) |e| {
const s = e.key_ptr.*;
const c = e.value_ptr.*;
if (s == 0) {
const v = new.get(1) orelse 0;
try new.put(1, v+c);
continue;
}
const digits = std.math.log10(s) + 1;
if (digits & 1 == 0) {
const split = std.math.pow(u64, 10, digits/2);
const left = s / split;
const right = s % split;
const vl = new.get(left) orelse 0;
try new.put(left, vl+c);
const vr = new.get(right) orelse 0;
try new.put(right, vr+c);
continue;
}
const v = new.get(s*2024) orelse 0;
try new.put(s*2024, v+c);
}
stones.deinit();
stones = new;
}
std.debug.print("\n",.{});
var total: u64 = 0;
for (stones.values()) |v| {
total += v;
}
return total;
}
fn run1(input: []const u8) !u64 {
var stones = std.AutoArrayHashMap(u64, u64).init(alloc);
var fbs = std.io.fixedBufferStream(input);
var reader = fbs.reader();
while (true) {
const i = parseIntFromReader(&reader) catch break;
const v = stones.get(i) orelse 0;
try stones.put(i, v+1);
}
for (0..25) |n| {
std.debug.print("{}...",.{n});
var new = std.AutoArrayHashMap(u64, u64).init(alloc);
var iter = stones.iterator();
while (iter.next()) |e| {
const s = e.key_ptr.*;
const c = e.value_ptr.*;
if (s == 0) {
const v = new.get(1) orelse 0;
try new.put(1, v+c);
continue;
}
const digits = std.math.log10(s) + 1;
if (digits & 1 == 0) {
const split = std.math.pow(u64, 10, digits/2);
const left = s / split;
const right = s % split;
const vl = new.get(left) orelse 0;
try new.put(left, vl+c);
const vr = new.get(right) orelse 0;
try new.put(right, vr+c);
continue;
}
const v = new.get(s*2024) orelse 0;
try new.put(s*2024, v+c);
}
stones.deinit();
stones = new;
}
std.debug.print("\n",.{});
var total: u64 = 0;
for (stones.values()) |v| {
total += v;
}
return total;
}

67
12/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "12",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
12/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "12",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

269
12/src/main.zig Normal file
View File

@@ -0,0 +1,269 @@
// wow! i am bad at code. shitty day i just wanted it to Work
// awful way to do it especially in part 2 what was i even doing
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(1930, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(1206, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
var r2map: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
var r2done: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
var r2edges: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
var r2dim: usize = undefined;
fn run2_r(y: usize, x: usize) void {
const c = r2map[y][x];
r2done[y][x] = 1;
if (y > 0 and r2map[y-1][x] == c) {
if (r2done[y-1][x] == 0) run2_r(y-1, x);
} else {
r2edges[y][x] |= 0b1;
}
if (x > 0 and r2map[y][x-1] == c) {
if (r2done[y][x-1] == 0) run2_r(y, x-1);
} else {
r2edges[y][x] |= 0b10;
}
if (y < r2dim-1 and r2map[y+1][x] == c) {
if (r2done[y+1][x] == 0) run2_r(y+1, x);
} else {
r2edges[y][x] |= 0b100;
}
if (x < r2dim-1 and r2map[y][x+1] == c) {
if (r2done[y][x+1] == 0) run2_r(y, x+1);
} else {
r2edges[y][x] |= 0b1000;
}
}
fn run2_r2(y: usize, x: usize, area: *u64, perimeter: *u64) void {
const c = r2map[y][x];
r2done[y][x] = 2;
area.* += 1;
// top edge
if (r2edges[y][x] & 0b1 != 0) {
perimeter.* += 1;
var ix = x;
while (ix >= 0) : (ix -= 1) {
if (r2map[y][ix] != c) break;
if (r2edges[y][ix] & 0b1 == 0) break;
r2edges[y][ix] &= ~@as(u8,0b1);
if (ix == 0) break;
}
ix = x+1;
while (ix < r2dim) : (ix += 1) {
if (r2map[y][ix] != c) break;
if (r2edges[y][ix] & 0b1 == 0) break;
r2edges[y][ix] &= ~@as(u8,0b1);
}
}
// bottom edge
if (r2edges[y][x] & 0b100 != 0) {
perimeter.* += 1;
var ix = x;
while (ix >= 0) : (ix -= 1) {
if (r2map[y][ix] != c) break;
if (r2edges[y][ix] & 0b100 == 0) break;
r2edges[y][ix] &= ~@as(u8,0b100);
if (ix == 0) break;
}
ix = x+1;
while (ix < r2dim) : (ix += 1) {
if (r2map[y][ix] != c) break;
if (r2edges[y][ix] & 0b100 == 0) break;
r2edges[y][ix] &= ~@as(u8,0b100);
}
}
// left edge
if (r2edges[y][x] & 0b10 != 0) {
perimeter.* += 1;
var iy = y;
while (iy >= 0) : (iy -= 1) {
if (r2map[iy][x] != c) break;
if (r2edges[iy][x] & 0b10 == 0) break;
r2edges[iy][x] &= ~@as(u8,0b10);
if (iy == 0) break;
}
iy = y+1;
while (iy < r2dim) : (iy += 1) {
if (r2map[iy][x] != c) break;
if (r2edges[iy][x] & 0b10 == 0) break;
r2edges[iy][x] &= ~@as(u8,0b10);
}
}
// right edge
if (r2edges[y][x] & 0b1000 != 0) {
perimeter.* += 1;
var iy = y;
while (iy >= 0) : (iy -= 1) {
if (r2map[iy][x] != c) break;
if (r2edges[iy][x] & 0b1000 == 0) break;
r2edges[iy][x] &= ~@as(u8,0b1000);
if (iy == 0) break;
}
iy = y+1;
while (iy < r2dim) : (iy += 1) {
if (r2map[iy][x] != c) break;
if (r2edges[iy][x] & 0b1000 == 0) break;
r2edges[iy][x] &= ~@as(u8,0b1000);
}
}
if (y > 0 and r2map[y-1][x] == c) {
if (r2done[y-1][x] == 1) run2_r2(y-1, x, area, perimeter);
}
if (x > 0 and r2map[y][x-1] == c) {
if (r2done[y][x-1] == 1) run2_r2(y, x-1, area, perimeter);
}
if (y < r2dim-1 and r2map[y+1][x] == c) {
if (r2done[y+1][x] == 1) run2_r2(y+1, x, area, perimeter);
}
if (x < r2dim-1 and r2map[y][x+1] == c) {
if (r2done[y][x+1] == 1) run2_r2(y, x+1, area, perimeter);
}
}
fn run2(input: []const u8) !u64 {
var lines = std.mem.splitScalar(u8, input, '\n');
{
var y: usize = 0;
while (lines.next()) |line| {
if (std.mem.eql(u8, line, "")) continue;
std.mem.copyForwards(u8, &r2map[y], line);
std.debug.print("{s}\n",.{line});
r2dim = line.len;
y += 1;
}
}
std.debug.print("map max {}\n", .{r2dim});
var total: u64 = 0;
for (0..r2dim) |y| {
for (0..r2dim) |x| {
if (r2done[y][x] > 0) continue;
run2_r(y, x);
var area: u64 = 0;
var perimeter: u64 = 0;
run2_r2(y, x, &area, &perimeter);
total += area * perimeter;
}
}
return total;
}
var r1map: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
var r1done: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
var r1dim: usize = undefined;
fn run1_r(y: usize, x: usize, area: *u64, perimeter: *u64) void {
const c = r1map[y][x];
area.* += 1;
r1done[y][x] = 1;
if (y > 0 and r1map[y-1][x] == c) {
if (r1done[y-1][x] == 0) run1_r(y-1, x, area, perimeter);
} else {
perimeter.* += 1;
}
if (x > 0 and r1map[y][x-1] == c) {
if (r1done[y][x-1] == 0) run1_r(y, x-1, area, perimeter);
} else {
perimeter.* += 1;
}
if (y < r1dim-1 and r1map[y+1][x] == c) {
if (r1done[y+1][x] == 0) run1_r(y+1, x, area, perimeter);
} else {
perimeter.* += 1;
}
if (x < r1dim-1 and r1map[y][x+1] == c) {
if (r1done[y][x+1] == 0) run1_r(y, x+1, area, perimeter);
} else {
perimeter.* += 1;
}
}
fn run1(input: []const u8) !u64 {
var lines = std.mem.splitScalar(u8, input, '\n');
{
var y: usize = 0;
while (lines.next()) |line| {
if (std.mem.eql(u8, line, "")) continue;
std.mem.copyForwards(u8, &r1map[y], line);
std.debug.print("{s}\n",.{line});
r1dim = line.len;
y += 1;
}
}
std.debug.print("map max {}\n", .{r1dim});
var total: u64 = 0;
for (0..r1dim) |y| {
for (0..r1dim) |x| {
if (r1done[y][x] == 1) continue;
var area: u64 = 0;
var perimeter: u64 = 0;
run1_r(y, x, &area, &perimeter);
total += area * perimeter;
}
}
return total;
}

67
13/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "13",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
13/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "13",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

161
13/src/main.zig Normal file
View File

@@ -0,0 +1,161 @@
// i hate math
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(480, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(0, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
// had some ideas but.
// i hate math.
// cheated. thx plasma ily :3
fn solve(a:f64,b:f64,c:f64,d:f64,e:f64,f:f64) [2]f64 {
const y = ((a*f)-(c*d))/(a*e-b*d);
const x = (c-b*y)/a;
return .{x,y};
}
fn run2(input: []const u8) !u64 {
const STATES = enum { A, B, G };
var state = STATES.A;
var lines = std.mem.splitScalar(u8, input, '\n');
var total: u64 = 0;
var ax: u64 = undefined;
var ay: u64 = undefined;
var bx: u64 = undefined;
var by: u64 = undefined;
while (lines.next()) |line| {
if (line.len == 0) continue;
var i: usize = 0;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const x_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const x_e: usize = i;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const y_s: usize = i;
while (i < line.len and line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const y_e: usize = i;
var x = try std.fmt.parseInt(u64, line[x_s..x_e], 10);
var y = try std.fmt.parseInt(u64, line[y_s..y_e], 10);
switch (state) {
STATES.A => { ax = x; ay = y; state = STATES.B; },
STATES.B => { bx = x; by = y; state = STATES.G; },
STATES.G => {
x += 10000000000000;
y += 10000000000000;
const a: f64 = @floatFromInt(ax);
const d: f64 = @floatFromInt(ay);
const b: f64 = @floatFromInt(bx);
const e: f64 = @floatFromInt(by);
const c: f64 = @floatFromInt(x);
const f: f64 = @floatFromInt(y);
const r = solve(a,b,c,d,e,f);
const xi: u64 = @intFromFloat(r[0]);
const yi: u64 = @intFromFloat(r[1]);
const xm: f64 = @floatFromInt(xi);
const ym: f64 = @floatFromInt(yi);
if (xm-r[0] == 0 and ym-r[1] == 0) {
total += xi*3 + yi;
}
state = STATES.A;
}
}
}
total += 0;
return total;
}
fn run1(input: []const u8) !u64 {
const STATES = enum { A, B, G };
var state = STATES.A;
var lines = std.mem.splitScalar(u8, input, '\n');
var total: u64 = 0;
var ax: u64 = undefined;
var ay: u64 = undefined;
var bx: u64 = undefined;
var by: u64 = undefined;
while (lines.next()) |line| {
if (line.len == 0) continue;
var i: usize = 0;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const x_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const x_e: usize = i;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const y_s: usize = i;
while (i < line.len and line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const y_e: usize = i;
const x = try std.fmt.parseInt(u64, line[x_s..x_e], 10);
const y = try std.fmt.parseInt(u64, line[y_s..y_e], 10);
switch (state) {
STATES.A => { ax = x; ay = y; state = STATES.B; },
STATES.B => { bx = x; by = y; state = STATES.G; },
STATES.G => {
// find smallest solution
var bp: u64 = 1;
var ap: u64 = 0;
find: {
while ((ax*ap + bx*bp) != x or (ay*ap + by*bp) != y) {
bp += 1;
if (bp == 100) {
if (ap == 100) break :find;
bp = 0;
ap += 1;
}
}
total += bp + ap*3;
}
state = STATES.A;
}
}
}
return total;
}

1
14/.gitignore vendored Normal file
View File

@@ -0,0 +1 @@
png

67
14/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "14",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
14/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "14",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

148
14/src/main.zig Normal file
View File

@@ -0,0 +1,148 @@
// part 2 lmao
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data,101,103);
try stdout.print("{d}\n", .{value1});
for (0..10000) |i| {
std.debug.print("{d} seconds\n",.{i});
try run2(input_data,101,103,@intCast(i));
}
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data,11,7);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(12, value);
}
//test "test input part 2" {
// std.debug.print("\n",.{});
// const value = try run2(test_data);
// std.debug.print("{d}\n", .{value});
// try std.testing.expectEqual(0, value);
//}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
fn run2(input: []const u8, sx: i64, sy: i64, n: i64) !void {
var lines = std.mem.splitScalar(u8, input, '\n');
var outmap: []u8 = try alloc.alloc(u8, @intCast(sx*sy));
@memset(outmap, '0');
while (lines.next()) |line| {
if (line.len == 0) continue;
var i: usize = 0;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const px_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const px_e: usize = i;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const py_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const py_e: usize = i;
while ((line[i] < '0' or line[i] > '9') and line[i] != '-') : (i += 1) {}
const vx_s: usize = i;
while ((line[i] >= '0' and line[i] <= '9') or line[i]=='-') : (i += 1) {}
const vx_e: usize = i;
while ((line[i] < '0' or line[i] > '9') and line[i] != '-') : (i += 1) {}
const vy_s: usize = i;
while (i < line.len and ((line[i] >= '0' and line[i] <= '9') or line[i]=='-')) : (i += 1) {}
const vy_e: usize = i;
const px = try std.fmt.parseInt(i64, line[px_s..px_e], 10);
const py = try std.fmt.parseInt(i64, line[py_s..py_e], 10);
const vx = try std.fmt.parseInt(i64, line[vx_s..vx_e], 10);
const vy = try std.fmt.parseInt(i64, line[vy_s..vy_e], 10);
const fx: i64 = @mod((px + vx * n), sx);
const fy: i64 = @mod((py + vy * n), sy);
outmap[@intCast(fy*sx + fx)] = '1';
}
const path = try std.fmt.allocPrint(alloc, "{d:0>5}.pbm", .{@as(u64, @intCast(n))});
const file = try std.fs.cwd().createFile(path, .{});
defer file.close();
const header = try std.fmt.allocPrint(alloc, "P1\n# do i need a comment\n{} {}\n", .{sx,sy});
try file.writeAll(header);
try file.writeAll(outmap);
}
fn run1(input: []const u8, sx: i64, sy: i64) !u64 {
var lines = std.mem.splitScalar(u8, input, '\n');
var quads: [4]u64 = .{0}**4;
var total: u64 = 0;
while (lines.next()) |line| {
if (line.len == 0) continue;
var i: usize = 0;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const px_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const px_e: usize = i;
while (line[i] < '0' or line[i] > '9') : (i += 1) {}
const py_s: usize = i;
while (line[i] >= '0' and line[i] <= '9') : (i += 1) {}
const py_e: usize = i;
while ((line[i] < '0' or line[i] > '9') and line[i] != '-') : (i += 1) {}
const vx_s: usize = i;
while ((line[i] >= '0' and line[i] <= '9') or line[i]=='-') : (i += 1) {}
const vx_e: usize = i;
while ((line[i] < '0' or line[i] > '9') and line[i] != '-') : (i += 1) {}
const vy_s: usize = i;
while (i < line.len and ((line[i] >= '0' and line[i] <= '9') or line[i]=='-')) : (i += 1) {}
const vy_e: usize = i;
const px = try std.fmt.parseInt(i64, line[px_s..px_e], 10);
const py = try std.fmt.parseInt(i64, line[py_s..py_e], 10);
const vx = try std.fmt.parseInt(i64, line[vx_s..vx_e], 10);
const vy = try std.fmt.parseInt(i64, line[vy_s..vy_e], 10);
const fx: i64 = @mod((px + vx * 100), sx);
const fy: i64 = @mod((py + vy * 100), sy);
if (fx == sx>>1 or fy == sy>>1) continue;
const qx: u2 = @intCast(@as(u1,@bitCast(fx > sx >> 1)));
const qy: u2 = @intCast(@as(u1,@bitCast(fy > sy >> 1)));
quads[(qy<<1)+qx] += 1;
}
total = quads[0] * quads[1] * quads[2] * quads[3];
return total;
}

67
15/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "15",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
15/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "15",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

249
15/src/main.zig Normal file
View File

@@ -0,0 +1,249 @@
// i made part 2 harder than it had to be
// zig's nice though ig
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(10092, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(9021, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
fn r2canmove(y:usize,x:usize,dy:isize,dx:isize,a:bool) bool {
if (map[y][x] == '#') return false;
if (map[y][x] == '.') return true;
const ny: usize = @intCast(@as(isize,@intCast(y)) + dy);
const nx: usize = @intCast(@as(isize,@intCast(x)) + dx);
if (!a and map[y][x] == '[') {
if (!r2canmove(y, x+1, dy, dx, true)) return false;
if (ny == y and nx == x+1) return true;
} else if (!a and map[y][x] == ']') {
if (!r2canmove(y, x-1, dy, dx, true)) return false;
if (ny == y and nx == x-1) return true;
}
if (!r2canmove(ny, nx, dy, dx, false)) return false;
return true;
}
fn r2domove(y:usize,x:usize,dy:isize,dx:isize) void {
if (map[y][x] == '#') return;
if (map[y][x] == '.') return;
const ny: usize = @intCast(@as(isize,@intCast(y)) + dy);
const nx: usize = @intCast(@as(isize,@intCast(x)) + dx);
r2domove(ny, nx, dy, dx);
map[ny][nx] = map[y][x];
map[y][x] = '.';
if (map[ny][nx] == '[') {
if (map[y][x+1] == ']' and dx != -1) r2domove(y, x+1, dy, dx);
} else if (map[ny][nx] == ']') {
if (map[y][x-1] == '[' and dx != 1) r2domove(y, x-1, dy, dx);
}
}
fn r2trymove(y:usize,x:usize,dy:isize,dx:isize) bool {
if (map[y][x] == '#') return false;
if (map[y][x] == '.') return true;
if (r2canmove(y, x, dy, dx, false)) {
r2domove(y, x, dy, dx);
return true;
}
return false;
}
fn run2(input: []const u8) !u64 {
var lines = std.mem.splitScalar(u8, input, '\n');
{
var y: usize = 0;
while (lines.next()) |line| {
if (line.len == 0) break;
//std.mem.copyForwards(u8, &map[y], line);
var x: usize = 0;
for (line) |c| {
switch (c) {
'#' => { map[y][x] = '#'; map[y][x+1] = '#'; },
'O' => { map[y][x] = '['; map[y][x+1] = ']'; },
'.' => { map[y][x] = '.'; map[y][x+1] = '.'; },
'@' => { map[y][x] = '@'; map[y][x+1] = '.'; },
else => { std.debug.print("what the fuck\n",.{}); }
}
x += 2;
}
std.debug.print("{s}\n",.{map[y][0..x]});
msize = line.len;
y += 1;
}
}
std.debug.print("map max {}\n", .{msize});
var ry: usize = undefined;
var rx: usize = undefined;
findr: for (0..msize) |y| { for (0..msize*2) |x| {
if (map[y][x] == '@') {
ry = y;
rx = x;
break :findr;
}
} }
while (lines.next()) |line| {
for (line) |c| {
switch (c) {
'<' => {
const b = r2trymove(ry, rx, 0, -1);
if (b) rx -= 1;
},
'>' => {
const b = r2trymove(ry, rx, 0, 1);
if (b) rx += 1;
},
'^' => {
const b = r2trymove(ry, rx, -1, 0);
if (b) ry -= 1;
},
'v' => {
const b = r2trymove(ry, rx, 1, 0);
if (b) ry += 1;
},
else => {
std.debug.print("what the fuck\n",.{});
}
}
}
}
var total: u64 = 0;
for (0..msize) |y| {
for (0..msize*2) |x| {
if (map[y][x] == '[') total += 100 * y + x;
}
std.debug.print("{s}\n",.{map[y][0..msize*2]});
}
return total;
}
var msize: usize = undefined;
var map: [256][256]u8 = [_][256]u8{[_]u8{0}**256}**256;
fn r1trymove(y:usize,x:usize,dy:isize,dx:isize) bool {
if (map[y][x] == '#') return false;
if (map[y][x] == '.') return true;
const ny: usize = @intCast(@as(isize,@intCast(y)) + dy);
const nx: usize = @intCast(@as(isize,@intCast(x)) + dx);
if (r1trymove(ny, nx, dy, dx)) {
map[ny][nx] = map[y][x];
map[y][x] = '.';
return true;
}
return false;
}
fn run1(input: []const u8) !u64 {
var lines = std.mem.splitScalar(u8, input, '\n');
{
var y: usize = 0;
while (lines.next()) |line| {
if (line.len == 0) break;
std.mem.copyForwards(u8, &map[y], line);
std.debug.print("{s}\n",.{line});
msize = line.len;
y += 1;
}
}
std.debug.print("map max {}\n", .{msize});
var ry: usize = undefined;
var rx: usize = undefined;
findr: for (0..msize) |y| { for (0..msize) |x| {
if (map[y][x] == '@') {
ry = y;
rx = x;
break :findr;
}
} }
while (lines.next()) |line| {
for (line) |c| {
switch (c) {
'<' => {
const b = r1trymove(ry, rx, 0, -1);
if (b) rx -= 1;
},
'>' => {
const b = r1trymove(ry, rx, 0, 1);
if (b) rx += 1;
},
'^' => {
const b = r1trymove(ry, rx, -1, 0);
if (b) ry -= 1;
},
'v' => {
const b = r1trymove(ry, rx, 1, 0);
if (b) ry += 1;
},
else => {
std.debug.print("what the fuck\n",.{});
}
}
}
}
var total: u64 = 0;
for (0..msize) |y| {
for (0..msize) |x| {
if (map[y][x] == 'O') total += 100 * y + x;
}
std.debug.print("{s}\n",.{map[y][0..msize]});
}
return total;
}