제출 #707696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707696		SamNguyen	팀들 (IOI15_teams)	C++14	0 / 100	4053 ms	19012 KiB

teams

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

inline int IN_RANGE(int x, pair<int, int> p) { return p.first <= x and x <= p.second; }

vector<pair<int, int>> students;

void init(int N, int L[], int R[]) {
	students.resize(N);
	for (int i = 0; i < N; i++)
		students[i] = make_pair(L[i], R[i]);
	sort(students.begin(), students.end());
}

int can(int M, int K[]) {
	vector<int> groups(K, K + M);
	sort(groups.begin(), groups.end());

	priority_queue<int, vector<int>, greater<int>> rights;

	auto it = students.begin();
	for (int g : groups) {
		while (it != students.end() and it->first <= g) {
			rights.push(it->second);
			it++;
		}

		for (int t = g; t--; ) {
			if (rights.empty())
				return false;

			if (rights.empty() or rights.top() < g)
				return false;

			rights.pop();
		}
	}

	return true;
}

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