Submission #823902

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
823902	2023-08-13T09:55:39 Z	vnm06	Shortcut (IOI16_shortcut)	C++14	0 / 100	0 ms	212 KB

shortcut

#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;

int N;
long long t[508], ct, diam=0;
long long dst[508], calc[508];
long long pr[508];
long long pr_le[508], pr_ri[508];

void precalc()
{
    for(int i=1; i<N; i++) pr[i]=pr[i-1]+dst[i];
    for(int i=0; i<N; i++)
    {
        for(int j=0; j<=i; j++) if(pr[i]-pr[j]+t[j]>pr_le[i]) pr_le[i]=pr[i]-pr[j]+t[j];
        for(int j=i; j<N; j++) if(pr[j]-pr[i]+t[j]>pr_ri[i]) pr_ri[i]=pr[j]-pr[i]+t[j];
    }
}

long long find_diam(int le, int ri)
{
    if(le>ri) swap(le, ri);
    if(ct>pr[ri]-pr[le]) return diam;
    swap(t[le], pr_le[le]);
    swap(t[ri], pr_ri[ri]);
    long long md=0, sum=pr[ri]-pr[le]+ct;
    for(int i=le; i<=ri; i++)
    {
        for(int j=i+1; j<=ri; j++)
        {
            long long st1=pr[j]-pr[i]+t[j]+t[i], st2=sum-pr[j]+pr[i]+t[j]+t[i];
            if(min(st1, st2)> md) md=min(st1, st2);
        }
    }
    swap(t[le], pr_le[le]);
    swap(t[ri], pr_ri[ri]);
    for(int i=0; i<=le; i++)
    {
        for(int j=i+1; j<=le; j++) if(md<t[i]+t[j]+pr[j]-pr[i]) md=t[i]+t[j]+pr[j]-pr[i];
    }
    for(int i=ri; i<N; i++)
    {
        for(int j=i+1; j<N; j++) if(md<t[i]+t[j]+pr[j]-pr[i]) md=t[i]+t[j]+pr[j]-pr[i];
    }
    return md;
}

int bst[508];
stack<pair<int, int> > st;

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    N=n;
    ct=c;
    for(int i=0; i<n; i++) t[i]=d[i];
    for(int i=1; i<n; i++) dst[i]=l[i-1];
    precalc();
    for(int i=0; i<n; i++) diam=max(diam, t[i]+pr_ri[i]);
    ///cout<<diam<<endl;
    ///for(int i=0; i<n; i++) cout<<pr_le[i]<<" "<<pr_ri[i]<<endl;
    st.push({0, n-1});
    while(!st.empty())
    {
        int tb=st.top().first;
        int te=st.top().second;
        st.pop();
        if(te<tb) continue;
        int mid=(tb+te)/2;
        ///cout<<mid<<endl;
        int grL=mid, grD=n-1;
        if(tb!=0) grL=bst[tb-1];
        if(te!=n-1) grD=bst[te+1];
        calc[mid]=1e18;
        for(int i=grL; i<=grD; i++)
        {
            long long nd=find_diam(mid, i);
            if(nd<calc[mid]) calc[mid]=nd, bst[mid]=i;
        }
        st.push({tb, mid-1});
        st.push({mid+1, te});
    }
    ///for(int i=0; i<n; i++) cout<<calc[i]<<" "<<bst[i]<<endl;
    long long maxd=1e18;
    for(int i=0; i<n; i++) if(calc[i]<maxd) maxd=calc[i];
    return maxd;
}

Subtask #1
0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #2
0 / 14.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #3
0 / 8.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #4
0 / 7.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #5
0 / 33.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #6
0 / 22.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #7
0 / 4.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Subtask #8
0 / 3.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	n = 4, 80 is a correct answer
2	Incorrect	212 KB	n = 9, incorrect answer: jury 110 vs contestant 130
3	Halted	0 KB	-

Submission #823902

Compilation message