1
0
forked from danmax/aoc

added C++ versions that I did

This commit is contained in:
deadvey
2024-12-11 20:51:38 +00:00
parent 4f75e45108
commit a5ad5e19fc
13 changed files with 4002213 additions and 0 deletions

BIN
2024/day1bothparts/a.out Executable file

Binary file not shown.

4000000
2024/day1bothparts/b Normal file

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,46 @@
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <chrono>
int main() {
std::vector<int> x;
std::vector<int> y;
int l, r;
long t = 0;
long t2 = 0;
int c = 0;
std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
std::ifstream f("b");
while (f >> l >> r) {
x.push_back(l);
y.push_back(r);
}
std::sort(x.begin(), x.end());
std::sort(y.begin(), y.end());
for (size_t i = 0; i < 4000000; i++) {
t += std::abs(x[i] - y[i]);
}
auto p = y.begin();
for (size_t i = 0; i < 4000000; i++) {
auto b = std::lower_bound(p, y.end(), x[i]);
auto u = std::upper_bound(p, y.end(), x[i]);
int c = u - b;
t2 += x[i] * c;
p = b;
}
std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
std::cout << "Part 1: " << t << "\nPart 2: " << t2 << "\n";
std::cout << "Time difference = " << std::chrono::duration_cast<std::chrono::microseconds>(end - begin).count() << " microseconds" << std::endl;
return 0;
}

1000
2024/day1bothparts/m Normal file

File diff suppressed because it is too large Load Diff

8
2024/day1bothparts/mult.sh Executable file
View File

@@ -0,0 +1,8 @@
g++ sorter.cpp -o run
time ./run
time ./run | grep real
time ./run | grep real
time ./run | grep real
time ./run | grep real
time ./run | grep real
time ./run

View File

@@ -0,0 +1,30 @@
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
int main() {
std::ifstream f("b");
std::vector<int> x;
std::vector<int> y;
int l, r;
while (f >> l >> r) {
x.push_back(l);
y.push_back(r);
}
std::sort(x.begin(), x.end());
std::sort(y.begin(), y.end());
long t = 0;
for (size_t i = 0; i < 4000000; i++) {
t += std::abs(x[i] - y[i]);
}
std::cout << t;
return 0;
}

View File

@@ -0,0 +1,36 @@
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
int main() {
std::ifstream f("b");
std::vector<int> x;
std::vector<int> y;
int l, r;
while (f >> l >> r) {
x.push_back(l);
y.push_back(r);
}
std::sort(x.begin(), x.end());
std::sort(y.begin(), y.end());
long t = 0;
int c = 0;
auto p = y.begin();
for (size_t i = 0; i < 4000000; i++) {
auto b = std::lower_bound(p, y.end(), x[i]);
auto u = std::upper_bound(p, y.end(), x[i]);
int c = u - b;
t += x[i] * c;
p = b;
}
std::cout << t;
return 0;
}

BIN
2024/day1bothparts/run Executable file

Binary file not shown.

6
2024/day1bothparts/s Normal file
View File

@@ -0,0 +1,6 @@
3 4
4 3
2 5
1 3
3 9
3 3