Submission #287073

#	Time	Username	Problem	Language	Result	Execution time	Memory
287073		Saboon	Teams (IOI15_teams)	C++17	34 / 100	4059 ms	19228 KiB

teams

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

const int maxn = 5e5 + 10;
int n;
pair<int,int> p[maxn];

void init(int N, int A[], int B[]){
	n = N;
	for (int i = 0; i < n; i++)
		p[i] = {A[i],B[i]};
	sort(p,p+n);
}

int can(int m, int k[]){
	sort(k,k+m);
	priority_queue<int,vector<int>,greater<int>> pq;
	int ptr = 0;
	for (int i = 0; i < m; i++){
		while (ptr < n and p[ptr].first <= k[i])
			pq.push(p[ptr++].second);
		while (!pq.empty() and pq.top() < k[i])
			pq.pop();
		while (k[i] > 0){
			if (pq.empty())
				return false;
			pq.pop();
			k[i] --;
		}
	}
	return true;
}

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