Submission #619979

#	Time	Username	Problem	Language	Result	Execution time	Memory
619979		yanndev	Teams (IOI15_teams)	C++17	34 / 100	4074 ms	19120 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int MX_N = 500042;

int n;
pair<int, int> stud[MX_N];

void init(int N, int A[], int B[]) {
	for (int i = 0; i < N; i++)
		stud[i] = {A[i], B[i]};
	n = N;
	sort(stud, stud + N);
}

int can(int M, int K[]) {
	sort(K, K + M);

	int nxt = 0;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> ranges {};
	for (int i = 0; i < M; i++) {
		while (nxt < n && stud[nxt].fi <= K[i]) {
			ranges.push({stud[nxt].se, stud[nxt].fi});
			nxt++;
		}

		int req = K[i];

		while (!ranges.empty() && req) {
			auto cur = ranges.top();
			ranges.pop();
			if (cur.fi >= K[i])
				req--;
		}

		if (req != 0)
			return 0;
	}

	return 1;
}

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