This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5+10;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;
long long find_shortcut(int n, vector<int> l, vector<int> d, int c)
{
vector<ll> s(n); s[0]=0;
for(int i=1;i<n;i++) s[i]=s[i-1]+l[i-1];
ll ans=LINF;
for(int i=0;i<n-1;i++){
int low=i+1, high=n;
ll resp=LINF;
while(low<=high){
int mid=(low+high)>>1;
ll mx=0, id=-1;
for(int j=0;j<n-1;j++)
for(int k=j+1;k<n;k++)
if((ll)d[j]+(ll)d[k]+min(s[k]-s[j], abs(s[j]-s[i])+abs(s[k]-s[mid])+c)>mx)
mx=(ll)d[j]+(ll)d[k]+min(s[k]-s[j], abs(s[j]-s[i])+abs(s[k]-s[mid])+c), id=k;
resp=min(resp, mx);
if(id<=mid) high=mid-1;
else low=mid+1;
}
ans=min(ans, resp);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |