Submission #423031

#TimeUsernameProblemLanguageResultExecution timeMemory
423031peijar카니발 티켓 (IOI20_tickets)C++17
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> using namespace std; #include "tickets.h" long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> answer(n, vector<int>(m, -1)); if (m == 1) { assert(k == 1); vector<int> elements; for (int i(0); i < n; ++i) { answer[i][0] = 0; elements.push_back(x[i][0]); } allocate_tickets(answer); int ans = 0; sort(elements.begin(), elements.end()); int mid = elements[n / 2]; for (int v : elements) ans += abs(mid - v); return ans; } allocate_tickets(answer); return 1; }
#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...