Submission #57857

#TimeUsernameProblemLanguageResultExecution timeMemory
57857E869120팀들 (IOI15_teams)C++14
0 / 100
4033 ms9640 KiB
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>>vec;int N;

void init(int NN, int A[], int B[]) {
	N=NN;
	for(int i=0;i<N;i++) vec.push_back(make_pair(A[i],B[i]));
	sort(vec.begin(),vec.end());
}

int can(int M, int K[]) {
	sort(K,K+M);
	
	int cx=0;
	for(int i=0;i<M;i++){
		int cnt=0;
		while(cx<N && cnt<K[i]){
			if(vec[cx].first<=K[i] && K[i]<=vec[cx].second) cnt++;
			cx++;
		}
		if(cnt!=K[i]) 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...