제출 #143221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
143221		SeekingOblivion	Alkemija (COCI18_alkemija)	C++14	80 / 80	201 ms	11008 KiB

alkemija

#include<iostream>
#include<fstream>
#define fin cin
#define fout cout
#include<algorithm>
#include<queue>
using namespace std;
//ifstream fin("date.in");
//ofstream fout("date.out");
int poz,n,m,a,i,j,k,l,p,sol[100001],r,f[100001],nr[100001];
vector<int> rez[100001],v[100001];
queue<int> q;
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>a;f[a]=1;
        sol[++p]=a;
    }
    fin>>k;
    for(i=1;i<=k;i++)
    {
        fin>>l>>r;
        for(j=1;j<=l;j++){
            fin>>a;
            if(f[a]==0){
                nr[i]++;
                v[a].push_back(i);
            }
        }
        for(j=1;j<=r;j++)
        {
            fin>>a;
            if(f[a]==0) rez[i].push_back(a);
        }
        if(nr[i]==0) q.push(i);
    }
    while(!q.empty()){
        poz=q.front();q.pop();
        for(auto it:rez[poz])
        if(f[it]==0){
            f[it]=1;sol[++p]=it;
            for(auto IT:v[it])
            {
                nr[IT]--;
                if(nr[IT]==0) q.push(IT);
            }
        }
    }
    sort(sol+1,sol+p+1);
    fout<<p<<"\n";
    for(i=1;i<=p;i++) fout<<sol[i]<<" ";
    return 0;
}

• 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