团体程序设计天梯赛PTA L2-020功夫传人

 

 分析：题意不难理解，看上去就是不太难的题，然后WA了一天qaq

用bfs和并查集应该都能做，然后我没压缩好，一会超时一会超内存。最后用模拟stack存储辈分数降低了递归的时间复杂度。

#include <iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<stack>
using namespace std;
const int N = 1e5+10;

vector<int>ans;
map<int,int>mp;
int cnt=0;
int fa[N];
int gen[N];
stack<int>q;
void fstack(int n)
{
    while(!q.empty())
        q.pop();
    for(int i = 1; i < n; i ++)
    {
        if(fa[i]==0)
            gen[i]=1;
        else
        {
            q.push(i);
            while(gen[fa[q.top()]]!=0)
            {
                gen[q.top()] = gen[fa[q.top()]]+1;
                q.pop();
                if(q.empty())
                    break;
            }
        }
    }
}
int main()
{
    int n,m,a,flag;
    double z,r,bei[N]= {0},sum=0;
    scanf("%d%lf%lf",&n,&z,&r);
    fa[0] = 0;
    for(int  i = 0; i < n; i ++)
    {
        scanf("%d",&m);
        if(m==0)
        {
            scanf("%d",&a);
            ans.push_back(i);
            mp[i]=a;
        }
        else
        {
            for(int j = 0; j < m; j ++)
            {
                scanf("%d",&a);
                fa[a]=i;
            }
        }
    }
    fstack(n);
    bei[0] = z;
    double k = (100-r)/(double)100;
    for(int i = 1; i < n; i ++)
    {
        bei[i] = bei[i-1]*k;
    }
    vector<int>::iterator it;
    for(it = ans.begin(); it!=ans.end(); it++)
    {
        flag = *it;
        sum += bei[gen[flag]]*mp[flag];
    }
    int as = sum;
    printf("%d
",as);
    return 0;
}