Submission #1041912

#TimeUsernameProblemLanguageResultExecution timeMemory
1041912MarwenElarbi카니발 티켓 (IOI20_tickets)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<std::vector<int>> ans(n,vector<int> (m,0));
	for (int i = 0; i < n; i++) {
		ans[i][0]=1;
	}
	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...