Submission #1174097

#TimeUsernameProblemLanguageResultExecution timeMemory
1174097MPGDivide and conquer (IZhO14_divide)C++20
100 / 100
254 ms135588 KiB
//#pragma GCC optomize("Ofast") #pragma GCC optimize("unroll-loops") //#pragma GCC optimize("O3") //#pragma GCC target("avx2") //#pragma GCC target("sse,sse2,sse4.1,sse4.2") #include <bits/stdc++.h> using namespace std; typedef long long ll; #define max_heap priority_queue<pair <ll, pair <ll, ll>>> //#define min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>> #define min_heap priority_queue<pair <ll, pair <ll, ll>>, vector<pair <ll, pair <ll, ll>>>, greater<pair <ll, pair <ll, ll>>>> #define sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false); #define filE freopen("in.txt", "r", stdin);// freopen("out1.txt", "w", stdout); #define endl '\n' #define md(a) (a % mod + mod) % mod #define pb push_back //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //cout << setprecision(5) << fixed << f; //hash prime = 769 ll const maxn = 2e5 + 123; ll const inf = 3e18; ll const loG = 18; // 23 ll const mod = 1e9 + 7; //ll const mod = 998244353; ll const sq = 500; ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;} ll n, arr[maxn][3], ps[maxn][2], bach[maxn * 50][2], ans, id = -1; vector <ll> seg; ll add_child(){ id++; seg.pb(id); seg[id] = inf; return id; } void setter(ll i, ll val, ll x, ll lx, ll rx){ if (rx - lx == 1){ seg[x] = min(seg[x], val); return; } if (!bach[x][0]){ bach[x][0] = add_child(); bach[x][1] = add_child(); } ll mid = (lx + rx) / 2, a = bach[x][0], b = bach[x][1]; if (i < mid){ setter(i, val, a, lx, mid); } else{ setter(i, val, b, mid, rx); } seg[x] = min(seg[bach[x][0]], seg[bach[x][1]]); } ll get(ll l, ll r, ll x, ll lx, ll rx){ if (l >= rx || lx >= r) return inf; if (l <= lx && rx <= r) return seg[x]; if (!bach[x][0]){ bach[x][0] = add_child(); bach[x][1] = add_child(); } ll mid = (lx + rx) / 2, a = bach[x][0], b = bach[x][1]; ll val1 = get(l, r, a, lx, mid); ll val2 = get(l, r, b, mid, rx); return min(val1, val2); } void Solve(){ cin >> n; for (int i = 1; i < n + 1; i++){ cin >> arr[i][0] >> arr[i][2] >> arr[i][1]; ps[i][0] += ps[i - 1][0] + arr[i][1]; ps[i][1] += ps[i - 1][1] + arr[i][2]; } add_child(); for (int i = 1; i < n + 1; i++){ ll x = get(arr[i][0] - ps[i][0] + mod, inf, 0, 0, inf); //cout << i << ' ' << x << endl; ans = max(ans, ps[i][1] - x); ans = max(ans, ps[i][1] - ps[i - 1][1]); setter(arr[i][0] - ps[i - 1][0] + mod, ps[i - 1][1], 0, 0, inf); } cout << ans << endl; } int main(){ sariE; //filE; int test = 1; //cin >> test; while (test--) Solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...