Submission #302655

#	Time	Username	Problem	Language	Result	Execution time	Memory
302655		jwvg0425	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	2 ms	768 KiB

tickets

#include "tickets.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template <typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

i64 find_maximum(int k, vector<vector<int>> x)
{
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++)
	{
		vector<int> row(m);
		for (int j = 0; j < m; j++)
		{
			if (j < k)
			{
				row[j] = j;
			}
			else
			{
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);

	i64 result = 0;

	vector<int> color;
	for (int i = 0; i < n; i++)
		color.push_back(x[i][0]);

	sort(all(color));

	for (int i = 0; i < n; i++)
		result += abs(color[i] - color[n / 2]);

	return result;
}

• 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