# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302593 | aljasdlas | Carnival Tickets (IOI20_tickets) | C++14 | 0 ms | 0 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 <vector>
#include <bits/stdc++.h>
using namespace std;
#define int long long
long long find_maximum(signed k, vector<vector<signed>> x) {
vector<vector<signed>> answer;
int n = x.size();
int m = x[0].size();
// vector<pair<int,int>> v;
// for(int i = 0; i < n; i++) {
// v.push_back({x[i], i});
// }
// sort(v.begin(), v.end());
// for(int i = 0; i < n)
for (int i = 0; i < n; i++) {
vector<int> row(m);
for (int j = 0; j < m; j++) {
if (j < k) {
row[j] = j;
} else {
row[j] = -1;
}
}
answer.push_back(row);
}
allocate_tickets(answer);
return 1;
}