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
|
#include <cmath>
#include <filesystem>
#include <fstream>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
namespace {
class UnionFind {
public:
explicit UnionFind(size_t size)
: parent_(size)
{
for ( size_t i = 0; i != size; ++i ) {
parent_[i] = i;
}
}
size_t find(size_t n)
{
if ( parent_[n] != n ) {
parent_[n] = find(parent_[n]);
}
return parent_[n];
}
bool unite(size_t a, size_t b)
{
a = find(a);
b = find(b);
if ( a != b ) {
parent_[b] = a;
return true;
}
return false;
}
private:
vector<size_t> parent_;
};
using Pos = tuple<long, long, long>;
vector<Pos>
read_file(const filesystem::path& filename)
{
ifstream file{ filename };
vector<Pos> list;
long x{};
long y{};
long z{};
char ch{};
while ( file >> x >> ch >> y >> ch >> z ) {
list.emplace_back(x, y, z);
}
return list;
}
double
get_distance(const Pos& pos1, const Pos& pos2)
{
const auto [x1, y1, z1] = pos1;
const auto [x2, y2, z2] = pos2;
return hypot(x1 - x2, y1 - y2, z1 - z2);
}
void
part1(const vector<Pos>& list)
{
using Dist = tuple<double, size_t, size_t>; // (Distanz, Von, Nach)
// Distanzen paarweise erfassen...
vector<Dist> dists;
for ( size_t i = 0; i != list.size(); ++i ) {
for ( size_t j = i + 1; j != list.size(); ++j ) {
dists.emplace_back(get_distance(list[i], list[j]), i, j);
}
}
// ... und nach Distanz sortieren
ranges::sort(dists);
UnionFind unionFind(list.size());
// die kürzesten 1000 Elemente verbinden
for ( size_t i = 0; i != 1000; ++i ) {
const auto [dist, a, b] = dists[i];
unionFind.unite(a, b);
}
// die Längen der Verbindungen zählen
map<size_t, size_t> compSizes;
for ( size_t i = 0; i != list.size(); ++i ) {
compSizes[unionFind.find(i)]++;
}
// Größen finden
vector<size_t> sizes;
for ( const auto& [root, size]: compSizes ) {
sizes.emplace_back(size);
}
// Sortieren
ranges::sort(sizes, greater<>());
cout << "Part 1: " << sizes[0] * sizes[1] * sizes[2] << '\n';
}
void
part2(const vector<Pos>& list)
{
using Dist = tuple<double, size_t, size_t>; // (Distanz, Von, Nach)
// Distanzen paarweise erfassen...
vector<Dist> dists;
for ( size_t i = 0; i != list.size(); ++i ) {
for ( size_t j = i + 1; j != list.size(); ++j ) {
dists.emplace_back(get_distance(list[i], list[j]), i, j);
}
}
// ... und nach Distanz sortieren
ranges::sort(dists);
UnionFind unionFind(list.size());
size_t count = 1;
for ( auto [dist, a, b]: dists ) {
if ( unionFind.unite(a, b) ) {
if ( ++count == list.size() ) {
cout << "Part 2: " << get<0>(list[a]) * get<0>(list[b]) << '\n';
return;
}
}
}
}
} // namespace
int
main()
{
auto data = read_file("data/day08.txt");
part1(data);
part2(data);
}
|
