oj.uz

답안 #135953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135953 2019-07-24T14:22:54 Z Runtime_error_ Shortcut (IOI16_shortcut) C++14
0 / 100
 3 ms 452 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf = 3e3+9 , MX = 1e18+9;
ll c,pre[inf],suf[inf],l[inf],d[inf],sum[inf],premx[inf],sufmx[inf];

ll path(ll x,ll y){
    if(x>y)
        swap(x,y);
    return sum[y-1] - sum[x-1];
}

ll find_shortcut(int n, vector<int> L, vector<int> D, int C){
    c = C;
    ll ret = MX;
    for(ll i=1;i<n;i++)
        l[i] = L[i-1] , d[i] = D[i-1],sum[i] = sum[i-1]+l[i];
    d[n] = D[n-1];

    for(ll i=1;i<=n;i++){
        pre[i] = max(pre[i-1]+l[i-1],d[i]);
        premx[i] = max( premx[i-1] , pre[i-1] +l[i-1] + d[i] );
    }
    for(ll i=n;i>=1;i--){
        suf[i] = max(suf[i+1]+l[i],d[i]);
        sufmx[i] = max( sufmx[i+1] , suf[i+1]+l[i] +d[i] );
    }
    ret = sufmx[1];
    for(ll x=1;x<=n;x++){
        for(ll y=x+1;y<=n;y++){

            ll z = 0,k = 0,diameter = pre[x]+suf[y]+c,mx1 = 0,mx2= 0;

            for( z = x;z<=y && path(z,y)>path(z,x)+c;z++);
            z--;
            for( k = y ; k>=x && path(k,x) > path(k,y)+c;k-- );
            k++;

            for(ll i=x;i<=z;i++)
                diameter = max( diameter , path(i,x)+d[i] +c + suf[y] ),mx1 = max(mx1,path(i,x)+d[i]);

            for(ll i=k ;i<=y;i++)
                diameter = max( diameter , path(i,y)+d[i] +c+pre[x] ),mx2 = max(mx2,path(i,y)+d[i]);
            //diameter = max(diameter,mx1+mx2+c);
            if(z<x)
                z = x;
            if(k>y)
                k = y;
            diameter = max( diameter , premx[k-1] );
            diameter = max( diameter ,sufmx[z+1] );
            /*for(ll i=1;i<k;i++)
                diameter = max(diameter , pre[i]);
             for(ll i=z+1;i<=n;i++)
                diameter = max(diameter , suf[i]);*/

            multiset<int> s;
            int l=x;
            for(int i=x;i<=y;i++){
                while(l<i && path(l,i)>path(i,y)+path(x,l)+c)
                    s.erase(s.find(-pre[l-1]+d[l])),l++;
                if(!s.empty())
                    diameter = max(diameter , *s.rbegin()+sum[i-1]+d[i]);
                s.insert(-pre[i-1]+d[i]);
            }

            //cout<<x<<" "<<y<<" "<<z<<" "<<k<<""<<diameter<<endl;
            ret = min( ret , diameter );
        }
    }
    return ret;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 4, 80 is a correct answer
2 Correct 2 ms 376 KB n = 9, 110 is a correct answer
3 Correct 2 ms 376 KB n = 4, 21 is a correct answer
4 Correct 2 ms 376 KB n = 3, 4 is a correct answer
5 Correct 2 ms 376 KB n = 2, 62 is a correct answer
6 Correct 2 ms 380 KB n = 2, 3 is a correct answer
7 Correct 3 ms 452 KB n = 3, 29 is a correct answer
8 Correct 2 ms 376 KB n = 2, 3 is a correct answer
9 Correct 2 ms 376 KB n = 2, 3 is a correct answer
10 Correct 2 ms 376 KB n = 2, 2000000001 is a correct answer
11 Correct 2 ms 376 KB n = 2, 3000000000 is a correct answer
12 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
13 Correct 2 ms 376 KB n = 3, 3000000000 is a correct answer
14 Correct 2 ms 376 KB n = 4, 3000000001 is a correct answer
15 Correct 2 ms 376 KB n = 4, 4000000000 is a correct answer
16 Correct 2 ms 376 KB n = 5, 4000000000 is a correct answer
17 Correct 2 ms 376 KB n = 10, 1000000343 is a correct answer
18 Correct 2 ms 376 KB n = 10, 3189 is a correct answer
19 Incorrect 2 ms 376 KB n = 10, incorrect answer: jury 7000000000 vs contestant 8000000000
20 Halted 0 ms 0 KB -