L2-020 功夫传人

 题目：https://pintia.cn/problem-sets/994805046380707840/problems/994805059118809088

第一次用堆栈处理的（好麻烦，还是菜）

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int main(){
	int n,k;
	double z,r,sum = 0.0;
	scanf("%d %lf %lf",&n,&z,&r);
	vector<vector<int> > v(100005);
	vector<double> skill(n+5,0);
	skill[0] = z;
	for(int i = 0;i < n;i++){
		scanf("%d",&k);
		int t;
		if(k == 0){
			scanf("%d",&t);
			t = -t;
			v[i].push_back(t);
		}else{
			for(int j = 0;j < k;j++){
			scanf("%d",&t);
			v[i].push_back(t);
			}
		}
	}
	queue<int> q;
	for(int i = 0;i < v[0].size();i++){
		if(v[0][0] < 0){
			sum = skill[0] * -v[0][0];
		}
		else{
			q.push(v[0][i]);
			skill[v[0][i]] = skill[0] * (1-r/100);
		}
		
	}
	while(!q.empty()){
		int t = q.front();
		q.pop();
		if(v[t][0] < 0){
			skill[t] *= -v[t][0];
				sum += skill[t];
		}
		else{
			for(int i = 0;i < v[t].size();i++){
				q.push(v[t][i]);
				skill[v[t][i]] = skill[t] * (1-r/100);
			}
		}
		
	}
	printf("%d",(int)sum);	
}
	

第二次考虑用dfs

#include<iostream>
#include<vector>
using namespace std;
int n,k;
double z,r,sum = 0.0;
vector<vector<int> > v(100005);
bool visit[100005];
void dfs(int i,double power){
	if(visit[i]){
		sum += power * v[i][0];
		return;
	}
	for(int j = 0;j < v[i].size();j++){
		dfs(v[i][j],power * (1 - r / 100));
	}
}
int main(){
	scanf("%d %lf %lf",&n,&z,&r);
	for(int i = 0;i < n;i++){
		scanf("%d",&k);
		int t;
		if(k == 0){
			visit[i] = true;
			scanf("%d",&t);
			v[i].push_back(t);
		}else{
			for(int j = 0;j < k;j++){
				scanf("%d",&t);
				v[i].push_back(t);
			}
		}
	}
	dfs(0,z);
	printf("%d",(int)sum);
}