제출 #1168817

#제출 시각아이디문제언어결과실행 시간메모리
1168817HappyCapybara선물상자 (IOI15_boxes)C++17
100 / 100
428 ms170944 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; #define ll long long ll delivery(int N, int K, int L, int p[]) { vector<ll> l, r; for (int i=0; i<N; i++){ if (p[i] <= L/2) l.push_back(p[i]); else r.push_back(L-p[i]); } reverse(r.begin(), r.end()); vector<ll> lc(K+1, 0), rc(K+1, 0); for (int i=0; i<=K; i++){ for (int j=l.size()-i-1; j>=0; j-=K) lc[i] += 2*l[j]; for (int j=r.size()-i-1; j>=0; j-=K) rc[i] += 2*r[j]; } ll res = lc[0]+rc[0]; for (int i=0; i<=K; i++) res = min(res, L+lc[i]+rc[K-i]); return res; }
#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...