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
|
#include "aoc.h"
#include <algorithm>
namespace aoc2018 {
std::pair<int, int> day6(line_view file, int sd) {
std::vector<coordinate> cs;
int maxx{INT32_MIN};
int maxy{INT32_MIN};
per_line(file, [&cs, &maxx, &maxy](line_view lv) {
coordinate c(lv);
cs.push_back(c);
maxx = std::max(maxx, c.x);
maxy = std::max(maxy, c.y);
return true;
});
std::sort(cs.begin(), cs.end());
space_board b{maxx + 1, maxy + 1};
// printf("%d %d\n", b.width, b.height);
for (size_t i = 0; i < cs.size(); i++) {
coordinate& c = cs[i];
auto& p = b.ps[c.y * b.width + c.x];
p.id = i;
p.distance = 0;
std::vector<int> total(1, 0);
int win{1};
auto f = [&win, &total, &b, &c, &i](size_t lap, coordinate x) {
if (lap == total.size()) {
total.push_back(0);
}
if (x.x >= 0 && x.x < b.width && x.y >= 0 && x.y < b.height) {
auto& p = b.ps[x.y * b.width + x.x];
int d = x.distance(c);
if (d == p.distance) {
p.id = -2; // same distance
total[lap] += 1;
}
if (d < p.distance) {
p.id = i;
p.distance = d;
total[lap] += 1;
win += 1;
}
}
return true;
};
auto g = [&total]() {
int last = total.size() - 1;
return total[last] == 0;
};
c.traverse(f, g);
// b.print();
// printf("%zu %d\n", i, win);
}
std::vector<int> xs(cs.size(), 0);
b.count(xs);
int max{INT32_MIN};
for (auto& x : xs) {
if (x != INT32_MAX && x > max) {
max = x;
}
}
return {max, b.safe(sd, cs)};
}
} // namespace aoc2018
|
