eriedaberrie/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

2024 day 5

Browse source
This commit is contained in:
eriedaberrie 2024-12-04 21:36:28 -08:00
parent 8a9b42d18b
commit 0fabff92b8
2 changed files with 104 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

47
2024/5/main-1.cpp Normal file
View file

@ -0,0 +1,47 @@
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
map<int, set<int>> order;
string line;
while (getline(cin, line) && !line.empty()) {
istringstream l(line);
int a, b;
l >> a;
l.ignore();
l >> b;
if (!order.contains(a)) {
set<int> x;
order[a] = x;
}
order[a].insert(b);
}
int ret = 0;
while (getline(cin, line) && !line.empty()) {
istringstream l(line);
int x;
vector<int> elems;
while (l >> x) {
elems.push_back(x);
l.ignore();
}
for (int i = 0; i < elems.size(); i++) {
if (order.contains(elems[i])) {
for (int j = 0; j < i; j++) {
if (order[elems[i]].contains(elems[j])) {
goto next;
}
}
}
}
ret += elems[elems.size() / 2];
next:;
}
cout << ret << '\n';
}

57
2024/5/main-2.cpp Normal file
View file

@ -0,0 +1,57 @@
#include <bits/stdc++.h>
using namespace std;
map<int, set<int>> order;
bool ordered(vector<int>& elems) {
for (int i = 0; i < elems.size(); i++) {
if (order.contains(elems[i])) {
for (int j = 0; j < i; j++) {
if (order[elems[i]].contains(elems[j])) {
int x = elems[i];
elems[i] = elems[j];
elems[j] = x;
return false;
}
}
}
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string line;
while (getline(cin, line) && !line.empty()) {
istringstream l(line);
int a, b;
l >> a;
l.ignore();
l >> b;
if (!order.contains(a)) {
set<int> x;
order[a] = x;
}
order[a].insert(b);
}
int ret = 0;
while (getline(cin, line) && !line.empty()) {
istringstream l(line);
int x;
vector<int> elems;
while (l >> x) {
elems.push_back(x);
l.ignore();
}
if (ordered(elems)) {
continue;
}
while (!ordered(elems));
ret += elems[elems.size() / 2];
}
cout << ret << '\n';
}