Submission #1284630

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284630		kustov_vadim_533	Teams (IOI15_teams)	C++20	0 / 100	81 ms	14872 KiB

teams

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <queue>
#include <array>
#include <map>
#include <random>
#include <bitset>
#include <stack>
#include <deque>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <string>

using namespace std;

typedef long long ll;

vector<pair<int, int>> a;

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

	sort(a.begin(), a.end());
}

int can(int M, int K[]) {
	sort(K, K + M);

	multiset<int> s;
	
	int l = 0;
	for (int i = 0; i < M; ++i) {
		while (l < a.size() && a[l].first < i) {
			s.insert(a[l].second);
			++l;
		}

		int t = K[i];
		while (t > 0 && s.lower_bound(K[i]) != s.end()) {
			s.erase(s.lower_bound(K[i]));
			--t;
		}

		if (t > 0) return 0;
	}
	return 1;
}

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