PAT A1079 tota sales of supply chain （25）

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int n;
double rootprice,rttsum=0,r;
struct node{
double price;//layer function
int layer;
int num;
vector<int> receive;
}node[100010];
void BFS(){
queue<int> q;
int root=0;
node[0].price=rootprice;
node[0].layer=1;
q.push(root);
while(!q.empty()){
int front=q.front();
q.pop();
for(int i=0;i<node[front].receive.size();i++){
node[node[front].receive[i]].layer=node[front].layer+1;
node[node[front].receive[i]].price=node[front].price*(1+(r/100));
q.push(node[front].receive[i]);
}


}
for(int i=0;i<n;i++){
if(node[i].receive.size()==0){
rttsum+=(node[i].num*node[i].price);
}
}
printf("%.1f\n",rttsum);
}
int main(){
scanf("%d%lf%lf",&n,&rootprice,&r);
int i,k,pnum,j,id;
for(i=0;i<n;i++){
scanf("%d",&k);
if(k!=0){
for(j=0;j<k;j++){
scanf("%d",&id);
node[i].receive.push_back(id);
}
}
else{
scanf("%d",&pnum);
node[i].num=pnum;
}
}
BFS();
system("pause");
return 0;
}