Submission #827124

#	Time	Username	Problem	Language	Result	Execution time	Memory
827124		tomruk	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	1 ms	700 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
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;
	vector<int> tmp;
	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;
			}
		}
		tmp.push_back(x[i][0]);
		answer.push_back(row);
	}
	sort(tmp.begin(),tmp.end());
	long long sum = 0;
	for(int i = 0;i<n;i++){
		sum += abs(tmp[i] - tmp[n/2]);
	}
	allocate_tickets(answer);
	return sum;
}

• Subtask 1: 11 / 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