Submission #1174653

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174653		HappyCapybara	Shortcut (IOI16_shortcut)	C++17	0 / 100	0 ms	328 KiB

shortcut

#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;
            vector<int> v;
            //for (int k=0; k<n; k++) v.push_back(k);
            pair<int,int> bl = {-1, -1}, br = {-1, -1};
            for (int k=0; k<i; k++){
                bl = max(bl, {d[k]+ps[n-1]-ps[k], k});
                br = max(br, {d[k]+ps[k], k});
            }
            v.push_back(bl.second);
            v.push_back(br.second);
            bl = {-1, -1}; br = {-1, -1};
            for (int k=i; k<=j; k++){
                bl = max(bl, {d[k]+ps[n-1]-ps[k], k});
                br = max(br, {d[k]+ps[k], k});
            }
            v.push_back(bl.second);
            v.push_back(br.second);
            bl = {-1, -1}; br = {-1, -1};
            for (int k=j+1; k<n; k++){
                bl = max(bl, {d[k]+ps[n-1]-ps[k], k});
                br = max(br, {d[k]+ps[k], k});
            }
            v.push_back(bl.second);
            v.push_back(br.second);
            for (int x : v){
                for (int y=0; y<n; y++){
                    if (y == x) continue;
                    ll dist = min(d[x]+d[y]+abs(ps[y]-ps[x]), d[x]+d[y]+c+min(abs(ps[x]-ps[i])+abs(ps[y]-ps[j]), abs(ps[y]-ps[i])+abs(ps[x]-ps[j])));
                    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
      |         ^~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3