Submission #1293615

#TimeUsernameProblemLanguageResultExecution timeMemory
1293615goulthenTeams (IOI15_teams)C++20
21 / 100
4094 ms5904 KiB
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for (int i = a; i <= b; i++)
#define pii pair<int,int>
#define fi first
#define se second

const int MAXN = 2e5+10;
pii a[MAXN];
int n;

void init(int N, int A[], int B[]) {
	n = N;
	rep(i,0,N-1) a[i+1] = {B[i],A[i]};
	sort(a+1, a+n+1);
}

int can(int M, int K[]) {
	sort(K,K+M);
	vector<int> cnt(M);
	int s = 0;

	rep(i,0,M-1) cnt[i] = K[i], s+=K[i];
	rep(i,1,n) {
		rep(j,0,M-1) {
			if(K[j] >= a[i].se && K[j] <= a[i].fi && cnt[j]>0) {
				cnt[j]--;
				s--;
				break;
			}
		}
	}
	return s==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...