-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay17.cs
136 lines (115 loc) · 3.93 KB
/
Day17.cs
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
namespace AoC2023;
public class Day17 : IDay<IEnumerable<string>, long>
{
public static long SolvePart1(IEnumerable<string> input)
{
string[] grid = input.ToArray();
var startingPoint = new Position(0, 0);
var startingDir = new Direction(0, 0);
var destination = new Position(grid.Length - 1, grid[0].Length - 1);
const int maxConsecutiveStepsSameDirection = 3;
return MinEnergyDijkstra(
grid,
startingPoint,
destination,
maxConsecutiveStepsSameDirection
);
}
public static long SolvePart2(IEnumerable<string> input)
{
string[] grid = input.ToArray();
var startingPoint = new Position(0, 0);
var startingDir = new Direction(0, 0);
var destination = new Position(grid.Length - 1, grid[0].Length - 1);
const int maxConsecutiveStepsSameDirection = 10;
const int minConsecutiveStepsSameDirection = 4;
return MinEnergyDijkstra(
grid,
startingPoint,
destination,
maxConsecutiveStepsSameDirection,
minConsecutiveStepsSameDirection
);
}
public static int MinEnergyDijkstra(
string[] grid,
Position start,
Position dest,
int maxConsecutiveStepsSameDirection,
int minConsecutiveStepsSameDirection = -1
)
{
Direction[] directions =
[
new Direction(1, 0),
new Direction(-1, 0),
new Direction(0, 1),
new Direction(0, -1)
];
// (Position, Direction, DirectionCount, Heat) -> Heat
var pq = new PriorityQueue<State, int>();
var startDir = new Direction(0, 0);
var visitedStates = new HashSet<(Position, Direction, int)>();
pq.Enqueue(new State(start, startDir, 0, 0), 0);
while (pq.Count > 0)
{
var state = pq.Dequeue();
var (pos, dir, dirCount, heat) = state;
// Console.WriteLine(state);
if (pos == dest && dirCount >= minConsecutiveStepsSameDirection)
{
return heat;
}
if (visitedStates.Contains((pos, dir, dirCount)))
{
continue;
}
visitedStates.Add((pos, dir, dirCount));
if (dirCount < maxConsecutiveStepsSameDirection && dir != startDir)
{
var newPos = pos.Move(dir);
if (!IsOutsideGrid(newPos, grid))
{
var newHeat = heat + (int.Parse(grid[newPos.R][newPos.C].ToString()));
pq.Enqueue(new State(newPos, dir, dirCount + 1, newHeat), newHeat);
}
}
if (dirCount < minConsecutiveStepsSameDirection && dir != startDir)
{
continue;
}
foreach (
var d in directions.Where(
d => d != dir && (d.DirR, d.DirC) != (-1 * dir.DirR, -1 * dir.DirC)
)
)
{
var newPos = pos.Move(d);
if (!IsOutsideGrid(newPos, grid))
{
var newHeat = heat + (int.Parse(grid[newPos.R][newPos.C].ToString()));
pq.Enqueue(new State(newPos, d, 1, newHeat), newHeat);
}
}
}
return 0;
}
public static bool IsOutsideGrid(Position pos, string[] grid)
{
return pos.R < 0 || pos.R >= grid.Length || pos.C < 0 || pos.C >= grid[0].Length;
}
public readonly record struct State(
Position Position,
Direction Direction,
int DirectionCount,
int Heat
);
public readonly record struct Direction(int DirR, int DirC);
public record struct Position(int R, int C)
{
public Position Move(Direction dir)
{
return new Position(R + dir.DirR, C + dir.DirC);
}
};
}