-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay13.cs
215 lines (180 loc) · 5.73 KB
/
Day13.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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Drawing;
using System.Text.RegularExpressions;
using System.Diagnostics;
namespace AdventOfCode2018
{
class Day13 : Day
{
public override bool Test()
{
return Utils.Test(Part1, testInput, "7,3") &&
Utils.Test(Part2, testInput2, "6,4");
}
public override string Part1(string input, dynamic options)
{
var track = Utils.splitLinesWithoutTrim(input).ToArray();
var cars = initCars(track);
try
{
while (true)
{
var ordered = cars.OrderBy(c => c.SortOrder).ToList();
foreach (var car in ordered)
{
car.Move(ordered);
}
}
}
catch (Crash c)
{
return c.X + "," + c.Y;
}
}
private List<Car> initCars(string[] track)
{
var cars = new List<Car>();
for (int x = 0; x < track[0].Length; x++)
{
for (int y = 0; y < track.Length; y++)
{
int dx = 0, dy = 0;
switch (track[y][x])
{
case '>':
dx = 1;
break;
case '<':
dx = -1;
break;
case '^':
dy = -1;
break;
case 'v':
dy = 1;
break;
}
if (dx != 0 || dy != 0)
{
cars.Add(new Car { X = x, Y = y, dX = dx, dY = dy, track = track });
}
}
}
return cars;
}
public override string Part2(string input, dynamic options)
{
var track = Utils.splitLinesWithoutTrim(input).ToArray();
var cars = initCars(track);
while (true)
{
var ordered = cars.OrderBy(c => c.SortOrder).ToList();
foreach (var car in ordered)
{
try
{
car.Move(ordered);
}
catch (Crash c) { }
}
var alive = cars.Where(c => c.alive);
if (alive.Count() == 1)
{
return alive.First().X + "," + alive.First().Y;
}
}
}
private string testInput =>
@"/->-\
| | /----\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
\------/ ";
private string testInput2 =>
@"/>-<\
| |
| /<+-\
| | | v
\>+</ |
| ^
\<->/";
private class Car
{
public string[] track;
public int X;
public int Y;
public int dX;
public int dY;
int turnCount = 0;
public bool alive = true;
public int SortOrder => Y * 1000 + X;
public void Move(List<Car> otherCars)
{
if (!alive) return;
X += dX;
Y += dY;
/*if (otherCars.First() == this)
{
Console.WriteLine();
}
Console.Write(X.ToString("00") + "," + Y.ToString("00") + " ");*/
var collision = otherCars.FirstOrDefault(c => c.X == X && c.Y == Y && c != this && c.alive);
if (collision != null)
{
this.alive = false;
collision.alive = false;
Console.WriteLine("crash " + X + "," + Y);
throw new Crash() { X = X, Y = Y };
}
var dX2 = dX;
var dY2 = dY;
switch (track[Y][X])
{
case '-':
case '|':
case '<':
case '>':
case '^':
case 'v':
break;
case '/':
dX = -dY2;
dY = -dX2;
break;
case '\\':
dX = dY2;
dY = dX2;
break;
case '+':
switch (turnCount % 3)
{
case 0:
dX = dY2;
dY = -dX2;
break;
case 1:
break;
case 2:
dX = -dY2;
dY = dX2;
break;
}
turnCount++;
break;
default:
throw new Exception();
}
}
}
private class Crash : Exception
{
public int X;
public int Y;
}
}
}