-
Notifications
You must be signed in to change notification settings - Fork 0
/
AoC20.cpp
233 lines (197 loc) · 3 KB
/
AoC20.cpp
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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
#include "Lib.h"
#include <iostream>
using std::cerr;
using std::cout;
#include <algorithm>
using std::sort;
using std::unique;
#include <map>
using std::map;
class FormatException{};
struct coord
{
void op()
{
cout << "x: " << x << " y: " << y << " z: " << z;
}
int x;
int y;
int z;
};
struct particle
{
void op()
{
p.op();
cout << "\t";
v.op();
cout << "\t";
a.op();
cout << "\n";
}
void simulate()
{
v.x += a.x;
v.y += a.y;
v.z += a.z;
p.x += v.x;
p.y += v.y;
p.z += v.z;
}
int manhattanDistance()
{
return abs(p.x) + abs(p.y) + abs(p.z);
}
coord p;
coord v;
coord a;
};
inline bool operator< (const coord &a, const coord &b)
{
if (a.x < b.x)
{
return true;
}
else if (a.x > b.x)
{
return false;
}
else
{
if (a.y < b.y)
{
return true;
}
else if (a.y > b.y)
{
return false;
}
else
{
if (a.z < b.z)
{
return true;
}
else
{
return false;
}
}
}
}
coord parseCoord(const string &in, unsigned int offset, unsigned int &consume)
{
coord n;
unsigned int i = 0;
if (in[offset] != '<')
{
throw FormatException();
}
i++;
int temp = 0;
unsigned int con = 0;
temp = decodeInt(in, offset + i, &con);
n.x = temp;
i += con;
while (in[offset + i] == ',')
{
i++;
}
con = 0;
temp = decodeInt(in, offset + i, &con);
n.y = temp;
i += con;
while (in[offset + i] == ',')
{
i++;
}
con = 0;
temp = decodeInt(in, offset + i, &con);
n.z = temp;
i += con;
consume = i;
return n;
}
particle parseLine(const string &in)
{
particle p;
vector<string> sIn = split(in);
unsigned int consume = 0;
p.p = parseCoord(sIn[0], 2, consume);
p.v = parseCoord(sIn[1], 2, consume);
p.a = parseCoord(sIn[2], 2, consume);
return p;
}
map<coord,int> countOccurrences(vector<particle> &parts)
{
map<coord, int> counts;
for (auto &p : parts)
{
if (counts.count(p.p) == 0)
{
counts[p.p] = 1;
}
else
{
counts[p.p]++;
}
}
return counts;
}
void removeDups(vector<particle> &parts, map<coord, int> &ir)
{
vector<particle> t;
for (auto &p : parts)
{
if (ir[p.p] == 1)
{
t.push_back(p);
}
}
parts = t;
}
int main(int argc, char* argv[])
{
try
{
vector<string> input = readFileAsLines("in_20.txt");
vector<particle> ps;
for (auto &l : input)
{
ps.push_back(parseLine(l));
}
auto pbIter = ps.begin();
auto peIter = ps.end();
for (unsigned int i = 0; i!=1000; i++)
{
for (auto &p : ps)
{
p.simulate();
}
map<coord, int> counts;
counts = countOccurrences(ps);
removeDups(ps, counts);
}
bool particleFound = false;
unsigned int fpInd = 0;
for (unsigned int i = 0; i!=ps.size() ; i++)
{
if (!particleFound)
{
particleFound = true;
fpInd = i;
}
else if (ps[i].manhattanDistance() < ps[fpInd].manhattanDistance())
{
fpInd = i;
}
}
cout << "Particle no : " << fpInd << "\n";
cout << "Particles remaining : " << ps.size() << "\n";
}
catch (FileReadException &e)
{
cout << "Could not read file. \n";
}
return 0;
}