oj.uz

Submission #1026345

# Submission time Handle Problem Language Result Execution time Memory
1026345 2024-07-18T00:36:10 Z vjudge1 Shortcut (IOI16_shortcut) C++17
0 / 100
 9 ms 71256 KB 
#include "shortcut.h"
#include<bits/stdc++.h>

using namespace std;
long long ans=1e18,lofn;
vector<long long>prf,dep,len;
long long precalc[3010][3010];
bool checklr(int lend,int rend){
    vector<long long>dep2=dep,origd;
    long long vl=0,mxpos=0;
    for(int i=2;i<=lend;i++){
        vl=max(vl,dep2[i]+len[i-1]+dep2[i-1]);
        dep2[i]=max(dep2[i],dep2[i-1]+len[i-1]);
    }
    for(int i=dep.size();--i>rend;){
        long long gameover=dep2[i]+len[i-1]+dep2[i-1];
        if(vl<gameover)vl=gameover,mxpos=rend;
        dep2[i-1]=max(dep2[i-1],dep2[i]+len[i-1]);
    }
    origd=dep2;
    for(int i=lend+1;i<=rend;i++)
        dep2[i]=max(dep2[i-1],prf[i]-prf[lend]+dep2[i]);
    dep2[lend-1]=-1e18;
    long long KY=prf[rend]-prf[lend]+lofn;
    int pt=rend;
    for(int i=rend;i>lend;i--){
        long long THIS=0;
        for(int j=i-1;j>lend;j--){
            long long cc=prf[i]-prf[j];
            THIS=max(THIS,min(cc,KY-cc)+origd[i]+origd[j]);
        }
        if(THIS>vl)vl=THIS,mxpos=i;
    }
    ans=min(ans,vl);
    return mxpos==rend;
}
void binsearch(int l){
    int L=l+1,R=dep.size()-1;
    while(L<=R){
        int mid=L+R>>1;
        if(checklr(l,mid))
            L=mid+1;
        else R=mid-1;
    }
}
long long find_shortcut(int n, vector<int> l, vector<int> d, int c) {
    lofn=c;
    dep=len={0};
    prf={0,0};
    for(auto i:l)
        len.push_back(i),
        prf.push_back(i);
    for(auto i:d)
        dep.push_back(i);
    memset(precalc,-7,sizeof precalc);
    for(int i=1;i<=n;i++)
        prf[i]+=prf[i-1],precalc[i][i]=dep[i]-prf[i];
    for(int i=n-1;i;i--) for(int j=i+1;j<=n;j++)
        precalc[i][j]=max(precalc[i][j-1],dep[j]-prf[j]);
    //DNC(1,n-1,1,n);
    for(int i=1;i<n;i++)
        binsearch(i);
    return ans;
}

Compilation message

shortcut.cpp: In function 'bool checklr(int, int)':
shortcut.cpp:25:9: warning: unused variable 'pt' [-Wunused-variable]
   25 |     int pt=rend;
      |         ^~
shortcut.cpp: In function 'void binsearch(int)':
shortcut.cpp:40:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |         int mid=L+R>>1;
      |                 ~^~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 71256 KB n = 4, incorrect answer: jury 80 vs contestant 50
2 Halted 0 ms 0 KB -