Submission #98225

#	Time	Username	Problem	Language	Result	Execution time	Memory
98225		dalgerok	Alkemija (COCI18_alkemija)	C++17	80 / 80	93 ms	11344 KiB

alkemija

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



const int N = 1e5 + 5;



int n, m, k, x, cnt[N];
bool used[N];
vector < int > q[N], s[N];


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        cin >> x;
        used[x] = true;
    }
    cin >> k;
    queue < int > qq;
    for(int i = 1; i <= k; i++){
        int l, r;
        cin >> l >> r;
        for(int j = 1; j <= l; j++){
            cin >> x;
            q[x].push_back(i);
            if(!used[x]){
                cnt[i] += 1;
            }
        }
        for(int j = 1; j <= r; j++){
            cin >> x;
            s[i].push_back(x);
        }
        if(cnt[i] == 0){
            qq.push(i);
        }
    }
    while(!qq.empty()){
        int v = qq.front();
        qq.pop();
        for(int to : s[v]){
            if(!used[to]){
                used[to] = true;
                for(auto it : q[to]){
                    if(--cnt[it] == 0){
                        qq.push(it);
                    }
                }
            }
        }
    }
    vector < int > ans;
    for(int i = 1; i <= n; i++){
        if(used[i]){
            ans.push_back(i);
        }
    }
    cout << (int)ans.size() << "\n";
    for(auto it : ans){
        cout << it << " ";
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8