Submission #67047

#TimeUsernameProblemLanguageResultExecution timeMemory
67047nvmdavaTeams (IOI15_teams)C++17
0 / 100
4030 ms9172 KiB
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
struct unit{
	int l, r;
};
vector<unit> v;
void init(int N, int A[], int B[]) {
	sort(A, A + N);
	sort(B, B + N);
	unit t;
	
	for(int i = 0; i < N; i++){
		t.l = A[i];
		t.r = B[i];
		v.push_back(t);
	}
	
}

int can(int M, int K[]) {
	int t = K[0], i = 0;
	sort(K, K + M);
	for(auto x : v){
		if(K[i] < x.l){
			return 0;
		}
		if(K[i] <= x.r){
			t--;
			if(t == 0){
				i++;
				if(i == M){
					return 1;
				}
				t = K[i];
			}
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...