|
| 1 | +const std = @import("std"); |
| 2 | +const Allocator = std.mem.Allocator; |
| 3 | +const ArrayList = std.ArrayList; |
| 4 | +const string = []const u8; |
| 5 | + |
| 6 | +/// Task 1 - Compress the files on the disk while actively fragmenting the |
| 7 | +/// files. Return the checksum of the compressed disk. |
| 8 | +/// |
| 9 | +/// Arguments: |
| 10 | +/// - `contents`: Input file contents. |
| 11 | +/// |
| 12 | +/// Returns: |
| 13 | +/// - Checksum of the compressed (fragmented) disk. |
| 14 | +pub fn checksum_of_fragmented_disk(contents: string) !usize { |
| 15 | + var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); |
| 16 | + defer arena.deinit(); |
| 17 | + |
| 18 | + const allocator = arena.allocator(); |
| 19 | + var files, var gaps = try parse_initial_disk(contents, allocator); |
| 20 | + |
| 21 | + var checksum: usize = 0; |
| 22 | + |
| 23 | + var files_front_idx: usize = 0; |
| 24 | + var files_back_idx: usize = files.items.len - 1; |
| 25 | + var disk_idx: usize = 0; |
| 26 | + var eof_idx: usize = 0; |
| 27 | + while (files_front_idx <= files_back_idx) { |
| 28 | + // Insert file |
| 29 | + eof_idx = disk_idx + files.items[files_front_idx] - 1; |
| 30 | + checksum += files_front_idx * partial_gauss_sum(disk_idx, eof_idx); |
| 31 | + disk_idx = eof_idx + 1; |
| 32 | + |
| 33 | + // Fill gap |
| 34 | + while (gaps.items[files_front_idx] > 0 and files_front_idx < files_back_idx) { |
| 35 | + if (files.items[files_back_idx] <= gaps.items[files_front_idx]) { |
| 36 | + eof_idx = disk_idx + files.items[files_back_idx] - 1; |
| 37 | + checksum += files_back_idx * partial_gauss_sum(disk_idx, eof_idx); |
| 38 | + disk_idx = eof_idx + 1; |
| 39 | + |
| 40 | + gaps.items[files_front_idx] -= files.items[files_back_idx]; |
| 41 | + files_back_idx -= 1; |
| 42 | + } else { |
| 43 | + eof_idx = disk_idx + gaps.items[files_front_idx] - 1; |
| 44 | + checksum += files_back_idx * partial_gauss_sum(disk_idx, eof_idx); |
| 45 | + disk_idx = eof_idx + 1; |
| 46 | + |
| 47 | + files.items[files_back_idx] -= gaps.items[files_front_idx]; |
| 48 | + gaps.items[files_front_idx] = 0; |
| 49 | + } |
| 50 | + } |
| 51 | + |
| 52 | + files_front_idx += 1; |
| 53 | + } |
| 54 | + |
| 55 | + return checksum; |
| 56 | +} |
| 57 | + |
| 58 | +/// Task 2 - Compress the files on the disk while preventing fragmentation of |
| 59 | +/// the files. Return the checksum of the compressed disk. |
| 60 | +/// |
| 61 | +/// Arguments: |
| 62 | +/// - `contents`: Input file contents. |
| 63 | +/// |
| 64 | +/// Returns: |
| 65 | +/// - Checksum of the compressed (defragmented) disk. |
| 66 | +pub fn checksum_of_defragmented_disk(contents: string) !usize { |
| 67 | + var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); |
| 68 | + defer arena.deinit(); |
| 69 | + |
| 70 | + const allocator = arena.allocator(); |
| 71 | + const files, const gaps = try parse_initial_disk(contents, allocator); |
| 72 | + |
| 73 | + // Calculate initial disk locations |
| 74 | + var file_disk_locations = ArrayList(usize).init(allocator); |
| 75 | + var gap_disk_locations = ArrayList(usize).init(allocator); |
| 76 | + var disk_idx: usize = 0; |
| 77 | + for (0..files.items.len) |i| { |
| 78 | + try file_disk_locations.append(disk_idx); |
| 79 | + disk_idx += files.items[i]; |
| 80 | + if (i < gaps.items.len) { |
| 81 | + try gap_disk_locations.append(disk_idx); |
| 82 | + disk_idx += gaps.items[i]; |
| 83 | + } |
| 84 | + } |
| 85 | + |
| 86 | + // Move files where possible |
| 87 | + var file_idx = files.items.len; |
| 88 | + while (file_idx > 0) { |
| 89 | + file_idx -= 1; |
| 90 | + for (0..gaps.items.len) |gap_idx| { |
| 91 | + if (gap_disk_locations.items[gap_idx] > file_disk_locations.items[file_idx]) { |
| 92 | + break; |
| 93 | + } |
| 94 | + if (files.items[file_idx] <= gaps.items[gap_idx]) { |
| 95 | + file_disk_locations.items[file_idx] = gap_disk_locations.items[gap_idx]; |
| 96 | + gap_disk_locations.items[gap_idx] += files.items[file_idx]; |
| 97 | + gaps.items[gap_idx] -= files.items[file_idx]; |
| 98 | + break; |
| 99 | + } |
| 100 | + } |
| 101 | + } |
| 102 | + |
| 103 | + // Calculate checksum |
| 104 | + var checksum: usize = 0; |
| 105 | + for (0..files.items.len) |i| { |
| 106 | + checksum += i * partial_gauss_sum( |
| 107 | + file_disk_locations.items[i], |
| 108 | + file_disk_locations.items[i] + files.items[i] - 1, |
| 109 | + ); |
| 110 | + } |
| 111 | + |
| 112 | + return checksum; |
| 113 | +} |
| 114 | + |
| 115 | +// -------------------------------------------------------------------------- \\ |
| 116 | + |
| 117 | +/// Sum all natural numbers between two given numbers. |
| 118 | +/// |
| 119 | +/// Arguments: |
| 120 | +/// - `first`: The first number (lower bound). |
| 121 | +/// - `last`: The last number (upper bound). |
| 122 | +/// |
| 123 | +/// Returns: |
| 124 | +/// - The sum of all natural numbers within the bounds. |
| 125 | +fn partial_gauss_sum(first: usize, last: usize) usize { |
| 126 | + return gauss_sum(last) - gauss_sum(first) + first; |
| 127 | +} |
| 128 | + |
| 129 | +/// Sum all natural numbers up to the given number. |
| 130 | +/// |
| 131 | +/// Arguments: |
| 132 | +/// - `num`: The give number. |
| 133 | +/// |
| 134 | +/// Returns: |
| 135 | +/// - The Gauss sum of the given number. |
| 136 | +fn gauss_sum(num: usize) usize { |
| 137 | + return num * (num + 1) / 2; |
| 138 | +} |
| 139 | + |
| 140 | +/// Parse the file contents into a list of file sizes and a list of gap sizes. |
| 141 | +/// |
| 142 | +/// Arguments: |
| 143 | +/// - `contents`: Input file contents. |
| 144 | +/// - `allocator`: Allocator for the containers. |
| 145 | +/// |
| 146 | +/// Returns: |
| 147 | +/// - Two lists with files sizes and gap sizes. |
| 148 | +fn parse_initial_disk(contents: string, allocator: Allocator) !struct { ArrayList(u32), ArrayList(u32) } { |
| 149 | + var files = ArrayList(u32).init(allocator); |
| 150 | + var gaps = ArrayList(u32).init(allocator); |
| 151 | + |
| 152 | + for (0..contents.len) |i| { |
| 153 | + if (i % 2 == 0) { |
| 154 | + try files.append(try std.fmt.parseInt(u32, contents[i..(i + 1)], 10)); |
| 155 | + } else { |
| 156 | + try gaps.append(try std.fmt.parseInt(u32, contents[i..(i + 1)], 10)); |
| 157 | + } |
| 158 | + } |
| 159 | + |
| 160 | + return .{ files, gaps }; |
| 161 | +} |
0 commit comments