Ryhmät

#include <algorithm>
#include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

constexpr int N = 1 << 17;

template <typename F>
void hajotelma_(int a, int b, const F& f, int v, int s) {
    if(b <= 0 || a >= s) {
        return;
    }
    if(a <= 0 && b >= s) {
        f(v);
        return;
    }
    int h = s >> 1;
    hajotelma_(a, b, f, 2 * v, h);
    hajotelma_(a - h, b - h, f, 2 * v + 1, h);
}

template <typename F>
void hajotelma(int a, int b, const F& f) {
    hajotelma_(a, b + 1, f, 1, N);
}

template <typename F>
void peitto(int i, const F& f) {
    i += N;
    while(i > 0) {
        f(i);
        i >>= 1;
    }
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    int n, t;
    cin >> n >> t;

    vector<multiset<pair<int, int>>> toivepuu(2 * N);
    for(int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        hajotelma(a, b, [&](int v) {
            toivepuu[v].insert({b, a});
        });
    }

    vector<int> koot;
    stack<pair<int, int>> valitut;
    for(int ti = 0; ti < t; ++ti) {
        int m;
        cin >> m;

        koot.resize(m);
        for(int i = 0; i < m; ++i) {
            cin >> koot[i];
        }
        sort(koot.begin(), koot.end());

        bool ok = true;
        for(int koko : koot) {
            for(int i = 0; i < koko; ++i) {
                int paras = N;
                int parasV = -1;
                peitto(koko, [&](int v) {
                    if(!toivepuu[v].empty() && toivepuu[v].begin()->first < paras) {
                        paras = toivepuu[v].begin()->first;
                        parasV = v;
                    }
                });
                if(parasV == -1) {
                    ok = false;
                    goto ohi;
                }
                auto [b, a] = *toivepuu[parasV].begin();
                hajotelma(a, b, [&](int v) {
                    auto it = toivepuu[v].find({b, a});
                    if(it == toivepuu[v].end()) {
                        throw 5;
                    }
                    toivepuu[v].erase(it);
                });
                valitut.push({a, b});
            }
        }
        ohi: {}

        if(ok) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }

        while(!valitut.empty()) {
            auto [a, b] = valitut.top();
            valitut.pop();
            hajotelma(a, b, [&](int v) {
                toivepuu[v].insert({b, a});
            });
        }
    }

    return 0;
}

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