Submission #1116902

#TimeUsernameProblemLanguageResultExecution timeMemory
1116902SalihSahinShortcut (IOI16_shortcut)C++14
0 / 100
1 ms504 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; #include "shortcut.h" long long inf = 1e16; long long find_shortcut(int n, vector<int> l, vector<int> d, int c){ vector<long long> pre(n); for(int i = 0; i < n-1; i++){ pre[i+1] = pre[i] + l[i]; } vector<long long> lfar(n), rfar(n); lfar[0] = d[0]; for(int i = 1; i < n; i++){ if(d[i] > lfar[i-1] + l[i-1]) lfar[i] = d[i]; else lfar[i] = lfar[i-1] + l[i-1]; } rfar[n-1] = d[n-1]; for(int i = n-2; i >= 0; i--){ if(d[i] > rfar[i+1] + l[i]) rfar[i] = d[i]; else rfar[i] = rfar[i+1] + l[i]; } vector<long long> precalcl(n), precalcr(n); for(int i = 1; i < n; i++){ precalcl[i] = max(precalcl[i-1], (long long)(lfar[i-1] + l[i-1] + d[i])); } for(int i = n-2; i >= 0; i--){ precalcr[i] = max(precalcr[i+1], (long long)(rfar[i+1] + l[i] + d[i])); } long long ans; long long withoutc = 0; for(int i = 0; i < n-1; i++){ withoutc = max(withoutc, lfar[i] + rfar[i+1] + l[i]); } ans = withoutc; int L = 0, R = n-1; while(L <= R){ int l = (L + R)/2; long long maxla = precalcl[l]; int l2 = l+1, r2 = n-1; while(l2 < r2){ int r = (l2 + r2)/2; long long dis1 = 0; dis1 = lfar[l] + rfar[r] + c; // L-R dis1 = max(dis1, precalcr[r]); // R-R long long clen = pre[r] - pre[l] + c; for(int j = l; j < r; j++){ dis1 = max(dis1, rfar[r] + (long long)d[j] + min(pre[r] - pre[j], clen - (pre[r] - pre[j]))); } // R-M long long dis3 = 0; for(int j = l+1; j <= r; j++){ dis3 = max(dis3, lfar[l] + (long long)d[j] + min(pre[j] - pre[l], clen - (pre[j] - pre[l]))); } // L-M long long dis2 = 0; for(int j = l+1; j < r; j++){ // M-M for(int j2 = j+1; j2 < r; j2++){ dis2 = max(dis2, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + (long long)d[j] + (long long)d[j2]); } } ans = min(ans, max({dis1, dis2, dis3, maxla})); if(dis1 < max(dis2, dis3)) r2 = r; else l2 = r + 1; } int r = l2; long long disr = 0; long long dis1 = 0; dis1 = lfar[l] + rfar[r] + c; // L-R disr = max(disr, precalcr[r]); // R-R long long clen = pre[r] - pre[l] + c; for(int j = l; j < r; j++){ dis1 = max(dis1, rfar[r] + (long long)d[j] + min(pre[r] - pre[j], clen - (pre[r] - pre[j]))); } // R-M long long dis3 = 0; for(int j = l+1; j <= r; j++){ dis3 = max(dis3, lfar[l] + (long long)d[j] + min(pre[j] - pre[l], clen - (pre[j] - pre[l]))); } // L-M long long dis2 = 0; for(int j = l+1; j < r; j++){ // M-M for(int j2 = j+1; j2 < r; j2++){ dis2 = max(dis2, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + (long long)d[j] + (long long)d[j2]); } } //cout<<l<<" "<<r<<" icin -> "<<maxla<<" "<<dis3<<" -> "<<dis2<<" "<<dis1<<endl; ans = min(ans, max({dis1, dis2, dis3, maxla, disr})); if(max({dis3, maxla, dis1}) > dis2) R = l-1; else L = l+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...