# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399212 | daanolav | 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 <iostream>
#include <vector>
/*
2 3 2
0 2 5
1 1 3
*/
using namespace std;
#define INF 1<<29
#define MAXN 301
#define MAXM 301
typedef vector<int> vi;
typedef vector<vi> vvi;
int n,m,k,temp;
vvi x;
long find_maximum(int k, vvi x) {
return 1;
}
void allocate_tickets(vvi s) {
}
/*
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> k;
for(int i = 0; i < n; ++i) {
x.push_back(vi());
for(int j = 0; j < m; ++j) {
cin >> temp;
x[i].push_back(temp);
}
}
cout << find_maximum(k,x);
return 0;
}
*/