Ryhmät

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

#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) 0xffff
#endif

#define N 101010

vector<pair<int, int>> kids;
int n;

void solve() {
  int m; cin>>m;
  if (m == 0) return void(cout << "YES\n");
  vector<ll> totalNeed(n+2, 0);
  vector<ll> groupPoints(m);

  for (int i = 0; i < m; i++) cin>>groupPoints[i];


  ll totReq = 0;
  for (ll sz : groupPoints) {
    totalNeed[sz] += sz;
    totReq += sz;
  }

  if (totReq > n) return void(cout << "NO\n");
  
  priority_queue<ll, vector<ll>, greater<ll>> pq;
  int cur = 0;

  for (ll sz = 1; sz <= n; sz++) {
    while (cur < n && kids[cur].first <= sz) {
      // consider kids <= sz
      pq.push(kids[cur++].second);
    }
    // some are not valid anymore
    while (!pq.empty() && pq.top() < sz) pq.pop();

    ll thisNeed = totalNeed[sz];
    while (thisNeed > 0) {
      thisNeed--;
      if (pq.empty()) return void(cout << "NO\n");
      int en = pq.top();
      pq.pop();
      
      if (en < sz) return void(cout << "NO\n");
    }
  }

  cout << "YES\n";
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  int t;
  cin>>n>>t;

  for (int i = 0; i < n; i++) {
    int a, b; cin>>a>>b;
    kids.push_back({a, b});
  }


  sort(kids.begin(), kids.end());

  while (t--) {
    solve();
  }
}

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