pat 1106. Lowest Price in Supply Chain (25)
2016-07-23 22:03
405 查看
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. Only the retailers will face the customers.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 lowest price a customer 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 their ID's are numbered from 0 to N-1, and the root supplier's ID
is 0); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then N lines follow, each describes a distributor or retailer in the following format:
Ki ID[1] ID[2] ... ID[Ki]
where in the i-th line, Ki is the total number of distributors or retailers who receive products from supplier i, and is then followed by the ID's of these distributors or retailers. Kj being 0 means that the j-th member is a retailer.
All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the lowest price we can expect from some retailers, accurate up to 4 decimal places, and the number of retailers that sell at the lowest price. There must be one space between the two numbers. It is guaranteed that the
all the prices will not exceed 1010.
Sample Input:
Sample Output:
最近做二叉树的题目做上瘾了。
关键点:建树,求出深度最浅的叶子结点的深度及其数目即可。
#include <iostream>
#include<string.h>
#include<stack>
#include<vector>
using namespace std;
#include<stdio.h>
#include<algorithm>
#include<queue>
vector<int>tree[150000];
int n,mm,ans[150000];
double p,r,t;
void dfs(int u,int depth)
{
int i;
if(tree[u].size()==0)
{
mm=min(mm,depth);
ans[depth]++;
return ;
}
for(i=0;i<tree[u].size();i++)
{
dfs(tree[u][i],depth+1);
}
}
int main()
{
int i,k,j,num;
cin>>n>>p>>r;
for(i=0;i<n;i++)
{
cin>>k;
for(j=0;j<k;j++)
{
cin>>num;
tree[i].push_back(num);
}
}
mm=999999;
dfs(0,1);
t=1;
for(i=1;i<mm;i++)
t=t*(1+r*1.0/100);
printf("%.4lf %d\n",t*p,ans[mm]);
return 0;
}
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. Only the retailers will face the customers.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 lowest price a customer 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 their ID's are numbered from 0 to N-1, and the root supplier's ID
is 0); P, the price given by the root supplier; and r, the percentage rate of price increment for each distributor or retailer. Then N lines follow, each describes a distributor or retailer in the following format:
Ki ID[1] ID[2] ... ID[Ki]
where in the i-th line, Ki is the total number of distributors or retailers who receive products from supplier i, and is then followed by the ID's of these distributors or retailers. Kj being 0 means that the j-th member is a retailer.
All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the lowest price we can expect from some retailers, accurate up to 4 decimal places, and the number of retailers that sell at the lowest price. There must be one space between the two numbers. It is guaranteed that the
all the prices will not exceed 1010.
Sample Input:
10 1.80 1.00 3 2 3 5 1 9 1 4 1 7 0 2 6 1 1 8 0 0 0
Sample Output:
1.8362 2
最近做二叉树的题目做上瘾了。
关键点:建树,求出深度最浅的叶子结点的深度及其数目即可。
#include <iostream>
#include<string.h>
#include<stack>
#include<vector>
using namespace std;
#include<stdio.h>
#include<algorithm>
#include<queue>
vector<int>tree[150000];
int n,mm,ans[150000];
double p,r,t;
void dfs(int u,int depth)
{
int i;
if(tree[u].size()==0)
{
mm=min(mm,depth);
ans[depth]++;
return ;
}
for(i=0;i<tree[u].size();i++)
{
dfs(tree[u][i],depth+1);
}
}
int main()
{
int i,k,j,num;
cin>>n>>p>>r;
for(i=0;i<n;i++)
{
cin>>k;
for(j=0;j<k;j++)
{
cin>>num;
tree[i].push_back(num);
}
}
mm=999999;
dfs(0,1);
t=1;
for(i=1;i<mm;i++)
t=t*(1+r*1.0/100);
printf("%.4lf %d\n",t*p,ans[mm]);
return 0;
}
相关文章推荐
- git 使用场景一,pull报错:Auto Merge Failed; Fix Conflicts and Then Commit the Result.
- raise()
- raise()
- codeforces #300 E. Demiurges Play Again(tree DP)
- HDU 4458 Shoot the Airplane(计算几何or数学)
- HDU 4460 Friend Chains(最短路)
- rails 做api接口入门说明
- Tree Traversals Again
- POJ1995 Raising Modulo Numbers
- 【bzoj4320】ShangHai2006 Homework
- HDU - 5319 Painter
- [Rails]route.rb理解积累
- 使用flash air开发应用
- Cassandra User 问题汇总(1)------------repair
- Cassandra User 问题汇总(1)------------repair
- 【HDU】-1789-Doing Homework again(贪心,好)
- 219. Contains Duplicate II
- NSSearchPathForDirectoriesInDomains用法--转自平静大海
- 217. Contains Duplicate
- HDOJ 1789 Doing Homework again