PAT甲级1111

使用两次DIjikstra+dfs算法

#include <bits/stdc++.h>
using namespace std;

const int inf=99999;
int e[510][510],w[510][510],dis[510],weight[510],nodeNum[510];
bool visit[510];
int n,m,c1,c2;
vector<int> pre[510],pre2[510],dispath,timepath;

void dfsdispath(int v)
{
    dispath.push_back(v);
    if(v == c1) return ;
    dfsdispath(pre[v][0]);
}

void dfstimepath(int v)
{
    timepath.push_back(v);
    if(v == c1) return;
    dfstimepath(pre2[v][0]);
}

int main()
{
    cin >> n >> m;
    fill(e[0],e[0]+510*510,inf);
    fill(w[0],w[0]+510*510,inf);
    fill(dis,dis+510,inf);
    fill(weight,weight+510,inf);
    fill(nodeNum,nodeNum+510,inf);

    int a,b,c,d,ee;
    for(int i=0;i<m;i++)
    {
        scanf("%d %d %d %d %d",&a,&b,&c,&d,&ee);
        e[a][b] = d;
        w[a][b] = ee;
        if(c!=1)
        {
            e[b][a] = d;
            w[b][a]= ee;
        }
    }

    cin >> c1 >> c2;
    dis[c1] = 0;
    for(int i=0;i<n;i++)
    {
        int u=-1,minn = inf;
        for(int j=0;j<n;j++)
        {
            if(visit[j]==false && dis[j]<minn)
            {
                u = j;
                minn = dis[j];
            }
        }

        if(u==-1) break;
        visit[u] = true;
        for(int v=0;v<n;v++)
        {
            if(visit[v]==false && e[u][v]!=inf)
            {
                if(dis[u]+e[u][v]<dis[v])
                {
                    dis[v] = dis[u]+e[u][v];
                    weight[v] = weight[u]+w[u][v];
                    pre[v].clear();
                    pre[v].push_back(u);
                }else if(dis[u]+e[u][v]==dis[v] && weight[u]+w[u][v]<weight[v])
                {
                    weight[v] = weight[u]+w[u][v];
                    pre[v].clear();
                    pre[v].push_back(u);
                }
            }
        }
    }

    dfsdispath(c2);

    fill(visit,visit+510,false);
    fill(weight,weight+510,inf);
    weight[c1]=0;
    for(int i=0;i<n;i++)
    {
        int u=-1,minn=inf;
        for(int j=0;j<n;j++)
        {
            if(visit[j]==false && weight[j]<minn)
            {
                u = j;
                minn = weight[j];
            }
        }

        if(u==-1) break;
        visit[u] = true;
        for(int v=0;v<n;v++)
        {
            if(visit[v]==false && w[u][v]!=inf)
            {
                if(weight[u]+w[u][v]<weight[v])
                {
                    weight[v] = weight[u]+w[u][v];
                    pre2[v].clear();
                    pre2[v].push_back(u);
                    nodeNum[v] = 1+nodeNum[u];
                }else if(weight[u]+w[u][v]==weight[v] && nodeNum[u]+1<nodeNum[v])
                {
                    nodeNum[v] = nodeNum[u]+1;
                    pre2[v].clear();
                    pre2[v].push_back(u);
                }
            }
        }
    }

    dfstimepath(c2);

    cout << "Distance = " << dis[c2];
    if(timepath == dispath)
    {
        printf("; Time = %d: ",weight[c2]);
        for(int i=timepath.size()-1;i>=0;i--)
        {
            printf("%d",timepath[i]);
            if(i!=0) printf(" -> ");
        }
    }else
    {
        printf(": ");
        for(int i=dispath.size()-1;i>=0;i--)
        {
            printf("%d",dispath[i]);
            if(i!=0) printf(" -> ");
        }
        printf("\n");
        printf("Time = %d: ",weight[c2]);
        for(int i=timepath.size()-1;i>=0;i--)
        {
            printf("%d",timepath[i]);
            if(i!=0) printf(" -> ");
        }

    }
    
    return 0;
}

```