站外提求助(拓扑排序)

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;
int n, a[N], l[N], op[N], lcx = 0, mx = 0;
vector<int>p[N], ciu;
struct node{
	int x, y;
}cch[N];
map<int, int>mp;
//void add(int xandy, int x, int y){
//	for(auto &i : p[x]){
//		p[xandy].push_back(i);
//		l[xandy]++;
//	}
//	for(auto &i : p[y]){
//		p[xandy].push_back(i);
//		l[xandy]++;
//	}
//}
void dy(int i){
	if(op[i] == 1){
		for(auto &j : p[i]){
			mx = max(mx, ++mp[j]);
			lcx++;
		}
	}else{
		dy(cch[i].x);
		dy(cch[i].y);
	}
}
signed main(){
	int t;cin >> t;while(t--){
		mp.clear();
		ciu.clear();lcx = 0;
		cin >> n;
		for(int i = 1; i <= n; i++){
			p[i].clear();
			cin >> op[i];
			if(op[i] == 1){
				cin >> l[i];
				for(int j = 1; j <= l[i]; j++){
					int pcl;cin >> pcl;
					p[i].push_back(pcl);
				}
			}else{
				int x, y;cin >> x >> y;
				cch[i].x = x, cch[i].y = y;
			}
		}
//		for(auto &i : p[n]){
//			cout << i << " ";
//		}cout << "\n";
		mx = 0;
		dy(n);
		if(mx >= lcx / 2)cout << 2 * (lcx - mx) << "\n";
		else cout << lcx << "\n";
	}
	return 0;
}