제출 #826973

#제출 시각아이디문제언어결과실행 시간메모리
826973Supersonic선물상자 (IOI15_boxes)C++14
10 / 100
1 ms212 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; long long delivery(int n, int k, int l, int p[]) { if(k==1){ ll t=0; for(int i=0;i<n;i++){ //t+=p[i]; t+=2*min(p[i],l-p[i]); } return t; } if(k==n){ ll t=0; for(int i=0;i<n;i++){ //t+=p[i]; t+=2*min(p[i],l-p[i]); } return min(t,(ll)l); } 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...