PTA病毒溯源（dfs）

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
const int N=2e5+5;
int n,a[N],ans;
vector<int>e[N],s,res;
bool check(vector<int>a,vector<int>b){
	if(a.size()==b.size()){
		for(int i=0;i<a.size();i++){
			if(a[i]==b[i]) continue;
			return a[i]<b[i];
		}
	}
	return a.size()>b.size();
}
void dfs(int u,int deep){
	s.push_back(u);
	ans=max(ans,deep);
	if(e[u].size()==0&&check(s,res)){
		res=s;
	}
	for(auto it:e[u]) dfs(it,deep+1);
	s.pop_back();
}
void solve(){
	cin>>n;
	for(int i=0;i<n;i++){
		int k;
		cin>>k;
		while(k--){
			int x;
			cin>>x;
			e[i].push_back(x);
			a[x]=1;
		}
	}
	int r=min_element(a,a+n)-a;
	dfs(r,1);
	int f=1;
	cout<<ans<<endl;
	for(auto it:res){
		if(f) f=0;else cout<<" ";
		cout<<it;
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t=1;
//	cin>>t;
	while(t--) solve();
	return 0;
}