Ryhmät

#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int,int>;

const int N = 1<<17;

struct Data {
    int begin=0, end=0;
};

Data operator+(Data x, Data y) {
    return Data{x.begin+y.begin, x.end+y.end};
}

struct Node {
    Data data;
    Node *L=0, *R=0;
};
Node STORE[40*N];

Node *newNode() {
    static int id=0;
    assert(id < 40*N);
    return &STORE[id++];
}

Data query(Node *tree, int tl, int tr, int ql, int qr) {
    if (!tree || tl > qr || tr < ql) return {};
    if (tl >= ql && tr <= qr) return tree->data;
    int tm = (tl+tr)/2;
    return query(tree->L, tl, tm, ql, qr) +
           query(tree->R, tm+1, tr, ql, qr);
}

Data query(Node *tree, int ql, int qr) {
    return query(tree, 0, N-1, ql, qr);
}

Node *insert(Node *tree, int tl, int tr, int pos, Data data) {
    if (tl > pos || tr < pos) return tree;
    if (tl == tr) {
        Node *node = newNode();
        node->data = data + (tree ? tree->data : Data());
        return node;
    }
    int tm = (tl+tr)/2;
    Node *node = newNode();
    node->L = insert(tree ? tree->L : nullptr, tl, tm, pos, data);
    node->R = insert(tree ? tree->R : nullptr, tm+1, tr, pos, data);
    node->data = (node->L ? node->L->data : Data()) +
                 (node->R ? node->R->data : Data());
    return node;
}

Node *ROOTS[N];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ROOTS[0] = newNode();
    int n,t; cin>>n>>t;
    vector<pii> ranges(n);
    for (auto& [a,b] : ranges) cin>>a>>b;
    sort(ranges.begin(), ranges.end());
    {
        int maxBegin = 0;
        for (auto [begin,end] : ranges) {
            for (; maxBegin < begin; maxBegin++) {
                ROOTS[maxBegin+1] = ROOTS[maxBegin];
            }
            ROOTS[begin] = insert(ROOTS[begin], 0, N-1, begin, Data{1, 0});
            ROOTS[begin] = insert(ROOTS[begin], 0, N-1, end, Data{0, 1});
        }
    }
    for (int m; cin>>m;) {
        map<int,int> M;
        for (int i=0; i<m; i++) {
            int x; cin>>x;
            M[x] += x;
        }
        bool ok = true;
        int prev_sz = 0;
        int prev_used = 0;
        for (auto [sz,cnt] : M) {
            Data data0 = query(ROOTS[sz], 0, sz-1);
            Data data1 = query(ROOTS[sz], 0, sz);
            int active = data1.begin - data0.end;
            int debt = max(0, prev_used - query(ROOTS[prev_sz], prev_sz, sz-1).end);
            if (active < cnt + debt) {
                ok = false;
                break;
            }
            prev_sz = sz;
            prev_used = cnt + debt;
        }
        cout << (ok ? "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: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED