Submission #764418

#	Time	Username	Problem	Language	Result	Execution time	Memory
764418		SanguineChameleon	Teams (IOI15_teams)	C++17	0 / 100	4051 ms	75684 KiB

teams

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

const int maxN = 5e5 + 20;
vector<pair<int, int>> qadd[maxN];
vector<pair<int, int>> qrem[maxN];
int cnt[maxN];
int N;

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

int can(int M, int K[]) {
	for (int i = 0; i < M; i++) {
		cnt[K[i]]++;
	}
	set<pair<int, int>> S;
	bool ok = true;
	for (int i = 1; i <= N ; i++) {
		for (auto p: qadd[i]) {
			S.insert(p);
		}
		if ((int)S.size() < cnt[i]) {
			ok = false;
			break;
		}
		for (int j = 0; j < cnt[i]; j++) {
			S.erase(S.begin());
		}
		for (auto p: qrem[i]) {
			S.erase(p);
		}
	}
	for (int i = 0; i < M; i++) {
		cnt[K[i]]--;
	}
	return ok;
}

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