Submission #320387

#	Time	Username	Problem	Language	Result	Execution time	Memory
320387		tigicha	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1000 ms	60772 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
long long l, x, y, a[500005], sum, n, m;
set<pair<int, int> >s;
vector<vector<int> >answer;
vector<int>vec;
long long find_maximum(int k, vector<vector<int> >v){
	n=v.size();
	m=v[0].size();
	for(int i=0; i<n; i++){
	    for(int j=m-k; j<m; j++)
	    sum+=v[i][j];
	    s.insert({v[i][m-k]+v[i][0], i});
	}
	for(int i=1; i<=(k*n)/2; i++){
	    l=(*s.begin()).second;
	    sum-=(*s.begin()).first;
	    s.erase(*s.begin());
	    a[l]++;
	    if(a[l]<k) s.insert({v[l][m-k+a[l]]+v[l][a[l]], l});
	}
	for(int i=0; i<n; i++){
		vec.clear();
		for(int j=0; j<a[i]; j++){
			vec.push_back(x);
			x=(x+1)%k;
		}
		for(int j=a[i]; j<m-k+a[i]; j++)
		vec.push_back(-1);
		y=x;
		for(int j=m-k+a[i]; j<m; j++){
		    vec.push_back(y);
		    y=(y+1)%k;
		}
		answer.push_back(vec);
	}
	allocate_tickets(answer);
	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