Submission #728453

#	Time	Username	Problem	Language	Result	Execution time	Memory
728453		beaconmc	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	2 ms	668 KiB

tickets

#include "tickets.h"

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)



long long find_maximum(int k, vector<vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> idk;
	FOR(i,0,n){
		vector<int> temp;
		FOR(j,0,m){
			temp.push_back(0);
		}
		idk.push_back(temp);
	}
	vector<ll> stuff;
	FOR(i,0,n){
		stuff.push_back(x[i][0]);
	}
	sort(stuff.begin(), stuff.end());
	ll med = n/2;
	ll ans = 0;
	for (auto&i : stuff){
		ans += abs(i - stuff[med]);
	}
	allocate_tickets(idk);
	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