mg/aoc-2024
1
0
Fork 0
mirror of https://github.com/MorizzG/aoc-2024.git synced 2025-12-06 04:22:43 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

day 1 done

Browse source
This commit is contained in:
Moritz Gmeiner 2024-12-01 18:12:35 +01:00
commit 61d7d0f486
5 changed files with 1330 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

91
Day01/build.zig Normal file
View file

@ -0,0 +1,91 @@
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 lib = b.addStaticLibrary(.{
.name = "Day01",
// In this case the main source file is merely a path, however, in more
// complicated build scripts, this could be a generated file.
.root_source_file = b.path("src/root.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the library to be installed into the standard
// location when the user invokes the "install" step (the default step when
// running `zig build`).
b.installArtifact(lib);
const exe = b.addExecutable(.{
.name = "Day01",
.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);
// Creates a step for unit testing. This only builds the test executable
// but does not run it.
const lib_unit_tests = b.addTest(.{
.root_source_file = b.path("src/root.zig"),
.target = target,
.optimize = optimize,
});
const run_lib_unit_tests = b.addRunArtifact(lib_unit_tests);
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);
// 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_lib_unit_tests.step);
test_step.dependOn(&run_exe_unit_tests.step);
}

72
Day01/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 = "Day01",
// 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",
},
}

1000
Day01/input1.txt Normal file
View file

File diff suppressed because it is too large Load diff

157
Day01/src/main.zig Normal file
View file

@ -0,0 +1,157 @@
const std = @import("std");
pub fn main() !void {
// // Prints to stderr (it's a shortcut based on `std.io.getStdErr()`)
// std.debug.print("All your {s} are belong to us.\n", .{"codebase"});
// // stdout is for the actual output of your application, for example if you
// // are implementing gzip, then only the compressed bytes should be sent to
// // stdout, not any debugging messages.
// const stdout_file = std.io.getStdOut().writer();
// var bw = std.io.bufferedWriter(stdout_file);
// const stdout = bw.writer();
// try stdout.print("Run `zig build test` to run the tests.\n", .{});
// try bw.flush(); // don't forget to flush!
var gpa = std.heap.GeneralPurposeAllocator(.{}){};
const alloc = gpa.allocator();
try part1(alloc);
try part2(alloc);
}
fn range(comptime n: u32) [n]usize {
var array: [n]usize = undefined;
for (0.., &array) |i, *elem| {
elem.* = i;
}
return array;
}
fn argsort_cmp(comptime T: type, comptime lessThanFn: fn (ctx: void, lhs: T, rhs: T) bool) (fn ([]T, usize, usize) bool) {
return struct {
fn cmp(array: []T, left_idx: usize, right_idx: usize) bool {
return lessThanFn({}, array[left_idx], array[right_idx]);
}
}.cmp;
}
fn part1(alloc: std.mem.Allocator) !void {
const filename = "input1.txt";
const num_lines = 1_000;
const file = try std.fs.cwd().openFile(filename, .{});
defer file.close();
var left_list: [num_lines]u32 = undefined;
var right_list: [num_lines]u32 = undefined;
const file_reader = file.reader();
var buf_reader = std.io.BufferedReader(4096, @TypeOf(file_reader)){ .unbuffered_reader = file_reader };
const reader = std.io.Reader(@TypeOf(&buf_reader), std.fs.File.Reader.Error, @TypeOf(buf_reader).read){ .context = &buf_reader };
var line_buf = std.ArrayList(u8).init(alloc);
defer line_buf.deinit();
for (0..(num_lines + 1)) |i| {
reader.streamUntilDelimiter(line_buf.writer(), '\n', 4096) catch |err| switch (err) {
error.EndOfStream => break,
else => return err,
};
const left = try std.fmt.parseUnsigned(u32, line_buf.items[0..5], 10);
const right = try std.fmt.parseUnsigned(u32, line_buf.items[8..13], 10);
left_list[i] = left;
right_list[i] = right;
try line_buf.resize(0);
}
var left_idxs = range(num_lines);
var right_idxs = range(num_lines);
std.debug.assert(left_list.len == left_idxs.len);
std.debug.assert(right_list.len == right_idxs.len);
for (0..1000) |i| {
std.debug.assert(left_idxs[i] == i);
std.debug.assert(right_idxs[i] == i);
}
const cmp = argsort_cmp(u32, std.sort.asc(u32));
std.mem.sort(usize, &left_idxs, @as([]u32, &left_list), cmp);
std.mem.sort(usize, &right_idxs, @as([]u32, &right_list), cmp);
for (0..(num_lines - 1)) |i| {
std.debug.assert(left_list[left_idxs[i]] <= left_list[left_idxs[i + 1]]);
std.debug.assert(right_list[right_idxs[i]] <= right_list[right_idxs[i + 1]]);
}
var sum: u64 = 0;
for (left_idxs, right_idxs) |left_idx, right_idx| {
sum += @abs(@as(i64, left_list[left_idx]) - @as(i64, right_list[right_idx]));
}
std.debug.print("Day 1, part 1: {}\n", .{sum});
}
fn part2(alloc: std.mem.Allocator) !void {
const filename = "input1.txt";
const num_lines = 1_000;
const file = try std.fs.cwd().openFile(filename, .{});
defer file.close();
var left_list: [num_lines]u32 = undefined;
var right_map = std.AutoHashMap(u32, u32).init(alloc);
defer right_map.deinit();
const file_reader = file.reader();
var buf_reader = std.io.BufferedReader(4096, @TypeOf(file_reader)){ .unbuffered_reader = file_reader };
const reader = std.io.Reader(@TypeOf(&buf_reader), std.fs.File.Reader.Error, @TypeOf(buf_reader).read){ .context = &buf_reader };
var line_buf = std.ArrayList(u8).init(alloc);
defer line_buf.deinit();
for (0..(num_lines + 1)) |i| {
reader.streamUntilDelimiter(line_buf.writer(), '\n', 4096) catch |err| switch (err) {
error.EndOfStream => break,
else => return err,
};
const left = try std.fmt.parseUnsigned(u32, line_buf.items[0..5], 10);
const right = try std.fmt.parseUnsigned(u32, line_buf.items[8..13], 10);
left_list[i] = left;
if (right_map.get(right)) |count| {
try right_map.put(right, count + 1);
} else {
try right_map.put(right, 1);
}
try line_buf.resize(0);
}
var sum: u64 = 0;
for (left_list) |x| {
if (right_map.get(x)) |count| {
sum += count * x;
}
}
std.debug.print("Day 1, part 2: {}\n", .{sum});
}

10
Day01/src/root.zig Normal file
View file

@ -0,0 +1,10 @@
const std = @import("std");
const testing = std.testing;
export fn add(a: i32, b: i32) i32 {
return a + b;
}
test "basic add functionality" {
try testing.expect(add(3, 7) == 10);
}