Submission #219780

#TimeUsernameProblemLanguageResultExecution timeMemory
219780emil_physmathShortcut (IOI16_shortcut)C++17
0 / 100
7 ms768 KiB
#include "shortcut.h" #include <algorithm> #include <iostream> #include <vector> #include <set> using namespace std; using llong = long long; const int maxN = 3001; int t1[4 * maxN], t2[4 * maxN], lazy1[4 * maxN], lazy2[4 * maxN]; int t3[4 * maxN], t4[4 * maxN], lazy3[4 * maxN], lazy4[4 * maxN]; vector<int> x, val; int c; void Push(int* t, int* lazy, int v, int vl, int vr) { if (lazy[v]) { if (vl != vr) { lazy[v * 2] += lazy[v]; lazy[v * 2 + 1] += lazy[v]; } t[v] += lazy[v]; lazy[v] = 0; } } void Add(int* t, int* lazy, int v, int vl, int vr, int l, int r, int val) { if (l > vr || vl > r) return; if (l <= vl && vr <= r) { lazy[v] += val; return; } Push(t, lazy, v, vl, vr); int vm = (vl + vr) / 2; Add(t, lazy, v * 2, vl, vm, l, r, val); Add(t, lazy, v * 2 + 1, vm + 1, vr, l, r, val); Push(t, lazy, v * 2, vl, vm); Push(t, lazy, v * 2 + 1, vm + 1, vr); t[v] = max(t[v * 2], t[v * 2 + 1]); } int Max(int* t, int* lazy, int v, int vl, int vr, int l, int r) { if (vl > r || l > vr) return numeric_limits<int>::min(); Push(t, lazy, v, vl, vr); if (l <= vl && vr <= r) return t[v]; int vm = (vl + vr) / 2; return max(Max(t, lazy, v * 2, vl, vm, l, r), Max(t, lazy, v * 2 + 1, vm + 1, vr, l, r)); } bool Poss(int s, int e, llong cur) { multiset<int> mx; for (int l = s, r = s - 1; l <= e; ++l) { if (r < l) { r = l; mx.clear(); } else mx.erase(mx.find(x[l] + val[l])); while (r + 1 <= e && x[r + 1] - x[l] <= (x[e] - x[s]) - (x[r + 1] - x[l]) + c) { ++r; mx.insert(x[r] + val[r]); } if (mx.size() && *mx.rbegin() - x[l] + val[l] > cur) return false; } mx.clear(); for (int i = s; i <= e; ++i) mx.insert(val[i] - x[i]); for (int l = s, r = s; ; ++l) { while (l > r) { mx.erase(val[r] - x[r]); ++r; cerr << "BAAAAAAAAAD?????: l > r\n"; // exit(0); } while (r <= e && x[r] - x[l] < (x[e] - x[s]) - (x[r] - x[l]) + c) { mx.erase(val[r] - x[r]); ++r; } if (r > e) break; if (mx.size() && (x[e] - x[s]) + *mx.rbegin() + x[l] + val[l] + c > cur) return false; } return true; }; long long find_shortcut(int n, vector<int> l, vector<int> val_, int c_) { val = val_; c = c_; x.resize(n); x[0] = 0; for (int i = 1; i < n; ++i) x[i] = x[i - 1] + l[i - 1]; vector<int> pref(n), suff(n), pathpref(n), pathsuff(n); pref[0] = val[0]; pathpref[0] = val[0]; for (int i = 1; i < n; ++i) { pathpref[i] = max(pathpref[i - 1], pref[i - 1] + x[i] + val[i]); pref[i] = max(pref[i - 1], -x[i] + val[i]); } suff.back() = val.back(); pathsuff.back() = val.back(); for (int i = n - 2; i >= 0; --i) { pathsuff[i] = max(pathsuff[i + 1], suff[i + 1] + (x.back() - x[i]) + val[i]); suff[i] = max(suff[i + 1], -(x.back() - x[i]) + val[i]); } llong ans_l = *max_element(val.begin(), val.end()), ans_r = 10'000'000'000'000'000LL; llong ans = ans_r + 1; while (ans_l <= ans_r) { llong cur = ans_l + (ans_r - ans_l) / 2; bool poss = false; fill(t1, t1 + 4 * maxN, 0); fill(lazy1, lazy1 + 4 * maxN, 0); fill(t2, t2 + 4 * maxN, 0); fill(lazy2, lazy2 + 4 * maxN, 0); fill(t3, t3 + 4 * maxN, 0); fill(lazy3, lazy3 + 4 * maxN, 0); fill(t4, t4 + 4 * maxN, 0); fill(lazy4, lazy4 + 4 * maxN, 0); for (int i = 0; i < n; ++i) { Add(t1, lazy1, 1, 0, n - 1, i, i, val[i]); Add(t2, lazy2, 1, 0, n - 1, i, i, val[i] + c); Add(t3, lazy3, 1, 0, n - 1, i, i, val[i]); Add(t4, lazy4, 1, 0, n - 1, i, i, val[i] + c); } for (int l = 0, r = 0, m = 0, m1 = 0; l < n; r = max(r, ++l)) { if (cur == 100) cerr << ""; if (pathpref[l] > cur) break; while (r < n) { /*if (cur == 110 && l == 0 && r == 7) { for (int i = l; i <= r; ++i) cerr << "tree1[" << i << "] = " << Max(t1, lazy1, 1, 0, n - 1, i, i) << '\n'; }*/ if (cur >= 110 && cur < 120) cerr << ""; if (max(pref[l] + suff[r] + x.back() - (x[r] - x[l]) + min(c, x[r] - x[l]), pathsuff[r]) <= cur) if (m > r || r + 1 >= n || Max(t1, lazy1, 1, 0, n - 1, m, r) + x[r + 1] - x[r] + suff[r + 1] + (x.back() - x[r + 1]) <= cur) if (l > m - 1 || r + 1 >= n || Max(t2, lazy2, 1, 0, n - 1, l, m - 1) + x[r + 1] - x[r] + suff[r + 1] + (x.back() - x[r + 1]) <= cur) break; ++r; while (m <= r && x[m] - x[l] + c < x[r] - x[m]) ++m; while (m1 + 1 <= r && x[m1 + 1] - x[l] <= x[r] - x[m1 + 1] + c) ++m1; if (l <= r - 1) { Add(t1, lazy1, 1, 0, n - 1, l, r - 1, x[r] - x[r - 1]); Add(t4, lazy4, 1, 0, n - 1, l, r - 1, x[r] - x[r - 1]); if (false && cur == 110) { cerr << "Add(t1, lazy1, " << l << ", " << r - 1 << ", " << x[r] - x[r - 1] << ")\n"; for (int i = l; i <= r; ++i) cerr << "tree1[" << i << "] = " << Max(t1, lazy1, 1, 0, n - 1, i, i) << '\n'; cerr << "-----------------\n"; } } Add(t2, lazy2, 1, 0, n - 1, r, r, x[r] - x[l]); Add(t3, lazy3, 1, 0, n - 1, r, r, x[r] - x[l]); if (false && cur == 100) { for (int i = l; i <= m1; ++i) cerr << "tree3[" << i << "] = " << Max(t3, lazy3, 1, 0, n - 1, i, i) << '\n'; cerr << "------\n"; } } if (r >= n) break; if (cur == 110 && l == 2) { for (int i = l; i <= m1; ++i) cerr << "tree3[" << i << "] = " << Max(t3, lazy3, 1, 0, n - 1, i, i) << '\n'; cerr << ""; } if (l <= m1 && l && Max(t3, lazy3, 1, 0, n - 1, l, m1) + x[l] - x[l - 1] + pref[l - 1] + x[l - 1] > cur) continue; if (m1 + 1 <= r && l && Max(t4, lazy4, 1, 0, n - 1, m1 + 1, r) + x[l] - x[l - 1] + pref[l - 1] + x[l - 1] > cur) continue; if (Poss(l, r, cur)) { poss = true; if (cur == 100) { for (int i = l; i <= m1; ++i) cerr << "tree3[" << i << "] = " << Max(t3, lazy3, 1, 0, n - 1, i, i) << '\n'; cerr << ""; } break; } if (l <= r) Add(t2, lazy2, 1, 0, n - 1, l, r, -(x[l + 1] - x[l])); if (l <= r) Add(t3, lazy3, 1, 0, n - 1, l, r, -(x[l + 1] - x[l])); } if (poss) { ans = cur; ans_r = cur - 1; } else ans_l = cur + 1; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...