Submission #436397

#	Time	Username	Problem	Language	Result	Execution time	Memory
436397		jeqcho	Teams (IOI15_teams)	C++17	0 / 100	4083 ms	16292 KiB

teams

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

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define fi first
#define se second

int const N=5e5+3;
pii ab[N];
int n;
void init(int n1, int A[], int B[]) {
	n=n1;
	F0R(i,n)
	{
		ab[i]={A[i],B[i]};
	}
	sort(ab,ab+n);
}

int can(int M, int K[]) {
	sort(K,K+M);
	int mdex=0;
	int cnt=0;
	F0R(i,n)
	{
		if(ab[i].fi>K[mdex])return 0;
		if(ab[i].se<K[mdex])continue;
		++cnt;
		if(cnt==K[mdex])
		{
			++mdex;
			cnt=0;
		}
		if(mdex==M)break;
	}
	return mdex==M;
}

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