Submission #1201838

#TimeUsernameProblemLanguageResultExecution timeMemory
1201838TriseedotCarnival Tickets (IOI20_tickets)C++20
27 / 100
498 ms51472 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define len(v) (int) (v.size()) #define all(v) v.begin(), v.end() using ll = long long; long long find_maximum(int k, vector<vector<int>> x) { int n = len(x); int m = len(x[0]); vector answer(n, vector(m, -1)); vector<int> ptr_l(n, 0), ptr_r(n, m - 1); vector<int> idx(n); iota(all(idx), 0ll); ll score = 0; for (int ki = 0; ki < k; ki++) { sort(all(idx), [&] (int i, int j) { return x[i][ptr_l[i]] + x[i][ptr_r[i]] < x[j][ptr_l[j]] + x[j][ptr_r[j]]; }); for (int i = 0; i < n / 2; i++) { int j = idx[i]; score -= x[j][ptr_l[j]]; answer[j][ptr_l[j]++] = ki; } for (int i = n / 2; i < n; i++) { int j = idx[i]; score += x[j][ptr_r[j]]; answer[j][ptr_r[j]--] = ki; } } allocate_tickets(answer); return score; }
#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...