Submission #779184

#TimeUsernameProblemLanguageResultExecution timeMemory
779184JosiaCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms468 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define int long long int find_maximum(signed k, std::vector<std::vector<signed>> x) { int m = x.size(); int n = x[0].size(); int res = 0; assert(m == 1); vector<signed> vals = x[0]; sort(vals.begin(), vals.end()); int med = vals[n/2]; for (int i: vals) res += abs(i-med); vector<vector<signed>> cards(m, vector<signed>(n)); for (int i=0; i<n; i++) { cards[0][0] = 0; } allocate_tickets(cards); 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...