제출 #1324858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324858		xyz7577	Shortcut (IOI16_shortcut)	C++17	0 / 100	0 ms	332 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;
    vector<int64> d_plus_pos(n), d_minus_pos(n);
    for (int i=0;i<n;i++) {
        d_plus_pos[i]=d[i]+pos[i];
        d_minus_pos[i]=d[i]-pos[i];
    }

    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_normal=0;
                max_normal=max({*max_element(d_plus_pos.begin(), d_plus_pos.end())-pos[x]+d[x], *max_element(d_minus_pos.begin(), d_minus_pos.end())+pos[x]+d[x]});
                int64 max_via1=max({*max_element(d_plus_pos.begin(), d_plus_pos.end())-pos[j]+d[x]+c, *max_element(d_minus_pos.begin(), d_minus_pos.end())+pos[j]+d[x]+c});
                int64 max_via2=max({*max_element(d_plus_pos.begin(), d_plus_pos.end())-pos[i]+d[x]+c, *max_element(d_minus_pos.begin(), d_minus_pos.end())+pos[i]+d[x]+c});
                int64 best=min({max_normal, max_via1, max_via2});
                diam=max(diam, best);
            }
            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: 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