Submission #1204866

#TimeUsernameProblemLanguageResultExecution timeMemory
1204866banganCarnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms328 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using i64 = long long; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); assert(m == 1); std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { answer.push_back({0}); } allocate_tickets(answer); i64 min = x[0][0], max = x[0][0]; for (int i = 0; i < n; i++) { min = std::min(min, i64(x[i][0])); max = std::max(max, i64(x[i][0])); } i64 mid = (max + min) / 2, S = 0; for (int i = 0; i < n; i++) { S += std::abs(x[i][0] - mid); } return S; }
#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...