Submission #1167033

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167033		HappyCapybara	팀들 (IOI15_teams)	C++20	34 / 100	4091 ms	12264 KiB

teams

#include "teams.h"
#include<bits/stdc++.h>
using namespace std;

int n;
vector<pair<int,int>> ab;

void init(int N, int A[], int B[]){
	n = N;
	ab.resize(N);
	for (int i=0; i<N; i++) ab[i] = {A[i], B[i]};
	sort(ab.begin(), ab.end());
}

int can(int M, int K[]){
	sort(K, K+M);
	priority_queue<int> pq;
	int cur = 0;
	for (int i=0; i<M; i++){
		while (cur != n && ab[cur].first <= K[i]){
			pq.push(-ab[cur].second);
			cur++;
		}
		int x = K[i];
		while (x && !pq.empty()){
			int r = -pq.top();
			pq.pop();
			if (r < K[i]) continue;
			x--;
		}
		if (x) return 0;
	}
	return 1;
}

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23