# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652071 | mychecksedad | Carnival Tickets (IOI20_tickets) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
void allocate_tickets(vector<vector<int>> _x);
long long find_maximum(int k, vector<vector<int>> _arr) {
vector<vector<ll>> arr (_arr.size());
for(int i = 0; i < _arr.size(); ++i){
for(int x: _arr[i]) arr[i].pb(x);
}
int n = arr.size();
int m = arr[0].size();
vector<vector<int>> answer;
vector<pair<ll, int>> a;
for (int i = 0; i < n; i++) {
std::vector<int> row(m, -1);
answer.push_back(row);
a.pb({arr[i][0] + arr[i][m - 1], i});
}
sort(all(a));
ll ans = 0;
for(int i = 0; i < n/2; ++i){
int x = a[n - i - 1].second, y = a[i].second;
ans += arr[x][1] - arr[y][0];
answer[x][m - 1] = 0;
answer[y][0] = 0;
}
allocate_tickets(answer);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |