Submission #1311225

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311225		PlayVoltz	Teams (IOI15_teams)	C++20	34 / 100	4094 ms	29064 KiB

teams

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

#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int n;
vector<vector<int> > vect;

void init(int N, int A[], int B[]){
	n=N;
	vect.resize(n+1);
	for (int i=0; i<n; ++i)vect[A[i]].pb(B[i]);
}

int can(int m, int ord[]){
	sort(ord, ord+m);
	priority_queue<int, vector<int>, greater<int> > pq;
	for (int i=1, p=0; i<=n; ++i){
		for (auto a:vect[i])pq.push(a);
		while (p<m&&ord[p]==i){
			while (pq.size()&&pq.top()<i)pq.pop();
			if (pq.size()<i)return 0;
			for (int j=0; j<i; ++j)pq.pop();
			++p;
		}
	}
	return 1;
}

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