제출 #304524

#제출 시각아이디문제언어결과실행 시간메모리
304524Leonardo_PaesCarnival Tickets (IOI20_tickets)C++17
0 / 100
0 ms256 KiB
#include "tickets.h"
#include <vector>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer;
	for(int i=0; i<n; i++){
		vector<int> row(m);
		for (int j=0; j<m; j++) {
			row[j] = 1;
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	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...