#include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         
          using namespace std;using std::vector;using std::queue;const int maxn=100010;struct node{ double data; vector
          
           child; int layer=0;}Node[maxn];int n;double p,r;vector
           
            leaf;void BFS(int x){ int layer=0; queue
            
             q; q.push(x); while(!q.empty()){ layer++; int index; int length=q.size(); for(int i=0;i