제출 #1324857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324857		xyz7577	Shortcut (IOI16_shortcut)	C++17	23 / 100	2094 ms	400 KiB

shortcut

#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int64 find_shortcut(int n, vector<int> l, vector<int> d, int c) {
    vector<int64> pos(n);
    for (int i=1;i<n;i++) pos[i]=pos[i-1]+l[i-1];
    int64 ans=LLONG_MAX;
    for (int i=0; i<n;i++) {
        for (int j=i+1;j<n;j++) {
            int64 diam=0;
            for (int x=0; x<n; x++) {
                int64 max_dist=0;
                for (int y=0; y<n; y++) {
                    if (y==x) continue;
                    int64 normal=llabs(pos[x]-pos[y]);
                    int64 via1=llabs(pos[x]-pos[i])+c+llabs(pos[y]-pos[j]);
                    int64 via2=llabs(pos[x]-pos[j])+c+llabs(pos[y]-pos[i]);
                    int64 best=min(normal, min(via1, via2));
                    int64 dist=best+d[x]+d[y];
                    max_dist=max(max_dist,dist);
                }
                diam=max(diam, max_dist);
            }
            ans=min(ans, diam);
        }
    }
    return ans;
}

컴파일 시 표준 에러 (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: 9 / 9
• Subtask 2: 14 / 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