# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091663 | efishel | Carnival Tickets (IOI20_tickets) | C++17 | 2 ms | 860 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 "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using ii = pair <ll, ll>;
using vii = vector <ii>;
using vi = vector <int>;
using vvi = vector <vi>;
ll find_maximum (int k, vvi x) {
ll n = x.size(), m = x[0].size();
vll l(n, 0), r(n, m-1);
vvi answer(n, vi(m, -1));
vector <pair <ll, ii> > th;
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
th.push_back({ x[i][j], { i, j }});
}
}
ll ans = 0;
sort(th.rbegin(), th.rend());
vector <vll> is1(n, vll{}), is0(n, vll{});
ll off = 0;
for (ll idk = 0; idk < k*n/2+off; idk++) {
auto [i, j] = th[idk].second;
if (is1[i].size() == k) { off++; continue; }
is1[i].push_back(j);
ans += th[idk].first;
}
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... |