제출 #147612

#제출 시각아이디문제언어결과실행 시간메모리
147612nandonathaniel팀들 (IOI15_teams)C++14
34 / 100
4099 ms16660 KiB
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
pii V[100005];
bool sudah[100005];

bool cmp(pii x,pii y){
	return x.second<y.second;
}
int n;
void init(int N, int A[], int B[]) {
	for(int i=0;i<N;i++)V[i]=make_pair(A[i],B[i]);
	sort(V,V+N,cmp);
	n=N;
}

int can(int M, int K[]) {
	memset(sudah,false,sizeof(sudah));
	sort(K,K+M);
	for(int i=0;i<M;i++){
		int brp=0;
		bool ya=false;
		for(int j=0;j<n;j++){
			if(!sudah[j] && K[i]>=V[j].first && K[i]<=V[j].second){
				brp++;
				sudah[j]=true;
			}
			if(brp==K[i]){
				ya=true;
				break;
			}
		}
		if(!ya)return 0;
	}
	return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...