Submission #421608

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