Submission #293324

#	Time	Username	Problem	Language	Result	Execution time	Memory
293324		peti1234	Shortcut (IOI16_shortcut)	C++17	0 / 100	1 ms	384 KiB

shortcut

#include <bits/stdc++.h>

using namespace std;
const int c=502;
vector<int> pl;
long long ans=0, kom[c], ert, maxi, maxj, am, tav[c][c];
long long dist(int a, int b) {
    return pl[a]+pl[b]+abs(kom[b]-kom[a]);
}
long long find_shortcut(int n, vector<int> sz, vector<int> s, int d) {
    for (int i=0; i<n-1; i++) kom[i+1]=kom[i]+sz[i];
    for (int i=0; i<n; i++) pl.push_back(s[i]);
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) {
        tav[i][j]=dist(i, j);
        if (i!=j) ans=max(ans, tav[i][j]);
    }
    for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) {
        ert=0, maxi=0, maxj=0;
        for (int k=0; k<=i; k++) maxi=max(maxi, tav[k][i]-pl[i]);
        for (int k=j; k<n; k++) maxj=max(maxj, tav[k][j]-pl[j]);
        ert=maxi+maxj+d;
        for (int k=i; k<=j; k++) {
            long long tavi=min(tav[k][i]-pl[i], tav[k][j]-pl[j]+d), tavj=min(tav[k][j]-pl[j], tav[k][i]-pl[i]+d);
            ert=max({ert, tavi+maxi, tavj+maxj});
            for (int l=k+1; l<=j; l++) {
                long long x=min(tav[l][i]-pl[i], tav[l][j]-pl[j]+d);
                ert=max(ert, min(x+tavi, tav[k][l]));
            }
        }
        ans=min(ans, ert);
    }
    return ans;
}

• 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