Submission #800127

#	Time	Username	Problem	Language	Result	Execution time	Memory
800127		alvingogo	Carnival Tickets (IOI20_tickets)	C++14	27 / 100	408 ms	51648 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

typedef long long ll;
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<pair<int,int> > v;
	ll ret=0;
	vector<vector<int> > ans(n,vector<int>(m,-1));
	for(int i=0;i<n;i++){
		v.push_back({x[i][0]+x[i][m-1],i});
	}
	sort(v.begin(),v.end());
	for(int i=0;i<n/2;i++){
		ret-=x[v[i].sc][0];
		ans[v[i].sc][0]=0;
		ret+=x[v[i+n/2].sc][m-1];
		ans[v[i+n/2].sc][m-1]=0;
	}
	allocate_tickets(ans);
	return ret;
}

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