제출 #728428

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