pat1087. All Roads Lead to Rome (30)

1087. All Roads Lead to Rome (30)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers N (2<=N<=200), the number of cities, and K, the total number of routes between pairs of cities; followed by the name of the starting city. The next N-1 lines each gives the name of a city and an integer that represents the happiness one can gain from that city, except the starting city. Then K lines follow, each describes a route between two cities in the format "City1 City2 Cost". Here the name of a city is a string of 3 capital English letters, and the destination is always ROM which represents Rome.

Output Specification:

For each test case, we are supposed to find the route with the least cost. If such a route is not unique, the one with the maximum happiness will be recommended. If such a route is still not unique, then we output the one with the maximum average happiness -- it is guaranteed by the judge that such a solution exists and is unique.

Hence in the first line of output, you must print 4 numbers: the number of different routes with the least cost, the cost, the happiness, and the average happiness (take the integer part only) of the recommended route. Then in the next line, you are supposed to print the route in the format "City1->City2->...->ROM".

Sample Input:

6 7 HZH
ROM 100
PKN 40
GDN 55
PRS 95
BLN 80
ROM GDN 1
BLN ROM 1
HZH PKN 1
PRS ROM 2
BLN HZH 2
PKN GDN 1
HZH PRS 1

Sample Output:

3 3 195 97
HZH->PRS->ROM

---

提交代码

 

pat中类似的题目做得比较多，现在总结一下：

1.最大和初始距离为-1。这个条件不管是dis[]，还是mindis，在使用Dijstra的时候，更新邻边当前最短路和求当前最短路的点的时候要注意，边不可到初始点的点先剔除。

2.对比string要比对比int慢很多，所要转换映射。

3.相邻点的数学关系要分析清楚。

4.最好加vis，可以更清晰。

5.初始点的初始化不要忘记！！

#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<stack>
#include<set>
#include<map>
#include<vector>
using namespace std;
map<string,int> city;//string-int
map<int,string> rcity;
map<int,vector<pair<int,int> > > edge;
int dis[205],path[205],hcount[205],happ[205],fstep[205],f[205];
bool vis[205];
int main()
{
    //freopen("D:\\INPUT.txt","r",stdin);
    int n,k,i,d,s;
    string st,u,v;
    scanf("%d %d",&n,&k);
    memset(dis,-1,sizeof(dis));//每个点的最短路长
    memset(hcount,-1,sizeof(hcount));//幸福指数之和
    memset(vis,false,sizeof(vis));//是否计算过最短路径
    memset(path,0,sizeof(path));//前一个点
    memset(fstep,0,sizeof(fstep));//到这个点需要几步
    cin>>st;//起始城市
    city[st]=0;//编号
    rcity[0]=st;//反编号
    happ[0]=0;
    dis[0]=0;
    hcount[0]=0;
    fstep[0]=0;
    path[0]=1;//init
    f[0]=0;
    for(i=1; i<n; i++)
    {
        f[i]=i;
        cin>>u;
        rcity[i]=u;
        city[u]=i;
        scanf("%d",&happ[i]);
    }

    /*for(i=0;i<n;i++){
        cout<<rcity[i]<<endl;
    }*/


    for(i=0; i<k; i++)
    {
        cin>>u>>v;
        scanf("%d",&d);
        //cout<<u<<" "<<v<<" "<<d<<endl;
        edge[city[u]].push_back(make_pair(city[v],d));

        edge[city[v]].push_back(make_pair(city[u],d));
    }

    /*for(i=0;i<n;i++){
        vector<pair<int,int> >::iterator it;
        cout<<"i:  "<<i<<endl;
        for(it=edge[i].begin(); it!=edge[i].end(); it++){
            cout<<it->first<<" "<<it->second<<endl;
        }
    }*/

    s=0;
    vector<pair<int,int> >::iterator it;
    int next;
    while(s!=city["ROM"])
    {

        //cout<<"s: "<<s<<endl;

        vis[s]=true;
        for(it=edge[s].begin(); it!=edge[s].end(); it++) //update
        {
            next=it->first;
            if(dis[next]==-1||dis[next]>dis[s]+it->second)
            {
                dis[next]=dis[s]+it->second;
                hcount[next]=hcount[s]+happ[next];
                path[next]=path[s];
                fstep[next]=fstep[s]+1;
                f[next]=s;
            }
            else
            {
                if(dis[next]==dis[s]+it->second)
                {
                    path[next]+=path[s];//
                    if(hcount[next]<hcount[s]+happ[next])
                    {
                        hcount[next]=hcount[s]+happ[next];
                        fstep[next]=fstep[s]+1;
                        f[next]=s;
                    }
                    else
                    {
                        if(hcount[next]==hcount[s]+happ[next])
                        {
                            if(fstep[next]>fstep[s]+1)
                            {
                                fstep[next]=fstep[s]+1;
                                f[next]=s;
                            }
                        }
                    }
                }
            }
        }

        /*for(i=1;i<n;i++){
            cout<<"i:  "<<i<<"  "<<dis[i]<<endl;
        }*/

        int mindis=-1,minnum;
        for(i=1;i<n;i++)//find the min
        {
            if(dis[i]==-1){//如果当前边到不了初始点，直接pass
                continue;
            }
            if(!vis[i]&&(mindis==-1||(dis[i]<mindis))){
                //cout<<"ii:  "<<i<<" "<<dis[i]<<endl;
                mindis=dis[i];
                minnum=i;
            }
        }

        //cout<<"minnum: "<<minnum<<" "<<dis[minnum]<<endl;

        s=minnum;
    }
    printf("%d %d %d %d\n",path[s],dis[s],hcount[s],hcount[s]/fstep[s]);
    int p=s;
    stack<int> ss;
    while(p){
        ss.push(p);
        p=f[p];
    }
    cout<<rcity[p];
    while(!ss.empty()){
        cout<<"->"<<rcity[ss.top()];
        ss.pop();
    }
    cout<<endl;
    return 0;
}