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;
    }
}

struct Solmu {
    vector<pair<int, int>> toiveet;
    int p = 0;
};

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

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

    vector<Solmu> toivepuu(2 * N);
    for(int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        hajotelma(a, b, [&](int v) {
            toivepuu[v].toiveet.push_back({b, i});
        });
    }
    vector<bool> valittu(n);

    for(Solmu& solmu : toivepuu) {
        sort(solmu.toiveet.begin(), solmu.toiveet.end());
    }

    vector<int> koot;
    vector<int> sotketutSolmut;
    vector<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());

        sotketutSolmut.clear();
        valitut.clear();

        bool ok = true;
        for(int koko : koot) {
            for(int toisto = 0; toisto < koko; ++toisto) {
                int paras = N;
                int parasV = -1;
                peitto(koko, [&](int v) {
                    Solmu& solmu = toivepuu[v];
                    while(solmu.p < (int)solmu.toiveet.size() && valittu[solmu.toiveet[solmu.p].second]) {
                        if(solmu.p == 0) {
                            sotketutSolmut.push_back(v);
                        }
                        ++solmu.p;
                    }
                    if(solmu.p < (int)solmu.toiveet.size() && solmu.toiveet[solmu.p].first < paras) {
                        paras = solmu.toiveet[solmu.p].first;
                        parasV = v;
                    }
                });
                if(parasV == -1) {
                    ok = false;
                    goto ohi;
                }
                Solmu& solmu = toivepuu[parasV];
                int i = solmu.toiveet[solmu.p].second;
                valittu[i] = true;
                valitut.push_back(i);
            }
        }
        ohi: {}

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

        for(int i : valitut) {
            valittu[i] = false;
        }
        for(int v : sotketutSolmut) {
            toivepuu[v].p = 0;
        }
    }

    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