oj.uz

Submission #1116763

# Submission time Handle Problem Language Result Execution time Memory
1116763 2024-11-22T10:50:49 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--){
        precalcl[i] = max(precalcl[i+1], (long long)(rfar[i+1] + l[i] + d[i]));
    }

    long long ans = inf;
    bool calc = false;

    for(int l = 0; l < n; l++){
        for(int r = l+1; r < n; r++){
            if(pre[r] - pre[l] < c && calc) continue;

            calc = true;
            long long dis = lfar[l] + rfar[r] + min((long long)c, pre[r] - pre[l]); // L-R
            dis = max(dis, precalcl[l]); // L-L
            dis = max(dis, precalcr[r]); // R-R
            long long clen = pre[r] - pre[l] + c;
            
            for(int j = l+1; j <= r; j++){
                dis = max(dis, 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++){
                dis = max(dis, 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];
                    dis = max(dis, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + addj + addj2);
                }
            }

            ans = min(ans, dis);
        }
    }

    return ans;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 7.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 22.0

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

Subtask #7
0 / 4.0

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

Subtask #8
0 / 3.0

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