I want to go hone——变形的Dijkstra

题目描述

    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

#include<iostream>
#include<vector>
using namespace std;
struct edge
{
    int cost;
    int next;
};
vector<edge>edges[10001];
int dis[1000];
bool mark[1000];
int leader[1000];
int newp;
int main()
{
    int n,m;
    edge E;
    while(cin>>n>>m&&n!=0)
    {
        for(int i=1;i<=n;i++)
        {
            edges[i].clear();
            mark[i]=false;
            dis[i]=-1;
        } //在用vector时记得clesr(),否则结果会报错
        for(int i=1;i<=m;i++)
        {
            int a,b,time;
            cin>>a>>b>>time;
            E.next=b;
            E.cost=time;
            edges[a].push_back(E);
            E.next=a;
            edges[b].push_back(E);
        }//建立无向图
        for(int i=1;i<=n;i++)
        {
            cin>>leader[i];
        }
        
        mark[1]=true;
        dis[1]=0;
        newp=1;
        for(int i=1;i<n;i++)
        {
            for(int j=0;j<edges[newp].size();j++)
            {
                int t=edges[newp][j].next;//与newp相连的边的顶点
                int c=edges[newp][j].cost;
                if(mark[t]==true)continue;
                if(leader[newp]==2&&leader[t]==1)continue;
                if(dis[t]==-1||dis[t]>dis[newp]+c)
                {
                    dis[t]=dis[newp]+c;
                }
            }//经过一轮的循环将newp相连的点的dis全部修改了一遍，接下来找到cost最小的边
            //所连接的顶点将其置为newp
            int minn=100000;
           for(int j=1;j<=n;j++)
            {
                if(mark[j])continue;
                if(dis[j]==-1)continue;
                if(minn>dis[j])
                    {
                        minn=dis[j];
                        newp=j;
                    }
            }
                mark[newp]=true;
        }

        cout<<dis[2]<<endl;
    }
    return 0;

}