제출 #730428

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

tickets

#include "tickets.h"

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)

ll dp[1501][1501];
ll nextt[1501][1501];
ll maxi = -1;
ll mini = -1;

bool comp(vector<ll> a, vector<ll> b){
	ll A = abs(a[0]);
	ll B = abs(b[0]);

	return min(abs(A-mini), abs(A-maxi)) < min(abs(B-mini), abs(B-maxi));
}

long long find_maximum(int k, vector<vector<int>> x) {

	ll n = x.size();
	ll m = x[0].size();

	vector<vector<int>> assigns;  
	 FOR(i,0,n){
    	vector<int> temp;
    	FOR(j,0,m) temp.push_back(-1);
    	assigns.push_back(temp);
    }

	vector<vector<ll>> orders;
	vector<vector<ll>> minmax;
	FOR(i,0,n){
		minmax.push_back({0,0});
	}
	FOR(i,0,n){
		FOR(j,0,m){
			orders.push_back({x[i][j], i});
		}
	}
	sort(orders.begin(), orders.end());
	mini = orders[0][0];
	maxi = orders[orders.size()-1][0];

	FOR(i,0,n*m/2) orders[i][0] = -orders[i][0];

	sort(orders.begin(), orders.end(), comp);

	ll bot = 0;
	ll top = 0;
	FOR(i,0,n*m){
		ll ind = orders[i][1];
		bool plus = (orders[i][0] > 0);
		//cout << ind <<" " << plus << endl;

		if (plus){
			if (minmax[ind][0]+minmax[ind][1] < k && top < n*k/2){
				minmax[ind][1] += 1;
				top += 1;
			}
		}else{
			if (minmax[ind][0]+minmax[ind][1] < k && bot < n*k/2){
				minmax[ind][0] += 1;
				bot += 1;
			}
		}
	}

	vector<vector<ll>> q;

	for (auto&i : minmax) q.push_back(i);
	FOR(i,0,n) q[i].push_back(i);
	ll ans = 0;

	ll cur = 0;

	while (q[0][0] + q[0][1] > 0){
		sort(q.begin(), q.end());
		reverse(q.begin(), q.end());


		FOR(i,0,n/2){

			assigns[q[i][2]][q[i][0]-1] = cur;
			q[i][0] -= 1;
			ans -= x[q[i][2]][q[i][0]];
		}
		FOR(i,n/2,n){

			assigns[q[i][2]][m-q[i][1]] = cur;
			ans += x[q[i][2]][m-q[i][1]];
			q[i][1] -= 1;
		}

		cur++;
	}


	allocate_tickets(assigns);
	return ans;






}

• 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