제출 #1059207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059207		esomer	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	324 ms	73044 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = (int)x.size();
	int m = (int)x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	vector<pair<int, int>> rng(n, {0, m-1});
	ll res = 0;
	for(int r = 0; r < k; r++){
		vector<pair<int, int>> v(n);
		for(int i = 0; i < n; i++){
			v[i] = {x[i][rng[i].first] + x[i][rng[i].second], i};
			res -= x[i][rng[i].first];
		}
		sort(v.begin(), v.end());
		for(int i = n - 1; i >= n/2; i--){
			int ind = v[i].second;
			ans[ind][rng[ind].second] = r;
			rng[ind].second--;
			res += v[i].first;
		}
		for(int i = 0; i < n/2; i++){
			int ind = v[i].second;
			ans[ind][rng[ind].first] = r;
			rng[ind].first++;
		}
	}
	allocate_tickets(ans);
	return res;
}

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