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
|
#pragma once
#include "common.h"
#include <stack>
#include <vector>
namespace aoc2015 {
struct reindeer {
line_view name;
int speed;
int fly_seconds;
int rest_seconds;
friend std::ostream& operator<<(std::ostream& o, const reindeer& r) {
o << r.name << " " << r.speed << " " << r.fly_seconds << " " << r.rest_seconds;
return o;
}
};
struct olympics {
std::vector<reindeer> reindeers;
std::vector<int> points;
int get_number(const char* p) {
int d{0};
while (*p != ' ') {
d = d * 10 + *p - '0';
p++;
}
return d;
}
int kilometers(const reindeer& r, int s) {
int period = r.fly_seconds + r.rest_seconds;
int x = s / period;
int y = s % period;
if (y > r.fly_seconds) {
y = r.fly_seconds;
}
return x * (r.speed * r.fly_seconds) + r.speed * y;
}
std::pair<line_view, int> best(int s) {
std::pair<line_view, int> d{{}, INT32_MIN};
for (auto& r : reindeers) {
auto x = kilometers(r, s);
// std::cout << r.name << ": " << x << std::endl;
if (x > d.second) {
d = {r.name, x};
}
}
return d;
}
void score(int s) {
std::vector<int> ps(reindeers.size());
for (size_t i = 0; i < reindeers.size(); i++) {
ps[i] = kilometers(reindeers[i], s);
}
std::stack<int> x;
x.push(0);
for (size_t i = 1; i < ps.size(); i++) {
if (ps[i] > ps[x.top()]) {
while (!x.empty()) {
x.pop();
}
x.push(i);
} else {
if (ps[i] == ps[x.top()]) {
x.push(i);
}
}
}
while (!x.empty()) {
points[x.top()] += 1;
x.pop();
}
}
std::pair<line_view, int> best_points(int s) {
for (int i = 1; i <= s; i++) {
score(i);
}
// for (size_t i = 0; i < reindeers.size(); i++) {
// std::cout << reindeers[i].name << ": " << points[i] << std::endl;
// }
int x = 0;
for (size_t i = 1; i < points.size(); i++) {
if (points[i] > points[x]) {
x = i;
}
}
return {reindeers[x].name, points[x]};
}
void parse(line_view lv) {
const char* p1 = lv.contains("can");
const char* p2 = lv.contains("for");
line_view tail = {p2 + 3, lv.line + lv.length};
const char* p3 = tail.contains("for");
reindeer r;
r.name = line_view{lv.line, p1 - 1};
r.speed = get_number(p1 + 8);
r.fly_seconds = get_number(p2 + 4);
r.rest_seconds = get_number(p3 + 4);
// std::cout << r << std::endl;
reindeers.push_back(r);
points.push_back(0);
}
}; // namespace aoc2015
std::pair<int, int> day14(line_view, int);
} // namespace aoc2015
|
