mirror of
https://github.com/Crocmagnon/advent-of-code.git
synced 2024-11-21 14:08:11 +01:00
Solve day7 part 1
This commit is contained in:
parent
2e9b092baa
commit
fa98575ee9
3 changed files with 1143 additions and 0 deletions
110
2022/day07_space.py
Normal file
110
2022/day07_space.py
Normal file
|
@ -0,0 +1,110 @@
|
|||
from __future__ import annotations
|
||||
|
||||
import dataclasses
|
||||
|
||||
|
||||
def main(filename: str, expected_part_1: int = None, expected_part_2: int = None):
|
||||
print(f"\n+ Running on {filename}")
|
||||
with open(filename) as f:
|
||||
data = f.read().strip().split("$ ")
|
||||
|
||||
data = parse_data(data)
|
||||
solution_part_1 = solve_part_1(data)
|
||||
|
||||
print(f"1. Found {solution_part_1}")
|
||||
if expected_part_1:
|
||||
assert expected_part_1 == solution_part_1
|
||||
|
||||
solution_part_2 = solve_part_2(data)
|
||||
print(f"2. Found {solution_part_2}")
|
||||
if expected_part_2:
|
||||
assert expected_part_2 == solution_part_2
|
||||
|
||||
|
||||
@dataclasses.dataclass
|
||||
class File:
|
||||
name: str
|
||||
size: int
|
||||
|
||||
def __str__(self):
|
||||
return f"- {self.name} (file, size={self.size})"
|
||||
|
||||
def print(self, level: int = 0):
|
||||
print(" " * level * 2 + str(self))
|
||||
|
||||
@property
|
||||
def is_directory(self) -> bool:
|
||||
return False
|
||||
|
||||
|
||||
@dataclasses.dataclass
|
||||
class Directory:
|
||||
name: str
|
||||
parent: Directory = None
|
||||
children: list[File | Directory] = dataclasses.field(default_factory=list)
|
||||
|
||||
def __str__(self):
|
||||
return f"- {self.name} (dir, size={self.size})"
|
||||
|
||||
def print(self, level: int = 0):
|
||||
print(" " * level * 2 + str(self))
|
||||
for child in self.children:
|
||||
child.print(level + 1)
|
||||
|
||||
def root(self):
|
||||
if self.parent:
|
||||
return self.parent.root()
|
||||
else:
|
||||
return self
|
||||
|
||||
@property
|
||||
def size(self) -> int:
|
||||
return sum(child.size for child in self.children)
|
||||
|
||||
@property
|
||||
def is_directory(self) -> bool:
|
||||
return True
|
||||
|
||||
|
||||
def parse_data(commands: list[str]) -> Directory:
|
||||
current_directory = None
|
||||
for command in commands:
|
||||
command, *result = command.strip().split("\n")
|
||||
match command.split():
|
||||
case ["cd", ".."]:
|
||||
current_directory = current_directory.parent
|
||||
case ["cd", dir_name]:
|
||||
new_dir = Directory(dir_name, parent=current_directory)
|
||||
if current_directory:
|
||||
current_directory.children.append(new_dir)
|
||||
current_directory = new_dir
|
||||
case ["ls"]:
|
||||
for line in result:
|
||||
match line.split():
|
||||
case ["dir", _]:
|
||||
pass
|
||||
case [size, name]:
|
||||
current_directory.children.append(File(name, int(size)))
|
||||
|
||||
return current_directory.root()
|
||||
|
||||
|
||||
def solve_part_1(root: Directory) -> int:
|
||||
total = 0
|
||||
to_visit = [root]
|
||||
while to_visit:
|
||||
visited = to_visit.pop()
|
||||
to_visit.extend([child for child in visited.children if child.is_directory])
|
||||
size = visited.size
|
||||
if size <= 100000:
|
||||
total += size
|
||||
return total
|
||||
|
||||
|
||||
def solve_part_2(root: Directory) -> int:
|
||||
return 0
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
main("inputs/day07-test1", expected_part_1=95437)
|
||||
main("inputs/day07", expected_part_1=1517599)
|
1010
2022/inputs/day07
Normal file
1010
2022/inputs/day07
Normal file
File diff suppressed because it is too large
Load diff
23
2022/inputs/day07-test1
Normal file
23
2022/inputs/day07-test1
Normal file
|
@ -0,0 +1,23 @@
|
|||
$ cd /
|
||||
$ ls
|
||||
dir a
|
||||
14848514 b.txt
|
||||
8504156 c.dat
|
||||
dir d
|
||||
$ cd a
|
||||
$ ls
|
||||
dir e
|
||||
29116 f
|
||||
2557 g
|
||||
62596 h.lst
|
||||
$ cd e
|
||||
$ ls
|
||||
584 i
|
||||
$ cd ..
|
||||
$ cd ..
|
||||
$ cd d
|
||||
$ ls
|
||||
4060174 j
|
||||
8033020 d.log
|
||||
5626152 d.ext
|
||||
7214296 k
|
Loading…
Reference in a new issue