Ryhmät

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int MN = 1<<19;
typedef pair<int,int> P;
P ps[MN];
vector<int> cs[2*MN];

void add(int a, int b, int x) {
	for(a+=MN,b+=MN; a<=b; a/=2,b/=2) {
		if (a%2==1) cs[a++].push_back(x);
		if (b%2==0) cs[b--].push_back(x);
	}
}
int rm[MN];
int T=1;
vector<P> undo;
bool get(int n) {
	int r = MN;
	for(n+=MN; n>=1; n/=2) {
		while(!cs[n].empty() && rm[cs[n].back()]==T) {
			undo.emplace_back(n,cs[n].back());
			cs[n].pop_back();
		}
		if (!cs[n].empty()) r = min(r, cs[n].back());
	}
	if (r==MN) return 0;
	rm[r] = T;
	return 1;
}

int ks[MN];

int main() {
	int n,t;cin>>n>>t;
	for(int i=0;i<n;++i) cin>>ps[i].second>>ps[i].first;
	sort(ps,ps+n);
	for(int i=n-1;i>=0;--i) {
		auto [b,a] = ps[i];
		add(a,b,i);
	}
	for(T=1; T<=t; ++T) {
		int m;cin>>m;
		for(int i=0; i<m; ++i) cin>>ks[i];
		sort(ks,ks+m);
		bool ok=1;
		for(int i=0; i<m && ok; ++i) {
			int k = ks[i];
			for(int j=0; j<k && ok; ++j) {
				ok = get(k);
			}
		}
		cout<<(ok?"YES\n":"NO\n");
		while(!undo.empty()) {
			auto [v,c] = undo.back();
			cs[v].push_back(c);
			undo.pop_back();
		}
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED