第五章树 21 AcWing 1596. 供应链最低价格

╰+哭是因爲堅強的太久メ 2023-09-24 14:06 78阅读 0赞

## 第五章 树 21 AcWing 1596. 供应链最低价格 ##

### 原题链接 ###

[AcWing 1596. 供应链最低价格][AcWing 1596.]

### 算法标签 ###

树的遍历 树形DP

### 思路 ###

与该题思路类似， [第五章 树 19 AcWing 1565. 供应链总销售额][_ 19 AcWing 1565.]  
依题意模拟即可

### 代码 ###

#pragma GCC optimize(2)
    #pragma GCC optimize(3)
    #include<bits/stdc++.h>
    #define int long long
    #define x first
    #define y second
    #define ump unordered_map
    #define pq priority_queue
    #define rep(i, a, b) for(int i=a;i<b;++i)
    #define Rep(i, a, b) for(int i=a;i>=b;--i)
    using namespace std;
    typedef pair<int, int> PII;
    const int N = 100005;
    int n;
    double p, r;
    int f[N], d[N];
    bool leaf[N];
    inline int rd(){
       int s=0,w=1;
       char ch=getchar();
       while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
       while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
       return s*w;
    }
    void put(int x) {
        if(x<0) putchar('-'),x=-x;
        if(x>=10) put(x/10);
        putchar(x%10^48);
    }
    int dfs(int u){
        if(f[u]==-1){
            return d[u]=0;
        }
        if(d[u]!=-1){
            return d[u];
        }
        return d[u]=dfs(f[u])+1;
    }
    signed main(){
    	ios::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
    	memset(f, -1, sizeof f);
    	scanf("%lld %lf %lf", &n, &p, &r);
    	rep(i, 0, n){
    	    int id, k,son;
    	    scanf("%lld", &k);
    	    rep(j, 0, k){
    	        scanf("%lld", &son);
    	        f[son]=i;
    	    }
    	    if(!k){
    	        leaf[i]=true;
    	    }
    	}
    	int mn=N, cnt=0;
    	memset(d, -1, sizeof d);
    	rep(i, 0, n){
    	    if(leaf[i]){
    	        if(dfs(i)<mn){
    	            mn=dfs(i);
    	            cnt=1;
    	        }else if(dfs(i)==mn){
    	            cnt++;
    	        }
    	    }
    	}
    	printf("%.4lf %lld", p*pow(1+r/100, mn), cnt);
    	return 0;
    }

### 参考文献 ###

[AcWing 1596. 供应链最低价格（PAT甲级辅导课）y总视频讲解][AcWing 1596. _PAT_y]

原创不易  
转载请标明出处  
如果对你有所帮助 别忘啦点赞支持哈  
![在这里插入图片描述][9cb4cb80a18345158f8a69e2f196e5b9.png]

[AcWing 1596.]: https://www.acwing.com/problem/content/1598/
[_ 19 AcWing 1565.]: https://blog.csdn.net/T_Y_F_/article/details/127822386
[AcWing 1596. _PAT_y]: https://www.acwing.com/video/1186/
[9cb4cb80a18345158f8a69e2f196e5b9.png]: https://img-blog.csdnimg.cn/9cb4cb80a18345158f8a69e2f196e5b9.png