Submission #432229

#	Time	Username	Problem	Language	Result	Execution time	Memory
432229		jeqcho	Teams (IOI15_teams)	C++17	0 / 100	37 ms	8348 KiB

teams

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

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

#define FOR(i,a,b) for(int i=a;i<b;++i)
#define F0R(i,b) FOR(i,0,b)
#define ROF(i,a,b) for(int i=b-1;i>=a;--i)
#define R0F(i,b) ROF(i,0,b)
#define trav(a,x) for(auto&a:x)
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define pb push_back
#define sz(x) int(x.size())

int const N=1e2+3;
int A[N],B[N];
int n;
pii stu[N];


void init(int n1, int A1[], int B1[]) {
	n=n1;
	F0R(i,n)
	{
		A[i]=A1[i];
		B[i]=B1[i];
		stu[i]={A[i],B[i]};
	}
	sort(stu,stu+n);
}


int can(int m, int K[]) {
	sort(K,K+m);
	int cur=0;
	int cnt=0;
	F0R(i,n)
	{
		if(K[cur]>=stu[i].fi&&K[cur]<=stu[i].se)
		{
			++cnt;
			if(cnt==K[cur])
			{
				cnt=0;
				++cur;
				if(cur==m)break;
			}
		}
	}
	return cur==m;
}

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