Submission #837224

#TimeUsernameProblemLanguageResultExecution timeMemory
837224KemalKCarnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms596 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> typedef long long int ll; using namespace std; long long find_maximum(int k, vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector <vector <int>> ans(n, vector <int> (m, -1)); // m = 1 ll sum = 0; // cout << "x: " << x[n/2][0] << "\n"; for (int i = 0; i < k; i++){ vector <int> ticket; for (int j = 0; j < n; j++){ ticket.push_back(x[j][0]); } sort(ticket.begin(), ticket.end()); for (int j = 0; j < n; j++){ sum += abs(ticket[n/2] - ticket[j]); } for (int j = 0; j < n; j++){ ans[j][0] = i; } } // cout << "allocate" << "\n"; allocate_tickets(ans); return sum; }
#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...