Submission #337267

#	Time	Username	Problem	Language	Result	Execution time	Memory
337267		Register	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	974 ms	72084 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> vvec;
const int N=1505;
int n,m,d[N],s[N];
ll sum;
vector<pair<int,int> > v,l;
void allocate_tickets(vvec x);
ll find_maximum(int k,vvec x){
	n=x.size();m=x[0].size();
	vvec ans(n,vec(m,-1));
	for(int i=0;i<n;i++)
		for(int j=0;j<k;j++) {sum+=x[i][m-1-j];v.push_back(make_pair(x[i][j]+x[i][m-k+j],i));}
	sort(v.begin(),v.end());
	for(int i=0;i<n*k/2;i++) {sum-=v[i].fi;d[v[i].se]++;}
	for(int i=0;i<n;i++){
		l.clear();
		for(int j=0;j<k;j++) l.push_back(make_pair(s[j],j));
		sort(l.begin(),l.end());
		for(int j=0;j<k;j++)
			if(j<d[i]) {ans[i][j]=l[j].se;s[l[j].se]++;}
			else ans[i][m-k+j]=l[j].se;
	}
	allocate_tickets(ans);return sum;
}

• 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