# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
592907 | AQT | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 340 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;
/*
void allocate_tickets(vector<vector<int>> arr) {
for(auto v : arr) {
for(auto n : v) {
cout << n << " ";
}
cout << "\n";
}
}
*/
long long find_maximum(int K, vector<vector<int>> arr) {
int N = arr.size();
int M = arr[0].size();
int G = M - K;
long long ans = 0;
vector<vector<int>> ret;
vector<vector<int>> typ;
ret.resize(N);
typ.resize(N);
priority_queue<pair<int, pair<int, int>>> pq;
for(int i = 0; i < N; i++) {
ret[i].resize(M, -1);
typ[i].resize(M);
for(int j = M - 1; j >= M - K; j--) {
# | 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... |