제출 #301073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301073		luciocf	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	733 ms	60280 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long ll;

const int maxn = 1510;

int turno[maxn][maxn];
int ord[maxn];

ll find_maximum(int k, vector<vector<int>> x)
{
	int n = x.size();
	int m = x[0].size();

	for (int i = 0; i < n; i++)
	{
		memset(turno[i], -1, sizeof turno[i]);
		ord[i] = i;
	}

	sort(ord, ord+n, [&] (int a, int b) {return x[a][0]+x[a][m-1] > x[b][0]+x[b][m-1];});

	ll ans = 0;

	for (int i = 0; i < n/2; i++)
	{
		turno[ord[i]][m-1] = 0;
		ans += 1ll*x[ord[i]][m-1];
	}

	for (int i = n/2; i < n; i++)
	{
		turno[ord[i]][0] = 0;
		ans -= 1ll*x[ord[i]][0];
	}

	vector<vector<int>> S;
		
	for (int i = 0; i < n; i++)
	{
		vector<int> y;
		y.resize(m);
		
		for (int j = 0; j < m; j++)
			y[j] = turno[i][j];

		S.push_back(y);
	}

	allocate_tickets(S);
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10