Submission #364045

#TimeUsernameProblemLanguageResultExecution timeMemory
364045b23vBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms492 KiB
#include "boxes.h" #include <iostream> #include <vector> #include <algorithm> #include <set> #include <map> #include <climits> #include <cstring> using namespace std; using ll = long long; using ull = unsigned long long; using vi = vector<int>; using ii = pair<int,int>; using vii = vector<pair<int,int>>; using vb = vector<bool>; template<typename T> using Graph = vector<vector<T>>; ll delivery(int n, int K, int L, int p[]) { if(K != 1) abort(); ll ans = 0; for(int i = 0; i < n; ++i) { ans += 2LL * min(p[i], L - p[i]); } 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...