제출 #302604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302604		aljasdlas	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

#define int long long
long long find_maximum(signed k, vector<vector<signed>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<signed>> answer(n, vector<signed>(m));

	// vector<pair<int,int>> v;
	// for(int i = 0; i < n; i++) {
		// v.push_back({x[i], i});
	// }
	// sort(v.begin(), v.end());
	// for(int i = 0; i < n)

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (j < k) {
				answer[i][j] = j;
			} else {
				answer[i][j] = -1;
			}
		}
	}
	allocate_tickets(answer);

	vector<vector<int>> rounds(k);
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			if(answer[i][j] != -1)
				rounds[answer[i][j]].push_back(x[i][j]);
	int ans = 0;
	for(int i = 0; i < k; i++) {
		if(rounds[i].empty()) continue;
		int idx = rounds[i].size()/2;
		if(rounds[i].size()%2)
			for(auto x: rounds[i])
				ans += abs(x - rounds[i][idx]);
		else
			for(auto x: rounds[i])
				ans += abs(x - (rounds[i][idx]+rounds[i][idx-1])/2);
	}
	return ans;
}

• 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