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> tree[2*MN];

void add(int a, int b) {
	int e = b;
	for(a+=MN,b+=MN; a<=b; a/=2,b/=2) {
		if (a%2==1) tree[a++].push_back(e);
		if (b%2==0) tree[b--].push_back(e);
	}
}
int getR(int a, int b) {
	int r=0;
	for(a+=MN; a>=1; a/=2) {
		auto& t = tree[a];
		r += t.end() - lower_bound(t.begin(),t.end(),b);
	}
	return r;
}
int get(int a) {
	int r=0;
	for(a+=MN; a>=1; a/=2) r+=tree[a].size();
	return r;
}

int ks[MN];

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	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=0; i<n; ++i) {
		auto [b,a] = ps[i];
		add(a,b);
	}
	while(t--) {
		int m;cin>>m;
		for(int i=0; i<m; ++i) cin>>ks[i];
		sort(ks,ks+m);
		int a = 0;
		for(int i=0; i<m && a>=0; ++i) {
			int k = ks[i], pk = i>0?ks[i-1]:0;
			int r = getR(pk,k);
			int c = get(k) - r + min(a,r);
			a = c - k;
		}
		cout<<(a>=0?"YES\n":"NO\n");
	}
}

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: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED