A1090. Highest Price in Supply Chain (25)
来源:互联网 发布:linux svn 重试3次 编辑:程序博客网 时间:2024/05/22 12:08
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.
Starting from one root supplier, everyone on the chain buys products from one's supplier in a price P and sell or distribute them in a price that is r% higher than P. It is assumed that each member in the supply chain has exactly one supplier except the root supplier, and there is no supply cycle.
Now given a supply chain, you are supposed to tell the highest price we can expect from some retailers.
Input Specification:
Each input file contains one test case. For each case, The first line contains three positive numbers: N (<=105), the total number of the members in the supply chain (and hence they are numbered from 0 to N-1); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then the next line contains N numbers, each number Si is the index of the supplier for the i-th member. Sroot for the root supplier is defined to be -1. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the highest price we can expect from some retailers, accurate up to 2 decimal places, and the number of retailers that sell at the highest price. There must be one space between the two numbers. It is guaranteed that the price will not exceed 1010.
Sample Input:9 1.80 1.001 5 4 4 -1 4 5 3 6Sample Output:
1.85 2
注意一点,注意变量生命周期。/* for(i=0;i<child[index].size();i++) { dfs(child[index][i],depth+1); } */ for(int i = 0; i < child[index].size(); i++) dfs(child[index][i], depth + 1);}第一种没注意i,和后边递归的冲突了,导致答案错误。#include <cstdio>#include <cmath>#include <vector>using namespace std;int n, maxdepth = 0, num = 0, temp, root;vector<int> child[100010];void dfs(int index, int depth) { if(child[index].size() == 0) { if(maxdepth == depth) num++; if(maxdepth < depth) { maxdepth = depth; num = 1; } return ; } for(int i = 0; i < child[index].size(); i++) dfs(child[index][i], depth + 1);}int main() {freopen("data.in","r",stdin); double p, r; scanf("%d %lf %lf", &n, &p, &r); for(int i = 0; i < n; i++) { scanf("%d", &temp); if(temp == -1) root = i; else child[temp].push_back(i); } dfs(root, 0); printf("%.2f %d", p * pow(1 + r/100, maxdepth), num); return 0;}
- A1090. Highest Price in Supply Chain (25)
- PAT A1090 Highest Price in supply chain
- PAT A1090. Highest Price in Supply Chain (25)
- pat-a1090. Highest Price in Supply Chain (25)
- PAT A1090 highest price of supply chain(25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- 1090. Highest Price in Supply Chain (25)
- nginx 502问题
- 9.什么是send或者WSASend?
- 包装类
- 北京文安科技发展有限公司招聘简介
- 年度总结----给自己一个答案
- A1090. Highest Price in Supply Chain (25)
- 技能库--统计文件大小 +Fork-Join(90)
- iOS应用开发基础(三)基础知识
- Activity
- 根据文本最大字符数进行字符串截取
- 电源芯片选型之:ADC对纹波要求计算
- 【计算机视觉】OpenCV读取视频获取时间戳等信息(PS:经测试并不是时间戳,与FFMPEG时间戳不一样)
- 10秒定时炸弹
- PHP生成数据字典代码