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 "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
ll find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> res;
res.resize(n);
for(int i = 0; i < n; i++) res[i].resize(m, -1);
vector<pii> v;
for(int i = 0; i < n; i++){
v.push_back({x[i][0] + x[i].back(), i});
}
sort(v.begin(), v.end());
int ans = 0;
for(int i = 0; i < n; i++){
if(i < n / 2){
ans -= x[v[i].second][0];
res[v[i].second][0] = 0;
}
else{
ans += x[v[i].second].back();
res[v[i].second][m - 1] = 0;
}
}
allocate_tickets(res);
return ans;
}
# | 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... |