Submission #86059

#	Time	Username	Problem	Language	Result	Execution time	Memory
86059		kraljlavova1	Alkemija (COCI18_alkemija)	C++11	80 / 80	197 ms	16024 KiB

alkemija

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
const int MAX=100010;
int n,m;
int x,sz;
int k;
int R[MAX],P[MAX];
vector<int>r[MAX],p[MAX];
int bio[MAX],cnt[MAX];
vector<int>st;
vector<int>lst[MAX];
void solve(){
	while(!st.empty()){
		int x=st.back();
		st.pop_back();
		if(bio[x]) continue;
		bio[x]=1;
		for(int idx:lst[x]){
			cnt[idx]--;
			if(!cnt[idx]){
				for(int j=0;j<P[idx];j++){
					st.push_back(p[idx][j]);
				}
			}
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>x;
		st.push_back(x);
	}
	cin>>k;
	for(int i=0;i<k;i++){
		cin>>R[i]>>P[i];cnt[i]=R[i];
		for(int j=0;j<R[i];j++){
			cin>>x;
			r[i].push_back(x);
			lst[x].push_back(i);
		}
		for(int j=0;j<P[i];j++){
			cin>>x;
			p[i].push_back(x);
		}
	}
	solve();
	for(int i=1;i<=n;i++){
		if(bio[i]) sz++;
	}
	cout<<sz<<"\n";
	for(int i=1;i<=n;i++){
		if(bio[i]) cout<<i<<" ";
	}cout<<"\n";
	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