제출 #1073747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073747		Joshua_Andersson	Teams (IOI15_teams)	C++14	34 / 100	4056 ms	24672 KiB

teams

#include "teams.h"

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

typedef long long ll;
const ll linf = ll(1e18);

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)

#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif

int n;
vi a;
vi b;
void init(int N, int A[], int B[])
{
	n = N;
	a.resize(N);
	b.resize(N);
	rep(i, N) a[i] = A[i], b[i] = B[i];
}

int can(int m, int K[]) {
	vi k(m);
	rep(i, m) k[i] = K[i];

	sort(all(k));

	priority_queue<p2> waiting;
	rep(i, n)
	{
		waiting.emplace(-a[i], i);
	}

	priority_queue<int> active;
	rep(i, m)
	{
		int s = k[i];
		while (sz(waiting)&&(-waiting.top().first)<=s)
		{
			p2 p = waiting.top();
			waiting.pop();
			active.emplace(-b[p.second]);
		}
		int j = 0;
		while (j<s)
		{
			if (active.empty()) return 0;
			if (-active.top() < s)
			{
				active.pop();
				continue;
			}
			active.pop();
			j++;
		}
	}

	return 1;
}

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23