Submission #1246054

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246054		warrenn	Alkemija (COCI18_alkemija)	C++20	80 / 80	110 ms	12856 KiB

alkemija

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

int n,m;
set<int>st;
int deg[100002];
vector<int>hasil[100002];
vector<int>mana[100002];

signed main(){
    cin>>n>>m;
    for(int q=1;q<=m;q++){
        int a;
        cin>>a;
        st.insert(a);
    }
    int k;
    cin>>k;
    queue<int>qu;

    for(int q=1;q<=k;q++){
        int l,r;
        cin>>l>>r;
        deg[q]=l;
        for(int w=1;w<=l;w++){
            int zat;
            cin>>zat;
            mana[zat].push_back(q);
            if(st.count(zat))deg[q]--;
        }
        for(int w=1;w<=r;w++){
            int zat;
            cin>>zat;
            hasil[q].push_back(zat);
        }
        //cout<<deg[q]<<endl;
        if(deg[q]==0)qu.push(q);
    }
    while(qu.size()){
        int idx=qu.front();
        qu.pop();
     
        for(auto r : hasil[idx]){
            if(st.count(r))continue;
            st.insert(r);
            for(auto tempat : mana[r]){
                deg[tempat]--;
                if(deg[tempat]==0)qu.push(tempat);
            }
        }
    }
    cout<<st.size()<<endl;
    for(auto r : st){
        cout<<r<<" ";
    }
    cout<<endl;
}

• 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