Submission #1059077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059077		Lalic	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	700 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, 0));
	
	vector<ll> proc;
	for(int i=0;i<n;i++)
		proc.pb(x[i][0]);
	
	sort(all(proc));
	
	ll res=0;
	for(int i=0;i<n/2;i++) res+=(proc[n/2]-proc[i]);
	for(int i=n/2;i<n;i++) res+=(proc[i]-proc[n/2]);
	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