Ryhmät

input/code.cpp: In function 'int solve()':
input/code.cpp:128:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         for (int j = 0; j < curr.size(); j++) {
      |                         ~~^~~~~~~~~~~~~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;



int solve() {
    int n, t; std::cin >> n >> t;
    vector<pair<int,int>> v(n);
    for (int i = 0; i < n; i++) {
        std::cin >> v[i].fi >> v[i].se;
    }

    sort(v.begin(), v.end(), [&](auto &a, auto &b) {
        return a.se<b.se;
    });

    //__print(v); std::cout  << std::endl;

    for (int i = 0; i < t; i++) {
        int m; std::cin >> m;
        //vector<pair<int,int>> tmp=v;
        vector<int> curr(m);
        for (int j = 0; j < m; j++) {
            std::cin >> curr[j];
        }
        if(accumulate(all(curr), 0)>n) {
            std::cout << "NO" << std::endl;
            continue;
        }

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

        multiset<pair<ll,ll>> ms;
        for(auto &w:v) {
            ms.insert(w);
        }


        bool ok=true;
        for (int j = 0; j < curr.size(); j++) {
            int left=curr[j];
            
            int qq=left;
            //std::cout << "left: " << left << std::endl;
            for (int l = 0; l < qq; l++) {
                //std::cout << "have " << left-l << " left" << std::endl;
                auto it=ms.lower_bound({curr[j]+1, -INF});
                if(it!=ms.begin()) {
                    //std::cout << "first for " << j << std::endl;
                    it=prev(it);
                    if((*it).fi<=curr[j] && curr[j]<=(*it).se) {
                        //std::cout << "Taking " << (*it).fi << " " << (*it).se << " for " << curr[j] << std::endl;
                        left--;
                        ms.erase(it);
                    } else {
                        ok=false;
                        break;
                    }
                } else {
                    //std::cout << "second" << std::endl;
                    while(it!=ms.end() && (*it).se<curr[j]) it++;
                    if(it==ms.end() || (*it).fi>curr[j]) {
                        ok=false;
                        break;
                    } else {
                        left--;
                        //std::cout << "Taking " << (*it).fi << " " << (*it).se << " for " << curr[j] << std::endl;
                        ms.erase(it);
                    }
                }
            }
    
            //std::cout << "LEFT AT THE END: " << left << std::endl;
            ok&=left==0;
            if(!ok) break;
        }
        

        std::cout << (ok ? "YES" : "NO") << std::endl;
        


        
        
    }

    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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

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