제출 #1028461

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