Submission #800617

#	Time	Username	Problem	Language	Result	Execution time	Memory
800617		APROHACK	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	724 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int n, m, K;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size();
	m = x[0].size();
	K = k;
	std::vector<std::vector<int>> answer;
	vector<int>row;
	for(int i = 0 ; i < m ; i ++)row.pb(-1);
	for(int i  = 0 ; i < n ; i ++)answer.pb(row);
	ll ans = 0;
	for(int r = 0 ; r < k ; r ++){
		vector<ll>acum;
		for(int i = 0 ; i < n ; i ++){
			answer[i][r] = r;
			acum.pb(x[i][r]);
		}
		sort(acum.begin(), acum.end());
		
		for(int i = 0, j = n-1;  i < j; i ++, j--){\
			ans += acum[j] - acum[i];
		}
	}
	allocate_tickets(answer);
	return ans;
}

• 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