Submission #1030450

#TimeUsernameProblemLanguageResultExecution timeMemory
1030450HappyCapybaraCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms704 KiB
#include "tickets.h" #include<bits/stdc++.h> using namespace std; #define ll long long ll find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<int> v; vector<vector<int>> answer(n, vector<int>(m, -1)); for (int i=0; i<n; i++){ answer[i][0] = 0; v.push_back(x[i][0]); } sort(v.begin(), v.end()); ll res = 0; for (int i=0; i<n; i++) res += abs(x[i][0]-v[v.size()/2]); allocate_tickets(answer); return res; }
#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...