Submission #1155198

#TimeUsernameProblemLanguageResultExecution timeMemory
1155198aarb_.tomatexdBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms400 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll delivery(int N, int K, int L, int positions[]) { vector<ll> cw, acw; for (int i = 0; i < N; i++) { int pos = positions[i]; if (pos == 0) continue; if (pos <= L - pos) cw.push_back(pos); else acw.push_back(L - pos); } sort(cw.begin(), cw.end(), greater<ll>()); sort(acw.begin(), acw.end(), greater<ll>()); ll cost = 0; for (int i = 0; i < cw.size(); i += K) cost += 2LL * cw[i]; for (int i = 0; i < acw.size(); i += K) cost += 2LL * acw[i]; return cost; }
#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...