Submission #1039649

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039649		amirhoseinfar1385	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	3 ms	6912 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1500+10;
long long n,m,all[maxn][maxn];
vector<vector<int>>res;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size();
	m = x[0].size();
	res.resize(n,vector<int>(m));
	vector<long long>suma;
	vector<pair<long long,pair<long long ,long long>>>allb;
	for(long long i=0;i<n;i++){
		for(long long j=0;j<m;j++){
			all[i][j]=x[i][j];
			res[i][j]=-1;
			suma.push_back(all[i][j]);
		}
		allb.push_back(make_pair(all[i][0],make_pair(all[i][m-1],i)));
	}
	sort(allb.begin(),allb.end());
	long long mainres=0;
	for(long long i=0;i<n;i++){
	//	cout<<i<<" "<<n/2<<" "<<suma[i]<<endl;
		if(i<n/2){
			mainres-=allb[i].first;
			res[allb[i].second.second][0]=0;
		}else{
			mainres+=allb[i].second.first;
			res[allb[i].second.second][m-1]=0;
		}
	}
	allocate_tickets(res);
	return mainres;
}

• 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