blob: 7c613eaf627298bccab112d0d63db7a98aedbba6 (
plain)
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
|
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <tuple>
#include <vector>
#include <ranges>
using namespace std;
vector<tuple<long, long>>
read_file(string_view filename)
{
fstream input{ filename };
vector<tuple<long, long>> data;
long lhs = 0;
long rhs = 0;
while ( input >> lhs >> rhs ) {
data.emplace_back(lhs, rhs);
}
return data;
}
void
part1(const vector<tuple<long, long>>& data)
{
vector<long> lefts;
vector<long> rights;
for ( const auto& [lhs, rhs]: data ) {
lefts.emplace_back(lhs);
rights.emplace_back(rhs);
}
ranges::sort(lefts);
ranges::sort(rights);
long total_distance = 0;
for ( size_t i = 0; i != lefts.size(); ++i ) {
total_distance += abs(lefts[i] - rights[i]);
}
cout << total_distance << endl;
}
void
part2(const vector<tuple<long, long>>& data)
{
vector<long> lefts;
map<long, long> rights;
for ( const auto& [lhs, rhs]: data ) {
lefts.emplace_back(lhs);
rights[rhs]++;
}
auto score = accumulate(lefts.begin(), lefts.end(), 0, [&](auto init, auto lhs) {
return init + lhs * rights[lhs];
});
cout << score << endl;
}
int
main()
{
auto data = read_file("data/day01.txt");
part1(data);
part2(data);
}
|