Ryhmät

#include <bits/stdc++.h>
using namespace std;

using ll=int;
using vl=vector<ll>;
#define all(c) begin(c),end(c)
#define pb push_back
#define sz(c) ll((c).size())

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)

#define TR(x) ({ if(1) cout << __LINE__ << ": " #x " = " << (x) << endl; })

// Only when needed
using dd = double;
const dd eps = 1e-10;
using vd = vector<dd>;
using vvd = vector<vd>;

using vvl = vector<vl>;

struct BIT{
	ll n;
	vl bit;
	
	BIT(ll N) : n(N), bit(n+1) {}
	
	void update(ll i, ll v) { // a_i += v
		for(i++; i<=n; i+=i&-i) bit[i] += v;
	}
	
	ll query(ll i) { // a_0 + ... + a_i-1
		ll res = 0;
		for(; i; i-=i&-i) res += bit[i];
		return res;
	}
};

using pll = pair<ll, ll>;
int main(int argc, char const *argv[])
{
    ll n; cin >> n;
    ll t; cin >> t;
    vvl upd(n + 1);
    FOR(i, 0, n){
        ll a, b;
        cin >> a >> b;
        upd[a].pb(b);
    }

    struct query{
        int tc, a, b;
        //int end;
    };
    vector<vector<query>> qus(n + 1);
    vl ans(t, -1);

    vector<vvl> compr(t);
    vector<vector<pll>> t_pts(t);
    FOR(tc, 0, t){
        ll m, sum = 0;
        cin >> m;
        vl pts(m);
        for(ll &x : pts) {
            cin >> x;
            sum += x;
        }
        if(sum > n){
            ans[tc] = 0;
            continue;
        }
        sort(all(pts));

        vector<pll> pts2;
        for(ll &x : pts){
            if(pts2.empty() || x != pts2.back().first)
                pts2.emplace_back(x, 1);
            else pts2.back().second += 1;
        }
        t_pts[tc] = pts2;
        assert(sz(pts2) < 500);
        ll tn = sz(pts2);
        compr[tc].resize(tn, vl(tn));
        FOR(i, 0, tn){
            FOR(j, i, tn){
                query q = {tc, i, j};
                // q.end = (j == tn - 1 ? n + 1 : pts2[j + 1].first);
                qus[pts2[i].first].pb(q);
            }
        }
    }
    BIT bit(n + 5);
    FOR(i, 1, n + 1){
        for(ll x : upd[i]) bit.update(x, 1);
        for(auto q : qus[i]){
            ll e2 = q.b == sz(t_pts[q.tc]) - 1 ? n + 1 : t_pts[q.tc][q.b + 1].first;
            // assert(e2 == q.end);
            compr[q.tc][q.a][q.b] = bit.query(e2);
        }
    }
    FOR(tc, 0, t){
        if(ans[tc] == 0) continue;
        ll tn = sz(compr[tc]);
        FOR(j, 0, tn){
            for(ll i = j; i >= 1; i--){
                compr[tc][i][j] -= compr[tc][i - 1][j];
            }
        }
        vl cur(tn);
        FOR(i, 0, tn){
            FOR(j, i, tn) cur[j] += compr[tc][i][j];
            ll ms = t_pts[tc][i].first * t_pts[tc][i].second;
            FOR(j, i, tn){
                if(ms >= cur[j]){
                    ms -= cur[j];
                    cur[j] = 0;
                }else{
                    cur[j] -= ms;
                    ms = 0;
                    break;
                }
            }
            ans[tc] = ms == 0;
        }
    }

    FOR(tc, 0, t){
        cout << (ans[tc] ? "YES\n" : "NO\n");
    }

    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: ACCEPTED