Submission #1190044

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190044		Zbyszek99	Carnival Tickets (IOI20_tickets)	C++20	100 / 100	669 ms	100952 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int less_cnt[1501];
vi less_elms[1501];
vi greater_elms[1501];

ll find_maximum(int k, vector<vi> x) 
{
	ll ans = 0;
	int n = siz(x);
	int m = siz(x[0]);
	vector<vi> used(n,vi(m,0));
	rep(i,n)
	{
		rep2(j,m-k,m-1)
		{
			ans += x[i][j];
			used[i][j] = 1;
		}
	}
	vector<pair<ll,pii>> changes_sort;
	rep(i,n)
	{
		rep(j,k)
		{
			changes_sort.pb({-x[i][j] - x[i][m-k+j],{i,-j}});
		}
	}
	sort(all(changes_sort));
	reverse(all(changes_sort));
	rep(i,(n*k)/2)
	{
		ans += changes_sort[i].ff;
		less_cnt[changes_sort[i].ss.ff]++;
		used[changes_sort[i].ss.ff][m-k-changes_sort[i].ss.ss] = 0;
		used[changes_sort[i].ss.ff][-changes_sort[i].ss.ss] = -1;
	}
	vector<vi> answer(n,vi(m,-1));
	rep(i,n)
	{
		rep(j,m)
		{
			if(used[i][j] == 1) greater_elms[i].pb(j);
			if(used[i][j] == -1) less_elms[i].pb(j);
		}
	}
	rep(r,k)
	{
		vector<pii> sort_;
		rep(i,n)
		{
			sort_.pb({less_cnt[i],i});
		}
		sort(all(sort_));
		rep(i,n/2)
		{
			answer[sort_[i].ss][greater_elms[sort_[i].ss].back()] = r;
			greater_elms[sort_[i].ss].pop_back();
		}
		rep2(i,n/2,n-1)
		{
			answer[sort_[i].ss][less_elms[sort_[i].ss].back()] = r;
			less_elms[sort_[i].ss].pop_back();
			less_cnt[sort_[i].ss]--;
		}
	}
	allocate_tickets(answer);
	return ans;
}

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