Submission #639007

#	Time	Username	Problem	Language	Result	Execution time	Memory
639007		ggoh	팀들 (IOI15_teams)	C++14	34 / 100	4035 ms	19044 KiB

teams

#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
typedef long long lint;
typedef pair<int,int> pii;

int n;
pii d[500003];

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

int can(int M, int K[]) {
	sort(K,K+M);
	int piv=0;
	int ans=1;
	priority_queue<int>P;
	for(int i=0;i<M;i++)
	{
		while(piv<n && d[piv].first<=K[i])
		{
			P.push({-d[piv].second});
			piv++;
		}
		int o=K[i];
		while(o && !P.empty())
		{
			int p=P.top();P.pop();
			if(-p <K[i])continue;
			else o--;
		}
		if(o!=0)
		{
			ans=0;
			break;
		}
	}

	return ans;
}

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