四川第七届 I Travel（bfs）

Travel

The country frog lives in has nn towns which are conveniently numbered by 1,2,…,n1,2,…,n.

Among n(n−1)2n(n−1)2 pairs of towns, mm of them are connected by bidirectional highway, which needs aa minutes to travel. The other pairs are connected by railway, which needs bb minutes to travel.

Find the minimum time to travel from town 11 to town nn.

Input

The input consists of multiple tests. For each test:

The first line contains 44 integers n,m,a,bn,m,a,b (2≤n≤105,0≤m≤5⋅105,1≤a,b≤1092≤n≤105,0≤m≤5⋅105,1≤a,b≤109). Each of the following mmlines contains 22 integers ui,viui,vi, which denotes cities uiui and vivi are connected by highway. (1≤ui,vi≤n,ui≠vi1≤ui,vi≤n,ui≠vi).

Output

For each test, write 11 integer which denotes the minimum time.

Sample Input

    3 2 1 3
    1 2
    2 3
    3 2 2 3
    1 2
    2 3

Sample Output

    2
    3

题意:有n个城市,编号为1~n,每个城市都相互连通,其中有m对城市通过公路连通,其他的城市通过铁路连通,经过公路的时间为a,
经过铁路的时间为b,问从1到达n的时间最短为多少.

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
#define  ll long long
using namespace std;
int n,m;
ll a,b;
vector<int>v[];
struct node
{
    int v;
    ll t;
};
queue<node>q;
bool bo[];
ll min1(ll a,ll b)
{
    if(a>b)return b;
    return a;
}
int main()
{
    while(~scanf("%d %d %lld %lld",&n,&m,&a,&b))
    {
        while(!q.empty()) q.pop();
        for(ll i=;i<;i++) v[i].clear();
        memset(bo,,sizeof(bo));
        bool bb=;
        for(ll i=;i<=m;i++)
        {
            int x,y;
            scanf("%d %d",&x,&y);
            v[x].push_back(y);
            v[y].push_back(x);
            if((x==&&y==n)||(x==n&&y==))bb=;//可能高速比公路慢
        }
        if(a>=b)
        {//挑出与n没有高速公路的点中存不存在与1也没有高速公路的点
            if(bb==)printf("%d\n",b);
            else
            {
                for(int i=;i<n;i++)
                {
                    bool is=;
                    for(int j=;j<v[i].size();j++)
                    {
                        if(v[i][j]==||v[i][j]==n)is=;
                    }
                    if(is==)
                    {
                        bb=;break;
                    }
                }
                if(bb==)printf("%d\n",min(a,*b));
                else printf("%d\n",a);
            }
            continue;
        }
        node s;
        s.v=;
        s.t=;
        q.push(s);
        ll mx=b;
        bo[]=;
        bool f=;
        while(!q.empty())
        {
            node s;
            s=q.front();
            q.pop();
            for(int i=;i<v[s.v].size();i++)
            {
                int y=v[s.v].at(i);
                if(bo[y]) continue;
                if(y==n)
                {
                    mx=min1(mx,(s.t+)*a);
                    f=;
                    break;
                }
                node ss;
                ss.t=s.t+;
                ss.v=y;
                q.push(ss);
            }
            if(f)break;
        }
        printf("%lld\n",mx);
    }
    return ;
}