1079 Total Sales of Supply Chain (25 分)

版本2

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
const int N = 1e5+5;
vector<int> G[N];
int n;
int arr[N];
double p, r, res = 0;
void dfs(int rt,int d){
	if(G[rt].size() == 0){
		res += p*pow(1+r/100.0, d)*arr[rt];
		return; 
	}
	for(int i = 0; i < G[rt].size(); i++){
		dfs(G[rt][i], d + 1);
	}
}
int main(){
	int k, x;
	scanf("%d %lf %lf", &n, &p, &r);
	for(int i = 0; i < n; i++){
		scanf("%d", &k);
		if(k == 0){
			scanf("%d", arr+i);
			continue;
		}
		while(k--){
			scanf("%d", &x);
			G[i].push_back(x);
		}
	}
	dfs(0, 0);
	printf("%.1f\n", res);
	return 0;
} 

版本1

树的深搜

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
vector<int> v[maxn];
int mut[maxn]={0};
double t=0;
void dfs(int r,double p, double c){
	
	if(mut[r] !=0 ){
		t += p*mut[r];
	}else{
		p = p * (1 + c/100.0); 
	}
	for(int i=0;i<v[r].size();i++){
		int j = v[r][i];
		dfs(j,p,c);
	}
}
int main(){
	int n,k,num,tmp;
	double price,inc;
	cin>>n>>price>>inc;
	for(int i=0;i<n;i++){
		cin>>k;
		if(k==0){
			cin>>mut[i];
		}else{
			for(int j=0;j<k;j++){
				cin>>tmp;
				v[i].push_back(tmp);
			}
		}
	}
	dfs(0,price,inc);
	
	printf("%.1f\n",t);
	return 0;
}