-
Notifications
You must be signed in to change notification settings - Fork 0
/
AoC2022_07.java
112 lines (99 loc) Β· 3.42 KB
/
AoC2022_07.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.summingInt;
import static java.util.stream.Collectors.toList;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.stream.IntStream;
import com.github.pareronia.aocd.Aocd;
import com.github.pareronia.aocd.Puzzle;
public class AoC2022_07 extends AoCBase {
private static final String ROOT = "/";
private final Map<String, Integer> sizes;
private AoC2022_07(final List<String> input, final boolean debug) {
super(debug);
final Deque<String> path = new ArrayDeque<>();
this.sizes = new HashMap<>();
for (final String line : input.subList(1, input.size())) {
if (line.startsWith("$ cd ")) {
final String name = line.substring("$ cd ".length());
if (name.equals("..")) {
path.removeLast();
} else {
path.addLast(name);
}
} else if (!line.startsWith("$")) {
final var splits = line.split(" ");
final int size;
if (!splits[0].equals("dir")) {
size = Integer.parseInt(splits[0]);
final var list = path.stream().collect(toList());
IntStream.rangeClosed(0, list.size()).forEach(i -> {
final String pp = IntStream.range(0, i)
.mapToObj(list::get)
.collect(joining("/"));
sizes.merge(ROOT + pp, size, Integer::sum);
});
}
}
}
}
public static final AoC2022_07 create(final List<String> input) {
return new AoC2022_07(input, false);
}
public static final AoC2022_07 createDebug(final List<String> input) {
return new AoC2022_07(input, true);
}
@Override
public Integer solvePart1() {
return this.sizes.values().stream()
.filter(s -> s <= 100_000)
.collect(summingInt(Integer::valueOf));
}
@Override
public Integer solvePart2() {
final int total = this.sizes.get(ROOT);
final int wanted = 30_000_000 - (70_000_000 - total);
return this.sizes.values().stream()
.filter(v -> v >= wanted)
.sorted()
.findFirst().orElseThrow();
}
public static void main(final String[] args) throws Exception {
assert AoC2022_07.createDebug(TEST).solvePart1() == 95_437;
assert AoC2022_07.createDebug(TEST).solvePart2() == 24_933_642;
final Puzzle puzzle = Aocd.puzzle(2022, 7);
final List<String> inputData = puzzle.getInputData();
puzzle.check(
() -> lap("Part 1", AoC2022_07.create(inputData)::solvePart1),
() -> lap("Part 2", AoC2022_07.create(inputData)::solvePart2)
);
}
private static final List<String> TEST = splitLines("""
$ 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
""");
}