제출 #822399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
822399		Username4132	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	617 ms	178808 KiB

tickets

#include "tickets.h"
#include<iostream>
#include <vector>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define PB push_back
#define F first
#define S second

const int MAXN = 1510;
int n, m;
set<pii> wii[MAXN];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = (int)x.size();
	m = (int)x[0].size();

	ll ret=0;
	vector<vector<int>> ans(n, vector<int>(m, -1));
	forn(i, n){
		vector<pii> tem(m);
		forn(j, m) tem[j] = {x[i][j], j};
		set<pii> tmp(tem.begin(), tem.end());
		swap(wii[i], tmp);
	}

	forn(tur, k){
		ll sum = 0;
		vector<pii> obt(n);
		forn(i, n) sum-=wii[i].begin()->F;
		forn(i, n) obt[i] = {wii[i].begin()->F + wii[i].rbegin()->F, i};
		sort(obt.begin(), obt.end(), greater<pii>());
		forn(i, (n>>1)){
			sum+=obt[i].F;
			ans[obt[i].S][wii[obt[i].S].rbegin()->S] = tur;
			wii[obt[i].S].erase(prev(wii[obt[i].S].end()));
		}
		forsn(i, (n>>1), n){
			ans[obt[i].S][wii[obt[i].S].begin()->S] = tur;
			wii[obt[i].S].erase(wii[obt[i].S].begin());
		}
		ret+=sum;
	}
	allocate_tickets(ans);
	return ret;
}

• 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