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;
double z,r,ans;
vector<int>e[N];
map<int,int>mp;
void dfs(int u,int d){
	if(e[u].size()==0){
		ans+=z*pow((100.0-r)/100.0,d)*mp[u];
		return;
	}
	for(auto it:e[u]){
		dfs(it,d+1);
	}
}
void solve(){
	cin>>n>>z>>r;
	for(int i=0;i<n;i++){
		int k,x;
		cin>>k;
		if(!k){
			cin>>x;
			mp[i]=x;
		}
		while(k--){
			cin>>x;
			e[i].push_back(x);
		}
	}
	dfs(0,0);
	cout<<(int)ans;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t=1;
//	cin>>t;
	while(t--) solve();
	return 0;
}