제출 #420166

#제출 시각아이디문제언어결과실행 시간메모리
420166Maqsut_03선물상자 (IOI15_boxes)C++14
0 / 100
1 ms204 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; long long ans = 0; long long delivery(int N, int K, int L, int p[]) { if(K == N) return min(p[N-1] + min(p[N-1], L - p[N-1]), L - p[0] + min(L - p[0], p[0])); if(K == 1) { for (int i=0; i<N; i++) ans += p[i] + min(p[i], L - p[i]); return ans; } return 0; }
#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...