Submission #603541

#TimeUsernameProblemLanguageResultExecution timeMemory
603541TigryonochekkCarnival Tickets (IOI20_tickets)C++17
11 / 100
3 ms700 KiB
#include <iostream> #include <algorithm> #include "tickets.h" #include <vector> #define ll long long using namespace std; const ll inf = 1e18 + 69; vector<vector<int>> answer; ll ans; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); answer.resize(n); for (int i = 0; i < n; i++) answer[i].resize(m); if (m == 1) { vector<int> v; for (int i = 0; i < n; i++) { v.push_back(x[i][0]); } sort(v.begin(), v.end()); ll b = v[n / 2]; for (int i = 0; i < n; i++) { ans += abs(b - v[i]); } } allocate_tickets(answer); 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...