Source Code
/// Frail the skin is dry and pale
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;

#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace __gnu_pbds;
using namespace __gnu_cxx;

using ll = long long;
using ii = pair<int, int>;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp make_pair

const int N = 5e4 + 5, LG = 18, MOD = 31607;
const double PI = acos(-1);
bool winners[1000006];
int cntWinners[1000005];
vector<int> projects[1000005];
void doWork() {
    int n, m;
    cin >> n >> m;
    int q;  cin >> q;
    f(i,0,q) {
        int x;  cin >> x;
        winners[x] = true;
    }
    vector<bool> take(n);
    f(i,0,n) {
        int x;  cin >> x;
        projects[i].resize(x);
        bool ok = true;
        for(auto & v : projects[i]) {
            cin >> v;
            ok &= winners[v];
        }
        take[i] = ok;
        if(ok) {
            for(auto & v : projects[i]) {
                cntWinners[v] += 1;
            }
        }
    }

    vector<int> ans;
    f(i,0,n) {
        if(take[i]) {   ///only consider projects that can be winning
            for(auto & v : projects[i]) {
                if(cntWinners[v] == 1) {
                    ans.pb(i + 1);
                    break;
                }
            }
        }
    }

    cout << sz(ans) << '\n';
    f(i,0,sz(ans))cout << ans[i] << " \n"[i+1==sz(ans)];


}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }


    return 0;
}
Copy
Projects DeadlyPillow
GNU G++17
461 ms
39.3 MB
Accepted