Day 5 cpp

Author: tmoux

Day5/Makefile

@@ -0,0 +1,16 @@
+CC = g++-13
+CFLAGS = -O2 -std=c++20 -Wall
+
+all: sol
+
+sol: sol.cpp
+$(CC) $(CFLAGS) -o sol sol.cpp
+
+gen: gen.cpp
+$(CC) $(CFLAGS) -o gen gen.cpp
+
+brute: brute.cpp
+$(CC) $(CFLAGS) -o brute brute.cpp
+
+clean:
+$(RM) sol gen brute

Day5/old.cpp

@@ -0,0 +1,118 @@
+#include <bits/stdc++.h>
+using namespace std;
+using ll = long long;
+
+// Template
+#define REP(n) for (int _=0; _<(n); _++)
+#define FOR(i, a, b) for (int i=a; i<(b); i++)
+#define F0R(i, a) for (int i=0; i<(a); i++)
+#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
+#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
+ 
+#define sz(x) (int)(x).size()
+#define all(x) x.begin(), x.end()
+ 
+template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
+template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
+
+namespace std {
+ template<class Fun>
+ class y_combinator_result {
+ Fun fun_;
+ public:
+ template<class T>
+ explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
+ 
+ template<class ...Args>
+ decltype(auto) operator()(Args &&...args) {
+ return fun_(std::ref(*this), std::forward<Args>(args)...);
+ }
+ };
+ 
+ template<class Fun>
+ decltype(auto) y_combinator(Fun &&fun) {
+ return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
+ }
+} // namespace std
+
+#define DEBUG(x) cerr << #x << ": " << x << '\n'
+template<typename A, typename B> 
+ostream& operator<<(ostream &os, const pair<A, B> &p) { 
+ return os << '(' << p.first << ", " << p.second << ')'; 
+}
+template<typename T_container, 
+ typename T = typename enable_if<!is_same<T_container, string>::value, 
+ typename T_container::value_type>::type> 
+ostream& operator<<(ostream &os, const T_container &v) { 
+ os << '['; string sep; 
+ for (const T &x : v) 
+ os << sep << x, sep = ", "; 
+ return os << ']'; 
+}
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+
+int main() {
+ ios_base::sync_with_stdio(false); cin.tie(NULL);
+ string line;
+ getline(cin, line);
+ string t;
+ vector<ll> seeds;
+ {
+ stringstream ss(line.substr(7));
+ while (getline(ss, t, ' ')) {
+ // cout << t << endl;
+ seeds.push_back(stoll(t));
+ }
+ }
+ DEBUG(seeds);
+ getline(cin, line);
+
+
+ using P = pair<ll, ll>;
+ using T = vector<pair<P, P>>;
+ vector<T> V;
+ REP(7) {
+ getline(cin, line);
+
+ T cur;
+ while (true) {
+ getline(cin, line);
+ if (line.empty()) break;
+ else {
+ stringstream ss(line);
+ ll x, y, d; ss >> x >> y >> d;
+ cur.push_back({{y, y + d - 1}, {x, x + d - 1}});
+ }
+ }
+ V.push_back(cur);
+ }
+
+ cout << V << endl;
+
+ auto get_pos = [&](ll x) {
+ cout << x << ": " << endl;
+ for (auto v: V) {
+ ll nxt = -1;
+ for (auto [p1, p2]: v) {
+ auto [a, b] = p1;
+ auto [c, d] = p2;
+ if (a <= x && x <= b) {
+ nxt = c + (x - a);
+ break;
+ }
+ }
+ if (nxt == -1) nxt = x;
+ x = nxt;
+ cout << "now " << x << endl;
+ }
+ return x;
+ };
+
+
+ ll ans = 1e18;
+ for (auto x: seeds) {
+ // cout << x << ": " << get_pos(x) << endl;
+ ckmin(ans, get_pos(x));
+ }
+ cout << ans << endl;
+}

Day5/sol.cpp

@@ -0,0 +1,80 @@
+#include <bits/stdc++.h>
+using namespace std;
+using ll = long long;
+
+#define REP(n) for (int _=0; _<(n); _++)
+#define sz(x) (int)(x).size()
+#define all(x) x.begin(), x.end()
+
+int main() {
+ // Parse input
+ string line;
+ getline(cin, line);
+ string t;
+ vector<pair<ll, ll>> curRanges;
+ {
+ stringstream ss(line);
+ ss >> t;
+ vector<ll> v;
+ ll x;
+ while (ss >> x) v.push_back(x);
+ for (int i = 0; i < sz(v); i += 2) {
+ curRanges.push_back({v[i], v[i]+v[i+1] - 1});
+ }
+ }
+ getline(cin, line);
+
+ using P = pair<ll, ll>;
+ using T = pair<P, P>;
+ vector<vector<T>> V;
+ REP(7) {
+ getline(cin, line);
+ vector<T> cur;
+ while (getline(cin, line) && !line.empty()) {
+ stringstream ss(line);
+ ll x, y, d; ss >> x >> y >> d;
+ cur.push_back({{y, y + d - 1}, {x, x + d - 1}});
+ }
+ sort(all(cur));
+ V.push_back(cur);
+ }
+ ///////////////////////////////////////////////////////////////////////
+ const ll MAX = 1e18;
+ for (auto v: V) {
+ auto next_interval = [&](ll l) -> pair<P, P> {
+ // Find the interval [X, Y] that contains l (if one exists).
+ // Otherwise, return the nearest interval to the right (or infinity if none exists)
+ auto it = std::lower_bound(all(v), pair<P, P>({{l+1, 0}, {0, 0}}));
+ if (it != v.begin() && l <= prev(it)->first.second) return *prev(it);
+ else if (it != v.end()) return *it;
+ else return {{MAX, MAX}, {MAX, MAX}};
+ };
+ vector<pair<ll, ll>> nxtRanges;
+ for (auto [l, r]: curRanges) {
+ // Split up the range [l, r] into new ranges
+ ll cur = l;
+ while (cur <= r) {
+ auto [p1, p2] = next_interval(cur);
+ auto [X1, Y1] = p1;
+ auto [X2, Y2] = p2;
+
+ if (X1 > r) {
+ nxtRanges.push_back({cur, r});
+ cur = r + 1;
+ }
+ else if (X1 <= cur && cur <= Y1) {
+ ll R = min(r, Y1);
+ nxtRanges.push_back({X2 + (cur - X1), X2 + (R - X1)});
+ cur = R + 1;
+ }
+ else if (cur < X1) {
+ nxtRanges.push_back({cur, X1 - 1});
+ cur = X1;
+ }
+ else assert(false);
+ }
+ }
+ curRanges = nxtRanges;
+ }
+ cout << std::min_element(all(curRanges))->first << '\n';
+}