Submission #364032

#TimeUsernameProblemLanguageResultExecution timeMemory
364032wind_reaperCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms364 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> ans(n, vector<int>(m)); long long a = 0, median = x[n/2][0]; for(int i = 0; i < n; i++){ ans[i][0] = 1; a += abs(x[i][0] - median); } allocate_tickets(ans); return a; }
#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...