Submission #436543

#	Time	Username	Problem	Language	Result	Execution time	Memory
436543		jeqcho	Teams (IOI15_teams)	C++17	21 / 100	36 ms	8372 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=1e2+3;
pii ba[N];
bitset<N>vis;
int n;
void init(int n1, int A[], int B[]) {
	n=n1;
	F0R(i,n)
	{
		ba[i]={B[i],A[i]};
	}
	sort(ba,ba+n);
}

int can(int M, int K[]) {
	sort(K,K+M);
	vis.reset();
	F0R(j,M)
	{
		int cnt=0;
		F0R(i,n)
		{
			if(vis[i])continue;
			if(ba[i].se>K[j])continue;
			if(ba[i].fi<K[j])continue;
			++cnt;
			vis[i]=1;
			if(cnt==K[j])break;
		}
		if(cnt!=K[j])return 0;
	}
	return 1;
}

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