제출 #603871

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

tickets

#include "tickets.h"
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
using ll = long long;
ll n, m;
long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	m = x[0].size();
	vector<vector<int>>anss(n, vector<int>(m, -1));
	vector<set<pair<ll, int>>> v(n);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			v[i].insert({ x[i][j], j });
		}
	}
	ll ans = 0;
	for (int i = 0; i < k; i++)
	{
		vector<ll> q;
		for (int j = 0; j < n/2; j++)
		{
			q.push_back(v[i].begin()->first);
			anss[j][v[i].begin()->second] = i;
			v[i].erase(v[i].begin());
		}
		for (int j = n/2; j < n; j++)
		{
			q.push_back((--v[i].end())->first);
			anss[j][(--v[i].end())->first] = i;
			v[i].erase(--v[i].end());
		}
		for (int j = 0; j < n; j++)
		{
			ans += abs(q[j] - q[n / 2]);
		}
	}
	allocate_tickets(anss);
	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