제출 #1050227

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
#define int long long
	int n = x.size();
	int m = x[0].size();
	vector<pair<int,int>> s(n);
	vector<int> all;
	for(int i = 0;i<n;i++) {
		s[i] = pair{0, m-1};
		for(int j:x[i])all.push_back(j);
	}
	sort(all.begin(), all.end());
	int med = all[(int)all.size()/2];
	vector<int> cnt(n);
	long long sum=0;
	for(int i = 0;i<n;i++) {
		for(int j:x[i]) {
			if(j <= med) {
				sum-=j;
				cnt[i]++;
			}
			else sum+=j;
		}
	}
	vector<vector<int32_t>> res(n, vector<int32_t>(m, -1));
	for(int _ = 0;_<m;_++) {
		vector<int> idxs(n);
		iota(idxs.begin(), idxs.end(), 0);
		sort(idxs.begin(), idxs.end(), [&](int a, int b) -> bool {
			return cnt[a] < cnt[b];
		});
		vector<int> ans;
		for(int i = 0;i<n/2;i++) {
			res[idxs[i]][s[idxs[i]].second--]=_;
		}
		for(int i = n/2;i<n;i++) {
			assert(cnt[idxs[i]]);
			cnt[idxs[i]]--;
			res[idxs[i]][s[idxs[i]].first++]=_;
		}
	}
	allocate_tickets(res);
#undef int
	return sum;
}

• 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