제출 #302653

#제출 시각아이디문제언어결과실행 시간메모리
302653jwvg0425카니발 티켓 (IOI20_tickets)C++17
0 / 100
1 ms384 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++)
		{
			if (j < k)
			{
				row[j] = j;
			}
			else
			{
				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...