| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1244926 | anha3k25cvp | Alkemija (COCI18_alkemija) | C++20 | 41 ms | 11972 KiB | 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>
using namespace std;
const int N = 5 + 1e5;
const int inf = 7 + 1e9;
int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n, m;
    cin >> n >> m;
    vector <int> a(m + 1, 0);
    for (int i = 1; i <= m; i ++)
        cin >> a[i];
    int k;
    cin >> k;
    vector <int> l(k + 1, 0), r(k + 1, 0), cnt(k + 1, 0);
    vector <vector <int>> x(k + 1), y(k + 1), adj(n + 1);
    for (int i = 1; i <= k; i ++) {
        cin >> l[i] >> r[i];
        x[i].resize(l[i]);
        for (int j = 0; j < l[i]; j ++) {
            cin >> x[i][j];
            adj[x[i][j]].push_back(i);
        }
        cnt[i] = l[i];
        y[i].resize(r[i]);
        for (int j = 0; j < r[i]; j ++)
            cin >> y[i][j];
    }
    queue <int> q;
    vector <int> vis(n + 1, 0);
    for (int i = 1; i <= m; i ++) {
        vis[a[i]] = 1;
        for (int id : adj[a[i]]) {
            cnt[id] --;
            if (cnt[id] == 0)
                q.push(id);
        }
    }
    while (!q.empty()) {
        int id = q.front();
        q.pop();
        for (int v : y[id]) {
            if (vis[v])
                continue;
            vis[v] = 1;
            for (int id_ : adj[v]) {
                cnt[id_] --;
                if (cnt[id_] == 0)
                    q.push(id_);
            }
        }
    }
    vector <int> ans;
    for (int i = 1; i <= n; i ++)
        if (vis[i])
            ans.push_back(i);
    cout << ans.size() << '\n';
    for (int u : ans)
        cout << u << ' ';
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
