Submission #5883293

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
#include <unordered_set>
#include <random>



using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)




















 
int main(){
    ll n, k;
    cin >> n >> k;
    vector<ll> boat(n, -1);
    REP(i, k){
        ll m;
        cin >> m;
        REP(j, m){
            ll b;
            cin >> b;
            b--;
            boat[b] = i;
        }
    }
    ll r;
    cin >> r;
    vector<bool> ok(n, true);
    REP(i, r){
        ll p, q;
        cin >> p >> q;
        p--; q--;
        if(boat[p] == boat[q]){
            ok[p] = ok[q] = false;
        }
    }
    ll ans = 0;
    REP(i, n) if(!ok[i]) ans++;
    cout << ans << endl;
}

Submission Info

Judge Result