제출 #428366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428366		egekabas	카니발 티켓 (IOI20_tickets)	C++14	41 / 100	771 ms	53316 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<int> beg(n), fin(n), sum(n);
	for(int i = 0; i < n; ++i){
		beg[i] = 0;
		fin[i] = m-1;
		for(int j = 0; j < m; ++j)
			sum[i] += x[i][j];
	}
	vector<vector<int>> ret(n, vector<int>(m, -1));
	ll ans = 0;
	for(int round = 0; round < k; ++round){
		vector<pair<pii, int>> vec;
		for(int i = 0; i < n; ++i)
			vec.pb({{x[i][beg[i]] + x[i][fin[i]], sum[i]}, i});
		sort(all(vec), greater<pair<pii, int>>());
		for(int i = 0; i < n; ++i){
			int idx = vec[i].ss;
			if(i < n/2){
				ans += x[idx][fin[idx]];
				ret[idx][fin[idx]] = round;
				sum[idx] -= x[idx][fin[idx]];
				--fin[idx];
			}
			else{
				ans -= x[idx][beg[idx]];
				ret[idx][beg[idx]] = round;
				sum[idx] -= x[idx][beg[idx]];
				++beg[idx];
			}
		}
	}
	allocate_tickets(ret);
	return ans;
}

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