Submission #1078620

#TimeUsernameProblemLanguageResultExecution timeMemory
1078620juicyCarnival Tickets (IOI20_tickets)C++17
27 / 100
359 ms73260 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int>> x) { int n = x.size(), m = x[0].size(); vector<int> ord(n), lt(n), rt(n, m - 1); iota(ord.begin(), ord.end(), 0); vector a(n, vector<int>(m, -1)); long long res = 0; for (int t = 0; t < k; ++t) { sort(ord.begin(), ord.end(), [&](int u, int v) { return x[u][lt[u]] + x[u][rt[u]] < x[v][lt[v]] + x[v][rt[v]]; }); for (int i = 0; i < n / 2; ++i) { int u = ord[i]; res -= x[u][lt[u]]; a[u][lt[u]++] = t; } for (int i = n / 2; i < n; ++i) { int u = ord[i]; res += x[u][rt[u]]; a[u][rt[u]--] = t; } } allocate_tickets(a); 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...