Submission #1174491

#TimeUsernameProblemLanguageResultExecution timeMemory
1174491HappyCapybaraShortcut (IOI16_shortcut)C++17
31 / 100
2095 ms420 KiB
#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long

ll find_shortcut(int n, vector<int> l, vector<int> d, int c){
    vector<ll> ps(n, 0);
    for (int i=0; i<n-1; i++) ps[i+1] = ps[i]+l[i];
    ll bsf = (1ll<<50);
    for (int i=0; i<n; i++){
        for (int j=i+1; j<n; j++){
            ll cur = 0;
            for (int x=0; x<n; x++){
                for (int y=x+1; y<n; y++){
                    ll dist = min(d[x]+d[y]+ps[y]-ps[x], d[x]+d[y]+abs(ps[x]-ps[i])+abs(ps[y]-ps[j])+c);
                    cur = max(cur, dist);
                }
            }
            bsf = min(bsf, cur);
        }
    }
    return bsf;
}

Compilation message (stderr)

shortcut.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
shortcut_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...