浙大PAT1106

//常规题，深度优先

#include<iostream>

#include<fstream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<string>
#include <iomanip> 
using namespace std;
int N;
double P,R;
vector<int> data[100010];
int deep=-1;
int NUM=0;
void df(int index,int de)
{
if(index>=N)
{
if(deep==-1)
{
deep=de;
NUM=1;
}
else if(de<deep)
{
deep=de;
NUM=1;
}
else if(de==deep)
{
deep=de;
NUM++;
}




}
if(data[index][0]==0)
{
if(deep==-1)
{
deep=de;
NUM=1;
}
else if(de<deep)
{
deep=de;
NUM=1;
}
else if(de==deep)
{
deep=de;
NUM++;
}
}
if(de>deep&&deep!=-1)
return ;  //剪枝
for(int i=0;i<data[index].size();i++)
{
df(data[index][i],de+1);
}
}


//#define fin cin  
int main()  
{  

/*ifstream fin("d:\in.txt" ); 
if (! fin.is_open())  
{ 
cout << "Error opening file";
system("pause");
exit (1); 
}*/
cin>>N>>P>>R;
int num,temp;
for(int i=0;i<N;i++)
{
cin>>num;
if(num==0)
{
data[i].push_back(0);
}
else
{
for(int j=0;j<num;j++)
{
cin>>temp;
data[i].push_back(temp);
}
}
}
//void df(int index,int de)
df(0,0);
cout <<setiosflags(ios::fixed);
cout <<setprecision(4) <<P*pow((1+R/100),deep)<<" "<<NUM<<endl;
//cout<<P*pow((1+R/100),deep)<<" "<<NUM<<endl;






system("PAUSE");  
    return 0;  
}