Submission #1017839

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017839		nickolasarapidis	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	860 KiB

tickets

/*
	IOI 2020
	Day 1 - problem 3 (tickets)
	Author: Nickolas Arapidis
*/
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define F first
#define S second
#define MP make_pair

ll calculate_score(vector<int> A){
	int N = A.size();

	ll sum = 0;

	int mid = A[N/2];

	for(int i = 0; i < N; i++){
		sum += abs(A[i] - mid);
	}

	return sum;
}

ll find_maximum(int k, vector<vector<int>> X){
	ll ans = 0;

	int N = X.size(); // Ammount of colors
	int M = X[0].size(); // Ammount of tickets for each color

	vector<int> s(M, -1);
	vector<vector<int>> S(N, s);

	vector<int> large;
	vector<int> small;
	vector<int> A;
	vector<pair<int, int> > B(N, {0, 0});

	for(int i = 0; i < k; i++){
		large.clear();
		small.clear();
		A.clear();

		map<int, pair<int, int> > l;
		map<int, pair<int, int> > s;

		for(int j = 0; j < N; j++){
			large.push_back(X[j][(M - 1) - B[j].S]);
			small.push_back(X[j][0 + B[j].F]);
			l[large.back()] = MP(j, (M - 1) - B[j].S);
			s[small.back()] = MP(j, 0 + B[j].F);
		}

		sort(large.begin(), large.end());
		sort(small.begin(), small.end());

		for(int j = 0; j < N/2; j++){
			A.push_back(small[j]);
			S[s[A.back()].F][s[A.back()].S] = i;
			B[s[A.back()].F].F++;
		}

		for(int j = N/2; j < N; j++){
			A.push_back(large[j]);
			S[l[A.back()].F][l[A.back()].S] = i;
			B[s[A.back()].F].S++;
		}

		ans += calculate_score(A);
	}

	allocate_tickets(S);

	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