行车路线（CCF201712-4）

传送门

题解：这个题因为有个大道和小道，又因为小道算的时候要累加长度，所以得提前用弗洛伊德算法处理下，之后跑最短路，从最大道来的可以继续走大道和小道，从小道来的只能走大道，是个最短路变形。

附上代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

typedef long long ll;

const int maxn=550;
const ll inf=1e18;

ll big[maxn][maxn];
ll small[maxn][maxn];
ll sdist[maxn];
ll bdist[maxn];
bool book[maxn];

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            big[i][j]=inf;
            small[i][j]=inf;
        }
    }
    int t,a,b,c;
    for(int i=0;i<m;i++){
        scanf("%d%d%d%d",&t,&a,&b,&c);
        if(t==0&&big[a][b]>c){
            big[a][b]=c;
            big[b][a]=c;
        }else if(t==1&&small[a][b]>c){
            small[a][b]=c;
            small[b][a]=c;
        }
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(small[i][j]>small[i][k]+small[k][j]){
                    small[i][j]=small[i][k]+small[k][j];
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        sdist[i]=bdist[i]=inf;
    }
    for(int i=1;i<=n;i++){
        book[i]=false;
    }
    sdist[1]=bdist[1]=0;
    int u,type;
    ll minn;
    for(;;){
        minn=inf;
        for(int j=1;j<=n;j++){
            if(!book[j]&&bdist[j]<minn){
                minn=bdist[j];
                u=j;
                type=1;
            }
        }
        for(int j=1;j<=n;j++){
            if(!book[j]&&sdist[j]<minn){
                minn=sdist[j];
                u=j;
                type=0;
            }
        }
        book[u]=1;
        if(u==n){
            break;
        }
        if(type==0){
            for(int j=1;j<=n;j++){
                if(big[u][j]!=inf&&minn+big[u][j]<bdist[j]){
                    bdist[j]=minn+big[u][j];
                }
            }
        }else if(type==1){
            for(int j=1;j<=n;j++){
                if(small[u][j]!=inf&&minn+small[u][j]*small[u][j]<sdist[j]){
                    sdist[j]=minn+small[u][j]*small[u][j];
                }
            }
            for(int j=1;j<=n;j++){
                if(big[u][j]!=inf&&minn+big[u][j]<bdist[j]){
                    bdist[j]=minn+big[u][j];
                }
            }
        }
    }
    if(bdist[n]<sdist[n]){
        printf("%lld\n",bdist[n]);
    }else{
        printf("%lld\n",sdist[n]);
    }
    return 0;
}