Submission #569067

#TimeUsernameProblemLanguageResultExecution timeMemory
569067StickfishCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms212 KiB
#include "tickets.h" #include <vector> #include <algorithm> using namespace std; using ll = long long; ll find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> ansarr; ll ans = 0; if (m == 1) { ansarr.push_back(vector<int>(n)); for (int i = 0; i < n; ++i) ansarr[0][i] = x[i][0]; vector<int> v = ansarr[0]; sort(v.begin(), v.end()); int d = v[n / 2]; for (int i = 0; i < n; ++i) ans += abs(d - v[i]); } allocate_tickets(ansarr); 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...
#Verdict Execution timeMemoryGrader output
Fetching results...