【考研每日一题22】I Wanna Go Home（C++）

原题地址：牛客网

题目描述：

    The country is facing a terrible civil war----cities in the country are divided into two parts supporting different leaders. As a merchant, Mr. M does not pay attention to politics but he actually knows the severe situation, and your task is to help him reach home as soon as possible.     "For the sake of safety,", said Mr.M, "your route should contain at most 1 road which connects two cities of different camp."     Would you please tell Mr. M at least how long will it take to reach his sweet home?

输入描述:

    The input contains multiple test cases.
    The first line of each case is an integer N (2<=N<=600), representing the number of cities in the country.
    The second line contains one integer M (0<=M<=10000), which is the number of roads.
    The following M lines are the information of the roads. Each line contains three integers A, B and T, which means the road between city A and city B will cost time T. T is in the range of [1,500].
    Next part contains N integers, which are either 1 or 2. The i-th integer shows the supporting leader of city i. 
    To simplify the problem, we assume that Mr. M starts from city 1 and his target is city 2. City 1 always supports leader 1 while city 2 is at the same side of leader 2. 
    Note that all roads are bidirectional and there is at most 1 road between two cities.
Input is ended with a case of N=0.

输出描述:

    For each test case, output one integer representing the minimum time to reach home.
    If it is impossible to reach home according to Mr. M's demands, output -1 instead.

示例1

输入

2
1
1 2 100
1 2
3
3
1 2 100
1 3 40
2 3 50
1 2 1
5
5
3 1 200
5 3 150
2 5 160
4 3 170
4 2 170
1 2 2 2 1
0

输出

100
90
540

分析：

题目大意是，有个人要从1走到2，然后呢1和2周围是有很多城市的，会给你每个城市之间的距离，且这些城市其实是有领导者的，领导者有1和2，走不同领导者的阵营的情况只可以出现一次（意思是如果你一开始走了1->2，那之后必须全部在2的阵营走。）求从城市1到城市2的最短距离。

这其实是一个带有条件的无向图的最短路问题。

用迪杰斯特拉可以解出。

（友情提醒，前几次wa只是因为少了个break）

代码：

#include<iostream>
#include<string.h>
#include<cmath>
using namespace std;
#define INF 9999999
int d[601][601];//记录每个城市之间距离
int g[601];//记录每个城市的领导者
int dis[601];
int book[601];
int n,m;
void dijkstra()
{
    for(int i=1;i<=n;i++)
    {
        dis[i]=d[1][i];
    }
    memset(book,0,sizeof(book));
    int minn;
    for(int i=1;i<n;i++)
    {
        int jud=1;
        minn=INF;
        int u;
		for(int j=1;j<=n;j++){
			if(book[j]==0&&dis[j]<minn){
				minn=dis[j];
				u=j;
			}
		}
		if(g[u]!=g[1])jud=2;
		book[u]=1;
		if(u==2)break;
		for(int v=1;v<=n;v++){
            if(jud==1||(jud==2&&g[v]==g[u])){
                if(d[u][v]<INF){
                    if(dis[v]>dis[u]+d[u][v])
                        dis[v]=dis[u]+d[u][v];
                }
            }
		}
    }
}
int main()
{
    while(cin>>n)
    {
        if(n==0)break;
        cin>>m;
        memset(d,INF,sizeof(d));
        memset(g,INF,sizeof(g));
        memset(dis,INF,sizeof(dis));
        int a,b,s;
        for(int i=0;i<m;i++)
        {
            cin>>a>>b>>s;
            d[a][b]=d[b][a]=min(s,d[a][b]);
        }
        for(int i=1;i<=n;i++)
        {
            d[i][i]=0;
            cin>>s;
            g[i]=s;
        }
        dijkstra();
        if(dis[2]==d[1][2])cout<<"-1"<<endl;
        else cout<<dis[2]<<endl;
    }
    return 0;
}

2020.4.10