Submission #603475

#	Time	Username	Problem	Language	Result	Execution time	Memory
603475		Tigryonochekk	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	1 ms	300 KiB

tickets

#include <iostream>
#include "tickets.h"
#include <vector>
using namespace std;

vector<vector<int>> answer;

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

• 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