제출 #405046

#제출 시각아이디문제언어결과실행 시간메모리
405046rainboyShortcut (IOI16_shortcut)C11
23 / 100
2047 ms288 KiB
#include "shortcut_c.h" #define N 1000000 #define INF 0x3f3f3f3f3f3f3f3f long long min(long long a, long long b) { return a < b ? a : b; } long long max(long long a, long long b) { return a > b ? a : b; } long long abs_(long long a) { return a > 0 ? a : -a; } long long find_shortcut(int n, int *ll, int *dd, int c) { static long long xx[N]; int i, j, k, l; long long d_, d; for (i = 1; i < n; i++) xx[i] = xx[i - 1] + ll[i - 1]; d_ = INF; for (i = 0; i < n; i++) for (j = i + 1; j < n; j++) { d = 0; for (k = 0; k < n; k++) for (l = k + 1; l < n; l++) d = max(d, dd[k] + dd[l] + min(abs_(xx[k] - xx[l]), abs_(xx[k] - xx[i]) + c + abs_(xx[j] - xx[l]))); d_ = min(d_, d); } return d_; }
#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...