Submission #386020

#	Time	Username	Problem	Language	Result	Execution time	Memory
386020		AdOjis485	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	364 KiB

tickets

#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(k, vector<int> (n));

	for(int i = 0; i < n; i ++)
	{
		for(int j = 0; j < m; j ++)
		{
			answer[j][i] = x[i][j];
		}
	}
	allocate_tickets(answer);
	return 1;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10