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 (≤), 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 −. 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 1.
Sample Input:
9 1.80 1.00 1 5 4 4 -1 4 5 3 6
Sample Output:
1.85 2
#include<iostream>
#include<vector>
using namespace std;
#define maxn 10005
vector<int>node[maxn];
int n, maxh = 0, num = 0;
double p, r;
void DFS(int index, int h)
{
if (index > n)return;
if (node[index].size() == 0)
{
if (h > maxh)
{
num = 1;
maxh = h;
}
else if (h == maxh)
num++;
return;
}
for (int i = 0; i < node[index].size(); i++)
DFS(node[index][i], h + 1);
}
int main()
{
FILE* stream1;
freopen_s(&stream1, "input.txt", "r", stdin);
cin >> n >> p >> r;
r /= 100;
int par,root;
for (int i = 0; i < n; i++)
{
cin >> par;
if (par != -1)
node[par].push_back(i);
else
root = i;
}
DFS(root, 0);
/*for (int i = 0; i < maxh; i++)
p *= (1 + r);*/
//用pow函数代替
printf("%.2f %d\n", p*pow(1+r,maxh), num);
return 0;
} 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 total sales from all the retailers.
Input Specification:
Each input file contains one test case. For each case, the first line contains three positive numbers: N (≤), 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 unit 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, then instead the total amount of the product will be given after Kj. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the total sales we can expect from all the retailers, accurate up to 1 decimal place. It is guaranteed that the number will not exceed 1.
Sample Input:
10 1.80 1.00 3 2 3 5 1 9 1 4 1 7 0 7 2 6 1 1 8 0 9 0 4 0 3
Sample Output:
42.4
#include<iostream>
#include<vector>
using namespace std;
#define maxn 100005
struct nod
{
double data;
vector<int>child;
}node[maxn];
int n, maxh = 0, num = 0;
double p, r,ans = 0;
void DFS(int index, int h)
{
if (node[index].child.size() == 0)
{
ans += node[index].data * pow(1 + r, h);
return;
}
for (int i = 0; i < node[index].child.size(); i++)
DFS(node[index].child[i], h + 1);
}
int main()
{
cin >> n >> p >> r;
r /= 100;
int k,child;
for (int j = 0; j < n; j++)
{
cin >> k;
if (k == 0)
cin >> node[j].data;
else
{
for (int i = 0; i < k; i++)
{
cin >> child;
node[j].child.push_back(child);
}
}
}
DFS(0, 0);
printf("%.1f\n", p*ans);
return 0;
} 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 (≤), 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 1.
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<vector>
#include<iomanip>
using namespace std;
const int maxn = 100005;
vector<int>node[maxn];
int num = 0,minh=100005;
void DFS(int index, int h)
{
if (node[index].size() == 0)
{
if (h < minh)
{
num =1;
minh = h;
}
else if (h == minh)
num++;
return;
}
for (int i = 0; i < node[index].size(); i++)
DFS(node[index][i], h + 1);
}
int main()
{
FILE* stream1;
freopen_s(&stream1, "input.txt", "r", stdin);
int n, k,child;
double p, r;
cin >> n >> p >> r;
r /= 100;
for (int i = 0; i < n; i++)
{
cin >> k;
if (k != 0)
{
for (int j = 0; j < k; j++)
{
cin >> child;
node[i].push_back(child);
}
}
}
DFS(0, 0);
cout << fixed << setprecision(4) << p * pow(1 + r,minh) << " " << num << endl;
return 0;
} 剪枝版本
#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
const int maxn = 100005;
vector<int>node[maxn];
int num = 0,minh=100005;
void DFS(int index, int h)
{
if (node[index].size() == 0)
{
if (h < minh)
{
num =1;
minh = h;
}
else if (h == minh)
num++;
return;
}
if (h <minh)//提前剪枝，当当前节点的深度>=最小深度时，则不用再继续DFS了，直接返回
{
for (int i = 0; i < node[index].size(); i++)
{
DFS(node[index][i], h + 1);
}
}
}
int main()
{
FILE* stream1;
freopen_s(&stream1, "input.txt", "r", stdin);
int n, k,child;
double p, r;
cin >> n >> p >> r;
r /= 100;
for (int i = 0; i < n; i++)
{
cin >> k;
if (k != 0)
{
for (int j = 0; j < k; j++)
{
cin >> child;
node[i].push_back(child);
}
}
}
DFS(0, 0);
cout << fixed << setprecision(4) << p * pow(1 + r,minh) << " " << num << endl;
return 0;
} 
京公网安备 11010502036488号