제출 #1230315

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

tickets

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

#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

long long find_maximum(int k, vector<vector<int> > x){
	int n=x.size(), m=x[0].size();
	for (int i=0; i<n; ++i)sort(x[i].begin(), x[i].end());
	vector<pii> ord;
	vector<vector<int> > ans(n, vector<int>(m));
	for (int i=0; i<m; ++i){
		vector<int> temp;
		for (int j=0; j<n; ++j)temp.pb(x[j][i]);
		sort(temp.begin(), temp.end());
		int sum=0;
		for (auto a:temp)sum+=abs(a-temp[n/2]);
		ord.pb(mp(sum, i));
	}
	sort(ord.begin(), ord.end(), greater<pii>());
	int res=0;
	for (int i=0; i<m; ++i){
		if (i<k)res+=ord[i].fi;
		for (int j=0; j<n; ++j)ans[j][i]=x[j][ord[i].se];
	}
	allocate_tickets(ans);
	return res;
}

• 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