1087 All Roads Lead to Rome (30 分)

最新推荐文章于 2021-08-10 19:23:59 发布

blue_sister

最新推荐文章于 2021-08-10 19:23:59 发布

阅读量152

点赞数

分类专栏：最短路 dfs

本文链接：https://blog.csdn.net/qq_46194023/article/details/115494674

版权

dfs 同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

最短路

4 篇文章 0 订阅

订阅专栏

本文探讨了Dijkstra算法在寻找图中最短路径的应用，并提供了两种实现方式：一是记录所有路径并使用深度优先搜索（DFS）来计算点权；二是直接在Dijkstra算法中维护最终路径。代码示例展示了如何在C++中实现这两个方法，并在求解最短路径的同时考虑了路径的开心值（点权）和平均开心值。

摘要由CSDN通过智能技术生成

1.djkstra
2.记录全部路径+dfs
3.维护点权
4.注意方法二路径的维护迭代

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int grape[205][205];//存边权
bool vis[205];
int cost[205];//存花费，即最短路
int happy[205];//点权
map<string,int > stoid;
map<int ,string > idtos;
vector<int > pre[205];
vector<int > temppath,path;
int n,k,first,endss;
double maxavr;
int cntpath=0,maxhappy=0;
void dfs(int node)
{
    temppath.push_back(node);
    if(node==first){
        int tphappy=0;
        double tpavr=0.0;
        for(int i=0;i<temppath.size();i++){
            tphappy +=happy[temppath[i]];
        }
        tpavr = tphappy*1.0/(temppath.size()-1);
        if(tphappy > maxhappy){
            maxhappy = tphappy;
            maxavr = tpavr;
            path = temppath;
        }else if(tphappy == maxhappy){
            if(tpavr > maxavr){
                path = temppath;
                maxavr = tpavr;
            }
        }
        cntpath++;
        temppath.pop_back();
        return;
    }
    for(int i=0;i<pre[node].size();i++){
        dfs(pre[node][i]);
    }
    temppath.pop_back();
    return;
}

int main()
{
    fill(grape[0],grape[0]+205*205,inf);
    fill(cost,cost+205,inf);
    char tp[4];
    scanf("%d%d%s",&n,&k,tp);
    stoid[tp] = 0;
    idtos[0] = tp;
    first = 0;
    for(int i=1;i<n;i++){
        int val;
        scanf("%s%d",tp,&val);
        string ss = tp;
        if(ss=="ROM")
            endss = i;
        happy[i] = val;
        stoid[ss] = i;
        idtos[i] = ss;
    }
    for(int i=0;i<k;i++){
        char a[4],b[4];
        int c;
        scanf("%s%s%d",a,b,&c);
        grape[stoid[a]][stoid[b]] = c;
        grape[stoid[b]][stoid[a]] = c;
    }
    cost[first] = 0;
    for(int i=0;i<n;i++){
        int u = -1,minss = inf;
        for(int j=0;j<n;j++){
            if(vis[j]==false&&cost[j] < minss){
                u =j;
                minss = cost[j];
            }
        }
        if(u==-1) break;
        vis[u] =  true;
        for(int v=0;v<n;v++){
            if(vis[v]==false&&grape[u][v]!=inf){
                if(cost[v] > grape[u][v] + cost[u]){
                    cost[v] = grape[u][v] + cost[u];
                    pre[v].clear();                      pre[v].push_back(u);
                }else if(cost[v]==grape[u][v] + cost[u])
                    pre[v].push_back(u);    
            }
        }
    }
    dfs(endss);
    printf("%d %d %d %d\n",cntpath,cost[endss],maxhappy,(int)maxavr);
    for(int i=path.size()-1;i>=0;i--){
        if(i!=path.size()-1)    printf("->");
        printf("%s",idtos[path[i]].c_str());
    }
    return 0;
}


//自己的非记录全部路径写法，直接在dijktra中维护出最后的路径
const int inf = 0x3f3f3f3f;
int grape[205][205];
bool vis[205];
int happy[205],cost[205];
//起点到anshappy[i]点的获得的开心 
int anshappy[205];
//起点到num[i]点花费最少的路的条数 
int num[205];
//起点到cnt[i]点所经过的节点数
int cnt[205]; 
map<string,int > stoid;
map<int ,string > idtos;
vector<int > pre[205];
vector<int > rd;

int n,k,first,endss;
void p(int a)
{
    rd.push_back(a);
    if(a==first)
        return;
    p(pre[a][0]);
}
int main()
{
    fill(grape[0],grape[0]+205*205,inf);
    fill(cost,cost+205,inf);
    char tp[4];
    scanf("%d%d%s",&n,&k,tp);
    stoid[tp] = 0;
    idtos[0] = tp;
    first = 0;
    for(int i=1;i<n;i++){
        int val;
        scanf("%s%d",tp,&val);
        string ss = tp;
        if(ss=="ROM")
            endss = i;
        happy[i] = val;
        stoid[ss] = i;
        idtos[i] = ss;
    }
    for(int i=0;i<k;i++){
        char a[4],b[4];
        int c;
        scanf("%s%s%d",a,b,&c);
        grape[stoid[a]][stoid[b]] = c;
        grape[stoid[b]][stoid[a]] = c;
    }
    cost[first] = 0;
    num[first] =1; 
    for(int i=0;i<n;i++){
        int u = -1,minss = inf;
        for(int j=0;j<n;j++){              if(vis[j]==false&&cost[j] < minss){
                u =j;
                minss = cost[j];
            }
        }
        if(u==-1)
            break;
        vis[u] =  true;
        for(int v=0;v<n;v++){
            if(vis[v]==false&&grape[u][v]!=inf){
                if(cost[v] > grape[u][v] + cost[u]){
                    cost[v] = grape[u][v] + cost[u];
                    pre[v].clear();
                    pre[v].push_back(u);
                    //到v点总共的快乐 
                    anshappy[v] = anshappy[u] + happy[v];
                    //到v点经过的节点数 
                    cnt[v] = cnt[u] + 1;
                    //到v点花费最小的路数 
                    num[v] = num[u];
                }else if(cost[v]==grape[u][v] + cost[u]){
                    //到v点花费最小的路数 
                    num[v]+=num[u];
                    if(anshappy[v] < anshappy[u] + happy[v]){
                        anshappy[v] = anshappy[u] + happy[v];
                        cnt[v] = cnt[u] + 1;
                        pre[v].clear();
                        pre[v].push_back(u);
                    }else if(anshappy[v]==anshappy[u] + happy[v]){
                        if(cnt[v] > cnt[u] + 1){
                            cnt[v] = cnt[u] + 1;
                            pre[v].clear();
                            pre[v].push_back(u);
                        }
                    }
                }
            }
        }
    }

    printf("%d %d %d %d\n",num[endss],cost[endss],anshappy[endss],anshappy[endss]/cnt[endss]);
    p(endss);
    for(int i=rd.size()-1;i>=0;i--){
        if(i!=rd.size()-1)  printf("->");
        printf("%s",idtos[rd[i]].c_str());
    }
    return 0;
}