Submission #1305353

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305353		neonglitch	카니발 티켓 (IOI20_tickets)	C++20	11 / 100	1 ms	836 KiB

tickets

#include "tickets.h"
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	
	std::vector<std::vector<int>> answer(n,vector<int>(m,-1));
	ll ans=0;
	vector<pair<ll,int>> pos;

	for(int i=0;i<n;i++)
	{
		for(int j=0;j<k;j++)
		{
			ans-=x[i][j];
			answer[i][j]=j;
			pos.push_back({x[i][j]+x[i][m-k+j],i});
		}
	}
	sort(rbegin(pos),rend(pos));
	for(int i=0;i<(n*k)/2;i++)
	{
		ans+=pos[i].first;
	}
	allocate_tickets(answer);
	return ans;
}

// int main()
// {
	// int n,m,k;
	// cin>>n>>m>>k;
	// vector<vector<int>> x(n,vector<int>(m));
	// for(int i=0;i<n;i++)
	// {
		// for(int j=0;j<m;j++)
		// {
			// cin>>x[i][j];
		// }
	// }
	// cout<<find_maximum(k,x)<<endl;
// }

• 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