제출 #167430

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

teams

#include "teams.h"

#include <algorithm>
#include <numeric>
#include <queue>


struct Interval
{
	int start, end;
	bool operator <(const Interval &other) const
	{
		return (other.end < end);
	}
};

const int MAXN = 1e5;
int students;

Interval prefer[MAXN];
std::priority_queue<Interval> canAssign;


void init(int N, int A[], int B[])
{
	students = N;
	for (int iStud = 0; iStud < students; iStud++)
	{
		prefer[iStud].start = A[iStud];
		prefer[iStud].end = B[iStud];
	}

	std::sort(prefer, prefer + students, [](const Interval &a, const Interval &b) { return (a.start != b.start ? a.start < b.start : a.end < b.end); }); 
}

int can(int M, int K[])
{
	if (std::accumulate(K, K + M, 0) > students)
		return 0;

	while (!canAssign.empty())
		canAssign.pop();
	std::sort(K, K + M);

	int iStud = 0;
	for (int iGroup = 0; iGroup < M; iGroup++)
	{
		while (!canAssign.empty() && canAssign.top().end < K[iGroup])
			canAssign.pop();
		for (; iStud < students && prefer[iStud].start <= K[iGroup]; iStud++)
			canAssign.emplace(prefer[iStud]);

		if ((int)canAssign.size() < K[iGroup])
			return 0;
		for (int iAssign = 0; iAssign < K[iGroup]; iAssign++)
			canAssign.pop();
	}

	return 1;
}

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