Submission #1043109

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043109		MarwenElarbi	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	1112 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
#define pb push_back
#define se second
#define fi first
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	long long n = x.size();
	int m = x[0].size();
	vector<vector<long long>> y(n,vector<long long> (m));
	vector<vector<int>> ans(n,vector<int> (m,-1));
	priority_queue<pair<long long,int>> pq;
	long long res=0;
	for (int i = 0; i < n; ++i)
	{
		for (int j = 0; j < m; ++j)
		{
			y[i][j]=x[i][j];
		}
	}
	for (int i = 0; i < n; ++i)
	{
		for (int j = 0; j < k; ++j)
		{
			res-=y[i][j];
		}
	}
	int l[n];
	int r[n];
	for (int i = 0; i < n; ++i)
	{
		l[i]=k-1;
		r[i]=m-1;
		pq.push({y[i][l[i]--]+y[i][r[i]--],i});
	}
	for (int i = 0; i < k*n/2; ++i)
	{
		auto cur=pq.top();
		res+=cur.fi;
		pq.pop();
		if(l[cur.se]==-1||r[cur.se]==m-k-1) continue;
		pq.push({y[cur.se][l[cur.se]--]+y[cur.se][r[cur.se]--],cur.se});
	}
	for (int i = 0; i < n; ++i)
	{
		int cnt=0;
		for (int j = 0; j <= l[i]; ++j)
		{
			ans[i][j]=cnt++;
		}
		for (int j = r[i]+1; j < m; ++j)
		{
			ans[i][j]=cnt++;
		}
	}
	allocate_tickets(ans);
	return res;
}

• 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