제출 #1136960

#제출 시각아이디문제언어결과실행 시간메모리
1136960owoovoShortcut (IOI16_shortcut)C++20
0 / 100
0 ms320 KiB
#include "shortcut.h" #include<bits/stdc++.h> #define ll long long #define F first #define S second using namespace std; const ll maxn=1e18; ll pre[110],l[110],d[110],c; ll absll(ll a){ return max(a,-a); } ll find_shortcut(int n, vector<int> L, vector<int> D, int C){ c=C; for(int i=2;i<=n;i++){ l[i]=L[i-2]; pre[i]=pre[i-1]+l[i]; } for(int i=1;i<=n;i++){ d[i]=D[i-1]; } ll ans=maxn; for(int i=1;i<=n;i++){ for(int j=i+1;j<=n;j++){ ll dia=0; for(int l=1;l<=n;l++){ for(int r=l+1;r<=n;r++){ dia=max(dia,min(pre[r]-pre[l],absll(pre[r]-pre[j])+absll(pre[l]-pre[i]))+d[l]+d[r]); } } ans=min(ans,dia); } } 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
      |         ^~~~
#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...