http://acm.hdu.edu.cn/showproblem.php?pid=3191

求次短路的长度和个数

相关分析在这里http://blog.csdn.net/u012774187/article/details/40681515

#pragma comment(linker, "/STACK:36777216")

#pragma GCC optimize ("O2")

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cstring>

#include <string>

#include <queue>

#include <map>

#include <iostream>

#include <algorithm>

using namespace std;

#define RD(x) scanf("%d",&x)

#define RD2(x,y) scanf("%d%d",&x,&y)

#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define clr0(x) memset(x,0,sizeof(x))

#define clr1(x) memset(x,-1,sizeof(x))

#define eps 1e-9

const double pi = acos(-1.0);

typedef long long LL;

typedef unsigned long long ULL;

const int modo = 1e9 + 7;

const int INF = 0x3f3f3f3f;

const int inf = 0x3fffffff;

const LL _inf = 1e18;

const int maxn = 55,maxm = 10005;

struct edge{

    int v,w,next;

    edge(){};

    edge(int vv,int ww,int nnext):v(vv),w(ww),next(nnext){};

}e[maxn*maxn*2];

int head[maxn],inq[maxn][2],dist[maxn][2],cnt[maxn][2];//0最短1次短

int n,m,ecnt;

void init()

{

    clr1(head);

    ecnt = 0;

    for(int i = 1;i <= maxn;++i)

        dist[i][0] = dist[i][1] = inf;

    //fill(dist,dist+maxn*2,inf);

    clr0(inq),clr0(cnt);

}

void add(int u,int v,int w)

{

    e[ecnt] = edge(v,w,head[u]);

    head[u] = ecnt++;

//    e[ecnt] = edge(u,w,head[v]);

//    head[v] = ecnt++;

}

typedef pair<int,int> p2;

struct cmp {

     bool operator() (const p2 &a, const p2 &b)

     {

        if(dist[a.first][a.second] != dist[b.first][b.second])

            return dist[a.first][a.second] > dist[b.first][b.second];

        else

            return a.first > b.first;

     }

};

void spfa(int src,int dst)

{

    priority_queue<p2 , vector<p2> , cmp> q;

    q.push(make_pair(src,0));

    dist[src][0] = 0,cnt[src][0] = 1;

    while(!q.empty()){

        int u = q.top().first,flag = q.top().second;

        q.pop();

        if(inq[u][flag])    continue;

        inq[u][flag] = 1;

        for(int i = head[u];i != -1;i = e[i].next){

            int v = e[i].v,w = e[i].w;

            if(!inq[v][0] && dist[v][0] > dist[u][flag] + e[i].w){

                if(dist[v][0] != inf){

                    dist[v][1] = dist[v][0];

                    cnt[v][1] = cnt[v][0];

                    q.push(make_pair(v,1));

                }

                dist[v][0] = dist[u][flag] + e[i].w;

                cnt[v][0] = cnt[u][flag];

                q.push(make_pair(v,0));

            }else if(!inq[v][0] && dist[v][0] == dist[u][flag] + e[i].w){

                cnt[v][0] += cnt[u][flag];

            }else if(!inq[v][1] && dist[v][1] > dist[u][flag] + e[i].w){

                dist[v][1] = dist[u][flag] + e[i].w;

                cnt[v][1] = cnt[u][flag];

                q.push(make_pair(v,1));

            }else if(!inq[v][1] && dist[v][1] == dist[u][flag] + e[i].w){

                cnt[v][1] += cnt[u][flag];

            }

        }

    }

    printf("%d %d\n",dist[dst][1],cnt[dst][1]);

}

int main(){

    int u,v,w,s,t;

    while(~RD2(n,m)){

        RD2(s,t);s++,t++;

        init();

        while(m--){

            RD3(u,v,w);u++,v++;

            add(u,v,w);

        }

        spfa(s,t);

    }

    return 0;

}

上面是错误代码

经过筛查，发现是 

if(dist[a.first][a.second] != dist[b.first][b.second])

            return dist[a.first][a.second] > dist[b.first][b.second];

有问题，因为不同的路径到达同一个点的同一个状态的值不一样，所有比较和更新穿插在一起就会出错了

可是每次更新dist数组都是向小了更新，所以不应该有影响啊..?

以下是AC代码，谁能清楚一点地告诉为啥上面的程序就不对呢？

#pragma comment(linker, "/STACK:36777216")

#pragma GCC optimize ("O2")

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cstring>

#include <string>

#include <queue>

#include <map>

#include <iostream>

#include <algorithm>

using namespace std;

#define RD(x) scanf("%d",&x)

#define RD2(x,y) scanf("%d%d",&x,&y)

#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define clr0(x) memset(x,0,sizeof(x))

#define clr1(x) memset(x,-1,sizeof(x))

#define eps 1e-9

const double pi = acos(-1.0);

typedef long long LL;

typedef unsigned long long ULL;

const int modo = 1e9 + 7;

const int INF = 0x3f3f3f3f;

const int inf = 0x3fffffff;

const LL _inf = 1e18;

const int maxn = 55,maxm = 10005;

struct edge{

    int v,w,next;

    edge(){};

    edge(int vv,int ww,int nnext):v(vv),w(ww),next(nnext){};

}e[maxn*maxn*2];

int head[maxn],inq[maxn][2],dist[maxn][2],cnt[maxn][2];//0最短1次短

int n,m,ecnt;

struct node{

    int v,flag,dis;

    node(int a,int b,int c):v(a),flag(b),dis(c){};

    bool operator < (const node & a) const{

        if(a.dis == dis)

            return a.v < v;

        return a.dis < dis;

    }

};

void init()

{

    clr1(head);

    ecnt = 0;

    for(int i = 0;i <= n;++i)

        dist[i][0] = dist[i][1] = inf;

    //fill(dist,dist+maxn*2,inf);

    clr0(inq),clr0(cnt);

}

void add(int u,int v,int w)

{

    e[ecnt] = edge(v,w,head[u]);

    head[u] = ecnt++;

//    e[ecnt] = edge(u,w,head[v]);

//    head[v] = ecnt++;

}

void spfa(int src,int dst)

{

    priority_queue<node> q;

    q.push(node(src,0,0));

    dist[src][0] = 0,cnt[src][0] = 1;

    while(!q.empty()){

        int u = q.top().v,flag = q.top().flag,dis = q.top().dis;

        q.pop();

        if(inq[u][flag])    continue;

        inq[u][flag] = 1;

        for(int i = head[u];i != -1;i = e[i].next){

            int v = e[i].v,w = e[i].w;

            if(!inq[v][0] && dist[v][0] > dis + e[i].w){

                if(dist[v][0] != inf){

                    dist[v][1] = dist[v][0];

                    cnt[v][1] = cnt[v][0];

                    q.push(node(v,1,dist[v][1]));

                }

                dist[v][0] = dis + e[i].w;

                cnt[v][0] = cnt[u][flag];

                q.push(node(v,0,dist[v][0]));

            }else if(!inq[v][0] && dist[v][0] == dis + e[i].w){

                cnt[v][0] += cnt[u][flag];

            }else if(!inq[v][1] && dist[v][1] > dis + e[i].w){

                dist[v][1] = dis + e[i].w;

                cnt[v][1] = cnt[u][flag];

                q.push(node(v,1,dist[v][1]));

            }else if(!inq[v][1] && dist[v][1] == dis+ e[i].w){

                cnt[v][1] += cnt[u][flag];

            }

        }

    }

    printf("%d %d\n",dist[dst][1],cnt[dst][1]);

}

int main(){

    int u,v,w,s,t;

    while(~RD2(n,m)){

        RD2(s,t);s++,t++;

        init();

        while(m--){

            RD3(u,v,w);u++,v++;

            add(u,v,w);

        }

        spfa(s,t);

    }

    return 0;

}

AC代码2

#pragma comment(linker, "/STACK:36777216")

#pragma GCC optimize ("O2")

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cstring>

#include <string>

#include <queue>

#include <map>

#include <iostream>

#include <algorithm>

using namespace std;

#define RD(x) scanf("%d",&x)

#define RD2(x,y) scanf("%d%d",&x,&y)

#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define clr0(x) memset(x,0,sizeof(x))

#define clr1(x) memset(x,-1,sizeof(x))

#define eps 1e-9

const double pi = acos(-1.0);

typedef long long LL;

typedef unsigned long long ULL;

const int modo = 1e9 + 7;

const int INF = 0x3f3f3f3f;

const int inf = 0x3fffffff;

const LL _inf = 1e18;

const int maxn = 55,maxm = 10005;

struct edge{

    int v,w,next;

    edge(){};

    edge(int vv,int ww,int nnext):v(vv),w(ww),next(nnext){};

}e[maxn*maxn*2];

int head[maxn],inq[maxn][2],dist[maxn][2],cnt[maxn][2];//0最短1次短

int n,m,ecnt;

struct node{

    int v,flag,dis;

    node(int a,int b,int c):v(a),flag(b),dis(c){};

    bool operator < (const node & a) const{

        if(a.dis == dis)

            return a.v < v;

        return a.dis < dis;

    }

};

void init()

{

    clr1(head);

    ecnt = 0;

    for(int i = 0;i <= n;++i)

        dist[i][0] = dist[i][1] = inf;

    //fill(dist,dist+maxn*2,inf);

    clr0(inq),clr0(cnt);

}

void add(int u,int v,int w)

{

    e[ecnt] = edge(v,w,head[u]);

    head[u] = ecnt++;

//    e[ecnt] = edge(u,w,head[v]);

//    head[v] = ecnt++;

}

void spfa(int src,int dst)

{

    priority_queue<node> q;

    q.push(node(src,0,0));

    dist[src][0] = 0,cnt[src][0] = 1;

    while(!q.empty()){

        int u = q.top().v,flag = q.top().flag;//dis = q.top().dis;

        q.pop();

        if(inq[u][flag])    continue;

        inq[u][flag] = 1;

        for(int i = head[u];i != -1;i = e[i].next){

            int v = e[i].v,w = e[i].w;

            if(!inq[v][0] && dist[v][0] > dist[u][flag] + e[i].w){

                if(dist[v][0] != inf){

                    dist[v][1] = dist[v][0];

                    cnt[v][1] = cnt[v][0];

                    q.push(node(v,1,dist[v][1]));

                }

                dist[v][0] = dist[u][flag] + e[i].w;

                cnt[v][0] = cnt[u][flag];

                q.push(node(v,0,dist[v][0]));

            }else if(!inq[v][0] && dist[v][0] == dist[u][flag] + e[i].w){

                cnt[v][0] += cnt[u][flag];

            }else if(!inq[v][1] && dist[v][1] > dist[u][flag] + e[i].w){

                dist[v][1] = dist[u][flag] + e[i].w;

                cnt[v][1] = cnt[u][flag];

                q.push(node(v,1,dist[v][1]));

            }else if(!inq[v][1] && dist[v][1] == dist[u][flag] + e[i].w){

                cnt[v][1] += cnt[u][flag];

            }

        }

    }

    printf("%d %d\n",dist[dst][1],cnt[dst][1]);

}

int main(){

    int u,v,w,s,t;

    while(~RD2(n,m)){

        RD2(s,t);s++,t++;

        init();

        while(m--){

            RD3(u,v,w);u++,v++;

            add(u,v,w);

        }

        spfa(s,t);

    }

    return 0;

}

#pragma comment(linker, "/STACK:36777216")#pragma GCC optimize ("O2")#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <string>#include
<queue>#include <map>#include <iostream>#include <algorithm>using namespace std;#define RD(x) scanf("%d",&x)#define RD2(x,y) scanf("%d%d",&x,&y)#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define clr0(x) memset(x,0,sizeof(x))#define clr1(x) memset(x,-1,sizeof(x))#define
eps 1e-9const double pi = acos(-1.0);typedef long long LL;typedef unsigned long long ULL;const int modo = 1e9 + 7;const int INF = 0x3f3f3f3f;const int inf = 0x3fffffff;const LL _inf = 1e18;const int maxn = 55,maxm = 10005;struct edge{ int v,w,next; edge(){};
edge(int vv,int ww,int nnext):v(vv),w(ww),next(nnext){};}e[maxn*maxn*2];int head[maxn],inq[maxn][2],dist[maxn][2],cnt[maxn][2];//0最短1次短int n,m,ecnt;void init(){ clr1(head); ecnt = 0; for(int i = 0;i < maxn;++i) dist[i][0] = dist[i][1] = inf; //fill(dist,dist+maxn*2,inf);
clr0(inq),clr0(cnt);}void add(int u,int v,int w){ e[ecnt] = edge(v,w,head[u]); head[u] = ecnt++;// e[ecnt] = edge(u,w,head[v]);// head[v] = ecnt++;}typedef pair<int,int> p2;struct cmp { bool operator() (const p2 &a, const p2 &b) { if(dist[a.first][a.second]
!= dist[b.first][b.second]) return dist[a.first][a.second] > dist[b.first][b.second]; else return a.first > b.first; }};void spfa(int src,int dst){ priority_queue<p2 , vector<p2> , cmp> q; q.push(make_pair(src,0)); dist[src][0] = 0,cnt[src][0] = 1; while(!q.empty()){
int u = q.top().first,flag = q.top().second; q.pop(); if(inq[u][flag]) continue; inq[u][flag] = 1; for(int i = head[u];i != -1;i = e[i].next){ int v = e[i].v,w = e[i].w; if(!inq[v][0] && dist[v][0] > dist[u][flag] + e[i].w){ if(dist[v][0] != inf){ dist[v][1]
= dist[v][0]; cnt[v][1] = cnt[v][0]; q.push(make_pair(v,1)); } dist[v][0] = dist[u][flag] + e[i].w; cnt[v][0] = cnt[u][flag]; q.push(make_pair(v,0)); }else if(!inq[v][0] && dist[v][0] == dist[u][flag] + e[i].w){ cnt[v][0] += cnt[u][flag]; }else if(!inq[v][1]
&& dist[v][1] > dist[u][flag] + e[i].w){ dist[v][1] = dist[u][flag] + e[i].w; cnt[v][1] = cnt[u][flag]; q.push(make_pair(v,1)); }else if(!inq[v][1] && dist[v][1] == dist[u][flag] + e[i].w){ cnt[v][1] += cnt[u][flag]; } } } printf("%d %d\n",dist[dst][1],cnt[dst][1]);}int
main(){ int u,v,w,s,t; while(~RD2(n,m)){ RD2(s,t);s++,t++; init(); while(m--){ RD3(u,v,w);u++,v++; add(u,v,w); } spfa(s,t); } return 0;}

hdu 3191 次短路的长度和个数的更多相关文章

  1. HDU 3191 次短路长度和条数

    http://www.cnblogs.com/wally/archive/2013/04/16/3024490.html http://blog.csdn.net/me4546/article/det ...

  2. HDU3191-How many paths are there(次短路的长度及其个数)

    oooccc1 is a Software Engineer who has to ride to the work place every Monday through Friday. For a ...

  3. COJ 0579 4020求次短路的长度

    4020求次短路的长度 难度级别:C: 运行时间限制:1000ms: 运行空间限制:51200KB: 代码长度限制:2000000B 试题描述 在一个地图上共有N个路口(编号分别为1到N),R条道路( ...

  4. HDU - 2066 最短路+加一个节点

    一个图上,有M条边,Z个出发点,Y个终止点.求一条最短路,其中起点是Z中的任意一点,终点是Y中任意一点. Input 输入数据有多组,输入直到文件结束. 每组的第一行是三个整数M,Z,Y 接着有M行, ...

  5. ACM: HDU 2544 最短路-Dijkstra算法

    HDU 2544最短路 Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Descrip ...

  6. 【最长下降子序列的长度和个数】 poj 1952

    转自http://blog.csdn.net/zhang360896270/article/details/6701589 这题要求最长下降子序列的长度和个数,我们可以增加数组maxlen[size] ...

  7. UESTC 30 &&HDU 2544最短路【Floyd求解裸题】

    最短路 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submiss ...

  8. hdu 5521 最短路

    Meeting Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total ...

  9. HDU 5726 GCD 区间GCD=k的个数

    GCD Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submis ...

随机推荐

  1. Gulp应用场景

    转自:Gulp教程之:Gulp能做什么,前端装逼为何要用它 我们先说说 平时web开发遇到的一些场景 和 苦恼无奈的情况:   JavaScript和CSS的版本问题 我们都知道 JavaScript ...

  2. hdu 1757 (矩阵快速幂) 一个简单的问题 一个简单的开始

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1757 题意不难理解,当x小于10的时候,数列f(x)=x,当x大于等于10的时候f(x) = a0 * ...

  3. ROC曲线 Receiver Operating Characteristic

    ROC曲线与AUC值   本文根据以下文章整理而成,链接: (1)http://blog.csdn.net/ice110956/article/details/20288239 (2)http://b ...

  4. CF Round #509 (Div. 2)

    前言:第一次打\(CF\),因为经验不足以及英语水平很烂,即便在机房大佬的带领下也是花了好久才读懂题目..\(A\)题直到\(11\)分钟才\(A\),题目一共才做了\(4\)题,太菜了.. A. H ...

  5. Vsphere初试——使用Vsphere client

    好不容易安装好ESXi之后,就要安装一个Vsphere Client,为什么要安装这个东东.使用过vmware workstation的人都知道,安装完就可以添加虚拟机,但是ESXi要通过Vspher ...

  6. 数组转xml格式/xml格式转数组

    数组转xml格式 $arr=array( 'username'=>'huahua', 'password'=>'123456', 'number'=>'15889652911', ) ...

  7. js 光标位置处理

    /** * 获取选中文字 * 返回selection,toString可拿到结果,selection含有起始光标位置信息等 **/ function getSelectText() { var tex ...

  8. requestAnimationFrame 完美兼容封装

    完美兼容封装: (function() { var lastTime = 0; var vendors = ['webkit', 'moz']; for(var x = 0; x < vendo ...

  9. windows中执行celery beat任务

    由于最新的celery4.2不支持windows系统,因此按照网上的建议安装了3.1.25版.按照官网的说明使用 app.conf.beat_schedule = { 'add-every-30-se ...

  10. Ajax（6） Ajax向servlet请求数据库操作 并显示到当前页面 这个未经测试

    假设:1.你的页面在Web-Root下,内容为: <div id="showMsg"></div><input type="text&quo ...