Submission #1291693

#TimeUsernameProblemLanguageResultExecution timeMemory
1291693lucaskojimaCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms840 KiB
#include "bits/stdc++.h" #include "tickets.h" #define sz(x) (int)size(x) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) using namespace std; using ll = long long; using pii = pair<int, int>; const char nl = '\n'; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3f; long long find_maximum(int k, vector<vector<int>> x) { int n = sz(x); int m = sz(x[0]); vector<int> a; for (int i = 0; i < n; i++) a.push_back(x[i][0]); sort(all(a)); long long ans = 0; for (int i = 0; i < n / 2; i++) ans -= a[i]; for (int i = n / 2; i < n; i++) ans += a[i]; vector pos(n, vector<int>(m)); for (int i = 0; i < n; i++) pos[i][0] = 0; allocate_tickets(pos); return ans; }
#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...