Submission #1208036

#TimeUsernameProblemLanguageResultExecution timeMemory
1208036shmaxCarnival Tickets (IOI20_tickets)C++17
27 / 100
313 ms51336 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; template<typename T> using vec = vector<T>; #define i32 int32_t #define int long long #define len(x) ((int)(x).size()) long long find_maximum(i32 k, std::vector<std::vector<i32>> x) { int n = x.size(); int m = x[0].size(); vec<vec<i32>> d(n, vec<i32>(m, -1)); // allocate_tickets(vec<vec<i32>>(n, vec<i32>(m, 0))); int S = 0; vec<pair<int, int>> deltas; for (int i = 0; i < n; i++) { d[i][len(d[i]) - 1] = 0; S += x[i].back(); deltas.emplace_back(-x[i].back() - x[i][0], i); } sort(deltas.rbegin(), deltas.rend()); for (int t = 0; t < n / 2; t++) { auto [xy, i] = deltas[t]; d[i][len(d[i]) - 1] = -1; d[i][0] = 0; S += xy; } allocate_tickets(d); 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...