Submission #1207930

#TimeUsernameProblemLanguageResultExecution timeMemory
1207930shmaxCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms584 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 long long find_maximum(i32 k, std::vector<std::vector<i32>> x) { int n = x.size(); int m = x[0].size(); allocate_tickets(vec<vec<i32>>(n, vec<i32>(m, 0))); int S = 0; vec<int> t(n, 0); for (int i = 0; i < n; i++) { t[i] = x[i][0]; } sort(t.begin(), t.end()); for (int i = 0; i < n; i++) { if (i < n / 2) S -= t[i]; else S += t[i]; } 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...