PAT 1087

#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<string>
#include <iomanip> 
using namespace std;
int N,K;
string START;
int data[210][210] ;
int Max=1,g=1;


string *city;
int *happy;
int NUM=0;
int COST=-1;
int HAPPY=-1;
vector<int>ans;
int getindex(const string &a)
{
int i=0;
for(i=0;i<N;i++)
{
if(city[i]==a)
return i;
}
}
void man(int index,int sumcost,int sumhappy,vector<int>road)
{
if(city[index]=="ROM")
{
if(sumcost<COST||COST==-1)
{
NUM=1;
COST=sumcost;
HAPPY=sumhappy;
ans=road;
}
else if(sumcost==COST)
{
NUM++;
if(sumhappy>HAPPY)
{
HAPPY=sumhappy;
ans=road;
}
else if(sumhappy==HAPPY)
{
if(sumhappy/road.size()>(HAPPY/ans.size()))
{
ans=road;
}
}


}
return ;
}
for(int i=1;i<N;i++)
{
if(data[index][i]!=-1&&find(road.begin(),road.end(),i)==road.end())
{
// man(int index,int sumcost,int sumhappy,vector<int>road)
road.push_back(i);
man(i,sumcost+data[index][i],sumhappy+happy[i],road);
road.pop_back();
}
}
}
//#define fin cin  
int main()  
{  

/*ifstream fin("d:\in.txt" ); 
if (! fin.is_open())  
{ 
cout << "Error opening file";
system("pause");
exit (1); 
}*/
cin>>N>>K;
city =new string[N];
happy=new int[N];
cin>>city[0];
happy[0]=0;
for(int i=0;i<=N;i++)
for(int j=0;j<=N;j++)
{
data[i][j]=-1;
}
for(int i=1;i<N;i++)
{
cin>>city[i]>>happy[i];
}
string a,b;
int aindex,bindex;
for(int i=0;i<K;i++)
{
cin>>a>>b;
aindex=getindex(a);
bindex=getindex(b);
cin>>data[aindex][bindex];
data[bindex][aindex]=data[aindex][bindex];
}
//man()
vector<int>road;
road.push_back(0);
man(0,0,0,road);
cout<<NUM<<" "<<COST<<" "<<HAPPY<<" "<<HAPPY/(ans.size()-1)<<endl;
cout<<city[0];
for(int i=1;i<ans.size();i++)
{
cout<<"->"<<city[ans[i]];
}


system("PAUSE");  
    return 0;  
}