제출 #414133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414133		cfalas	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	3 ms	812 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	vector<vi> answer(n);
	answer.assign(n, vector<int>(x[0].size(), -1));
	vii maxa, mina;
	FOR(i,n){
		maxa.push_back({ - *max_element(x[i].begin(), x[i].end()), i});
		mina.push_back({*min_element(x[i].begin(), x[i].end()), i});
	}
	sort(maxa.begin(), maxa.end());
	sort(mina.begin(), mina.end());

	ll ans1=0, ans2=0;

	set<int> maus, mius;
	FOR(i,n/2) ans1-=maxa[i].F, maus.insert(maxa[i].S);
	FOR(i,n) if(!maus.count(i)) ans1 -= *min_element(x[i].begin(), x[i].end());

	FOR(i,n/2) ans2-=mina[i].F, mius.insert(mina[i].S);
	FOR(i,n) if(!mius.count(i)) ans2 += *max_element(x[i].begin(), x[i].end());
	

	FOR(i,n){
		int targ;
		if((ans1>=ans2 && maus.count(i)) || (ans1<ans2 && !mius.count(i)))
			targ = *max_element(x[i].begin(), x[i].end());
		else targ = *min_element(x[i].begin(), x[i].end());
		FOR(j,x[0].size()) if(x[i][j]==targ) answer[i][j] = 0;
	}


	allocate_tickets(answer);
	return max(ans1, ans2);
}

• Subtask 1: 11 / 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