Submission #1191137

#TimeUsernameProblemLanguageResultExecution timeMemory
1191137anmattroi카니발 티켓 (IOI20_tickets)C++17
0 / 100
0 ms328 KiB
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size(), m = x[0].size();
	vector<vector<int> > ans(n, vector<int>(m, -1));

    for (int i = 0; i < k; i++) ans[i][0] = i;
	allocate_tickets(ans);
	return 0;
}

#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...