Submission #1140413

#TimeUsernameProblemLanguageResultExecution timeMemory
1140413hyl_kibouTeams (IOI15_teams)C++17
0 / 100
4096 ms10336 KiB
#include "teams.h"
#include <vector>

std::vector<int> a;
std::vector<int> b;
int n;

void init(int N, int A[], int B[]) {
	n = N;
	for(int i = 0; i<N; ++i){		
		a.push_back(A[i]);
		b.push_back(B[i]);
	}
}

int can(int M, int K[]) {
	std::vector<int> arr(n, 0);
	long long cont = 0;
	long long sum = 0;
	int cat = 0;
	int flag = 0;
	for(int i = 0; i<M; ++i){
		cat = 0;
		sum+=K[i];
		for(int j = 0; j<n; ++j){
			if(K[i]>=a[j] && K[i]<=b[j]){
				if(arr[j]==0){
					++cont;				
				}
				++cat;
				++arr[j];
			}
		}
		if(cat<K[i]){
			flag = 1;
		}
	}
	if(cont<sum){
		flag = 1;
	}
	if(flag){
		return 0;
	}
	else{
		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...