제출 #625760

#제출 시각아이디문제언어결과실행 시간메모리
6257601neCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms212 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>

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