Submission #140199

#	Time	Username	Problem	Language	Result	Execution time	Memory
140199		SirCeness	Teams (IOI15_teams)	C++14	0 / 100	4094 ms	9848 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
#define orta ((l+r)>>1)
#define INF 1000000009
#define mod 1000000007
#define ppair(x); cerr << "(" << x.first << ", " << x.second << ")\n";
#define bas(x) #x << ": " << x << " "
#define prarr(x, n); cerr << #x << ": "; for(int qsd = 0; qsd < n; qsd++) cerr << x[qsd] << " "; cerr << "\n";
#define prarrv(x); cerr << #x << ": "; for(int qsd = 0; qsd < (int)x.size(); qsd++) cerr << x[qsd] << " "; cerr << "\n";
using namespace std;
typedef long long ll;

int n;
vector<int> artir;
vector<int> azalt;

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

int can(int M, int K[]){
	ll cur = 0;
	ll aldim = 0;
	int ki = 0;
	sort(K, K+M);
	for (int i = 1; i <= n; i++){
		cur += artir[i];
		while (K[ki] == i){
			if (cur < K[ki]) return 0;
			cur -= K[ki];
			aldim += K[ki];
			ki++;
			if (ki == M) return 1;
		}
		if (aldim >= azalt[i]) aldim -= azalt[i];
		else {
			cur -= azalt[i] - aldim;
			aldim = 0;
		}
	}
	return aldim == 0;
}

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