제출 #1063675

#제출 시각아이디문제언어결과실행 시간메모리
1063675HappyCapybaraShortcut (IOI16_shortcut)C++17
31 / 100
2041 ms596 KiB
#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, 0ll); for (int i=1; i<n; i++) ps[i] = ps[i-1]+(ll) l[i-1]; ll bsf = pow(10, 16); for (int i=0; i<n-1; i++){ for (int j=i+1; j<n; j++){ ll wsf = 0ll; for (int x=0; x<n-1; x++){ for (int y=x+1; y<n; y++){ ll dist = min(ps[y]-ps[x], abs(ps[x]-ps[i])+abs(ps[y]-ps[j])+(ll) c)+(ll) d[x]+(ll) d[y]; wsf = max(wsf, dist); } } bsf = min(bsf, wsf); } } return bsf; }
#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...