Submission #1022160

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022160		amirhoseinfar1385	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	4444 KiB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1000000+10;
long long inf=1e16,n,c;
long long alld[maxn],mainres=inf,mxa[maxn],mxb[maxn];
vector<long long>all;

long long pors(long long l,long long r){
    long long b=all[r]-all[l]+c;
    long long fake=0;
    for(long long i=0;i<n;i++){
        if(i<=l){
            fake=max(fake,alld[i]+all[l]-all[i]+min(c,b-c)+mxb[r]);
            fake=max(fake,alld[i]+all[i]-(i==0?0:all[i-1])+(i==0?0:mxa[i-1]));
        }else if(i>=r){
            fake=max(fake,alld[i]+all[i]-all[r]+min(c,b-c)+mxa[l]);
            fake=max(fake,alld[i]-all[i]+all[i+1]+mxb[i+1]);
        }else{
            fake=max(fake,min(all[i]-all[l],b-(all[i]-all[l]))+mxa[l]+alld[i]);
            fake=max(fake,min(all[r]-all[i],b-(all[r]-all[i]))+mxb[r]+alld[i]);
        }
    }
    for(long long i=l;i<=r;i++){
        for(long long j=i+1;j<=r;j++){
            fake=max(fake,min(b-(all[j]-all[i]),all[j]-all[i])+alld[i]+alld[j]);
        }
    }
    return fake;
}

void solve(long long l,long long r,long long tl=0,long long tr=n-1){
//    cout<<l<<" "<<r<<" "<<tl<<" "<<tr<<endl;
    if(tl>tr||l>r){
        return ;
    }
    int mid=(l+r)>>1;
    long long fake=inf,wh=-1;
    for(int i=tr;i>=tl;i--){
        long long z=pors(i,mid);
        if(z<=fake){
            fake=z;
            wh=i;
        }
    }
    mainres=min(mainres,fake);
    solve(l,mid-1,tl,wh);
    solve(mid+1,r,wh,tr);
}

long long find_shortcut(int n_, std::vector<int> l, std::vector<int> d, int c_)
{
    n=n_;
    c=c_;
    all.push_back(0);
    alld[0]=d[0];
    l.push_back(0);
    for(long long i=1;i<n;i++){
        all.push_back(all.back()+l[i-1]);
        alld[i]=d[i];
    }
    for(long long i=0;i<n;i++){
        if(i!=0){
            mxa[i]=max(mxa[i-1]+l[i-1],alld[i]);
        }else{
            mxa[i]=alld[i];
        }
    }
    all[n]=all[n-1];
    for(long long i=n-1;i>=0;i--){
        mxb[i]=max(mxb[i+1]+l[i],alld[i]);
    }
    solve(0,n-1);
    return mainres;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3