mirror of
https://github.com/parnic/advent-of-code-2022.git
synced 2025-06-16 21:41:53 -05:00
117 lines
3.5 KiB
C#
117 lines
3.5 KiB
C#
namespace aoc2022;
|
|
|
|
internal class Day07 : Day
|
|
{
|
|
private class fileInfo
|
|
{
|
|
public long size;
|
|
// ReSharper disable once NotAccessedField.Local
|
|
public string name = string.Empty;
|
|
|
|
public override string ToString() => $"{name}, {size:N0}b";
|
|
}
|
|
|
|
private class dirInfo
|
|
{
|
|
public dirInfo? outer;
|
|
public readonly List<dirInfo> dirs = new();
|
|
public readonly List<fileInfo> files = new();
|
|
public string name = string.Empty;
|
|
|
|
public long size => files.Sum(x => x.size) + dirs.Sum(x => x.size);
|
|
|
|
public override string ToString() => $"{name}, {size:N0}b, {dirs.Count} dir{(dirs.Count == 1 ? "" : "s")}, {files.Count} file{(files.Count == 1 ? "" : "s")}{(outer != null ? $", parent '{outer.name}'" : "")}";
|
|
}
|
|
|
|
private readonly dirInfo rootDirInfo = new() {name = "/"};
|
|
|
|
internal override void Parse()
|
|
{
|
|
dirInfo? curr = null;
|
|
|
|
foreach (var line in Util.Parsing.ReadAllLines("07"))
|
|
{
|
|
if (line.StartsWith("$"))
|
|
{
|
|
var cmd = line[2..];
|
|
string? arg = null;
|
|
if (cmd.Contains(' '))
|
|
{
|
|
arg = cmd[(cmd.IndexOf(' ') + 1)..];
|
|
cmd = cmd[..cmd.IndexOf(' ')];
|
|
}
|
|
|
|
if (cmd == "cd")
|
|
{
|
|
if (arg == "/")
|
|
{
|
|
curr = rootDirInfo;
|
|
}
|
|
else if (arg == "..")
|
|
{
|
|
curr = curr!.outer;
|
|
}
|
|
else
|
|
{
|
|
curr = curr!.dirs.First(x => x.name == arg);
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
var parts = line.Split(' ');
|
|
if (parts[0] == "dir")
|
|
{
|
|
curr!.dirs.Add(new dirInfo() { name = parts[1], outer = curr });
|
|
}
|
|
else
|
|
{
|
|
curr!.files.Add(new fileInfo { size = long.Parse(parts[0]), name = parts[1] });
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
private static IEnumerable<dirInfo> GetCandidates(dirInfo root, long? threshold = null)
|
|
{
|
|
if (threshold == null || root.size <= threshold)
|
|
{
|
|
yield return root;
|
|
}
|
|
|
|
foreach (var dir in root.dirs)
|
|
{
|
|
if (threshold == null || dir.size <= threshold)
|
|
{
|
|
yield return dir;
|
|
}
|
|
|
|
foreach (var d in dir.dirs.SelectMany(d2 => GetCandidates(d2, threshold)))
|
|
{
|
|
yield return d;
|
|
}
|
|
}
|
|
}
|
|
|
|
internal override string Part1()
|
|
{
|
|
List<dirInfo> candidates = new(GetCandidates(rootDirInfo, 100000));
|
|
|
|
return $"Sum of directories below 100,000 bytes: <+white>{candidates.Sum(x => x.size)}";
|
|
}
|
|
|
|
internal override string Part2()
|
|
{
|
|
List<dirInfo> flatDirList = new(GetCandidates(rootDirInfo));
|
|
var rootSize = rootDirInfo.size;
|
|
const int totalSize = 70000000;
|
|
var currentFreeSpace = totalSize - rootSize;
|
|
const int totalNeededFreeSpace = 30000000;
|
|
var neededFreeSpace = totalNeededFreeSpace - currentFreeSpace;
|
|
|
|
var smallestCandidate = flatDirList.Where(x => x.size >= neededFreeSpace).MinBy(x => x.size);
|
|
|
|
return $"Smallest directory that can free the required {neededFreeSpace:N0} bytes: <+white>{smallestCandidate!.size}";
|
|
}
|
|
}
|