Submission #303215

#TimeUsernameProblemLanguageResultExecution timeMemory
303215limabeansCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms512 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    assert(m==1);
    vector<vector<int>> ans(n, vector<int>(k));
    for (int i=0; i<n; i++) {
	for (int j=0; j<k; j++) {
	    ans[i][j] = x[i][j];
	}
    }
    allocate_tickets(ans);
    return 1;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...