oj.uz

답안 #1116789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116789 2024-11-22T11:37:39 Z SalihSahin Shortcut (IOI16_shortcut) C++14
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "shortcut.h"

long long inf = 1e16;

 
long long find_shortcut(int n, vector<int> l, vector<int> d, int c){
    vector<long long> pre(n);
    for(int i = 0; i < n-1; i++){
        pre[i+1] = pre[i] + l[i];
    }
    vector<long long> lfar(n), rfar(n);
    lfar[0] = d[0];
    for(int i = 1; i < n; i++){
        if(d[i] > lfar[i-1] + l[i-1]) lfar[i] = d[i];
        else lfar[i] = lfar[i-1] + l[i-1];
    }
    rfar[n-1] = d[n-1];
    for(int i = n-2; i >= 0; i--){
        if(d[i] > rfar[i+1] + l[i]) rfar[i] = d[i];
        else rfar[i] = rfar[i+1] + l[i];
    }
 
    vector<long long> precalcl(n), precalcr(n);
    for(int i = 1; i < n; i++){
        precalcl[i] = max(precalcl[i-1], (long long)(lfar[i-1] + l[i-1] + d[i]));
    }
    for(int i = n-2; i >= 0; i--){
        precalcr[i] = max(precalcr[i+1], (long long)(rfar[i+1] + l[i] + d[i]));
    }
 
    long long ans = inf;
    for(int i = 0; i < n-1; i++){
        ans = min(ans, lfar[i] + rfar[i+1] + l[i]);
    }
 
    for(int l = 0; l < n; l++){
        long long maxla = precalcl[l];

        long long L = maxla, R = inf;
        while(L < R){
            long long M = (L + R)/2;

            int l2 = l+1, r2 = n-1;
            while(l2 < r2){
                int r = (l2 + r2)/2;
                long long dis1 = 0;
                dis1 = lfar[l] + rfar[r] + c; // L-R
                dis1 = max(dis1, precalcr[r]); // R-R
                if(dis1 <= M) r2 = r;
                else l2 = r + 1;
            }
            int shouldbiggerthan = l2;
            long long disc = 0;
            disc = lfar[l] + rfar[l2] + c; // L-R
            disc = max(disc, precalcr[l2]); // R-R
            if(disc > M) shouldbiggerthan = n+1;

            l2 = l+1, r2 = n-1;
            while(l2 < r2){
                int r = (l2 + r2 + 1)/2;
                long long dis2 = 0;
                long long clen = pre[r] - pre[l] + c;
                
                for(int j = l+1; j <= r; j++){
                    dis2 = max(dis2, lfar[l] + (long long)d[j] + min(pre[j] - pre[l], clen - (pre[j] - pre[l])));
                } // L-M
                for(int j = l; j < r; j++){
                    dis2 = max(dis2, rfar[r] + (long long)d[j] + min(pre[r] - pre[j], clen - (pre[r] - pre[j])));
                } // R-M
     
                for(int j = l+1; j < r; j++){ // M-M
                    long long addj = d[j];
                    for(int j2 = j+1; j2 < r; j2++){
                        long long addj2 = d[j2];
                        dis2 = max(dis2, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + addj + addj2);
                    }
                }

                if(dis2 <= M) l2 = r;
                else r2 = r - 1;
            }
            int shouldsmallerthan = l2;
            disc = 0;
            long long clen = pre[l2] - pre[l] + c;
            
            for(int j = l+1; j <= l2; j++){
                disc = max(disc, lfar[l] + (long long)d[j] + min(pre[j] - pre[l], clen - (pre[j] - pre[l])));
            } // L-M
            for(int j = l; j < l2; j++){
                disc = max(disc, rfar[l2] + (long long)d[j] + min(pre[l2] - pre[j], clen - (pre[l2] - pre[j])));
            } // R-M
 
            for(int j = l+1; j < l2; j++){ // M-M
                long long addj = d[j];
                for(int j2 = j+1; j2 < l2; j2++){
                    long long addj2 = d[j2];
                    disc = max(disc, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + addj + addj2);
                }
            }

            if(disc > M) shouldsmallerthan = -1;

            if(shouldbiggerthan <= shouldsmallerthan) R = M;
            else L = M + 1;
        }

        ans = min(ans, L);
    }
 
    return ans;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n = 4, 80 is a correct answer
2 Incorrect 1 ms 336 KB n = 9, incorrect answer: jury 110 vs contestant 100
3 Halted 0 ms 0 KB -