L2-020. 功夫传人 CCCC-DFS

点击打开链接

#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#define pi acos(-1)
#define endl '\n'
#define me(x) memset(x,0,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,-1,-1,1,1};
const int dy[]={0,1,0,-1,1,-1,1,-1};
const int maxn=1e3+5;
const int maxx=1e6+100;
const double EPS=1e-7;
const int mod=1000000007;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
//typedef tree<pt,null_type,less< pt >,rb_tree_tag,tree_order_statistics_node_update> rbtree;
/*lch[root] = build(L1,p-1,L2+1,L2+cnt);
rch[root] = build(p+1,R1,L2+cnt+1,R2);中前*/
/*lch[root] = build(L1,p-1,L2,L2+cnt-1);
rch[root] = build(p+1,R1,L2+cnt,R2-1);中后*/
long long gcd(long long a , long long b){if(b==0) return a;a%=b;return gcd(b,a);}

vector<int >G[maxx];//存图
int vis[maxx],n;//vis标记得道者
double g[maxx];//g[i] 存i的功力值  
double z,r;
double ans=0;

void dfs(int x)
{
for(int i=0;i<G[x].size();i++)
{
double ss=g[x]*(100-r)*0.01;
if(vis[G[x][i]])
{
ans+=ss*vis[G[x][i]];
}
else
{
g[G[x][i]]=ss;
dfs(G[x][i]);
}
}
}

int main()
{
cin>>n>>z>>r;
for(int i=0;i<n;i++)
{
int m,a;
cin>>m;
if(m==0)
{
cin>>a;
vis[i]=a;
}
else
{
while(m--)
{
cin>>a;
G[i].push_back(a);
}
}
}
if(n==1)
{
ans=vis[0]*z;//特判只有祖师爷  
}
else
{
g[0]=z;
dfs(0);
}
cout<<(int)ans<<endl;
}