HDU 2485 Destroying the bus stations(最短路判定边+最大流)

HDU 2485 Destroying the bus stations(最短路判定边+最大流)

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

题意:

       某狼要到别的城市去搞基，但是去每个城市都要走最短路，每条路只能走一次(不同最短路径可以重复经过某些点)。求最多的路径条数。

分析:

首先本题有重边所以不能用矩阵保存边长,需要用edges结构保存所有边. 我们先计算出从起点到所有点的最短距离d1[]数组,然后把所有边反向,计算终点到所有点的最短距离d2[]数组. 如果某条边edges[i]在最短路径上,那么肯定d1[edges[i].from]+edges[i].dist+d2[edges[i].to] == 起点与终点间的最短距离.(想想是不是).

如果一条有向边在最短路径上,那么我们就把它添加进最大流图,且设容量为1.最终我们只要求起点到终点的最大流量即为边不重复的最短路径的条数.(想想是不是)

AC代码: 1A,代码长了点,但是结构化模板就是正确率高

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#define INF 1e9
using namespace std;
const int maxn=1000+10;
const int maxm=100000+10;

struct Edge
{
    int from,to,cap,flow;
    Edge(){}
    Edge(int f,int t,int c,int fl):from(f),to(t),cap(c),flow(fl){}
};

struct Dinic
{
    int n,m,s,t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];

    void init(int n,int s,int t)
    {
        this->n=n, this->s=s, this->t=t;
        edges.clear();
        for(int i=1;i<=n;++i) G[i].clear();
    }

    void AddEdge(int from,int to,int cap)
    {
        edges.push_back(Edge(from,to,cap,0));
        edges.push_back(Edge(to,from,0,0));
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool BFS()
    {
        queue<int> Q;
        memset(vis,0,sizeof(vis));
        vis[s]=true;
        d[s]=0;
        Q.push(s);
        while(!Q.empty())
        {
            int x=Q.front(); Q.pop();
            for(int i=0;i<G[x].size();++i)
            {
                Edge &e=edges[G[x][i]];
                if(!vis[e.to] && e.cap>e.flow)
                {
                    vis[e.to]=true;
                    d[e.to]= d[x]+1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    int DFS(int x,int a)
    {
        if(x==t || a==0) return a;
        int flow=0, f;
        for(int &i=cur[x];i<G[x].size();++i)
        {
            Edge &e=edges[G[x][i]];
            if(d[e.to]==d[x]+1 && (f=DFS(e.to,min(a,e.cap-e.flow) ) )>0)
            {
                e.flow +=f;
                edges[G[x][i]^1].flow -=f;
                flow +=f;
                a-=f;
                if(a==0) break;
            }
        }
        return flow;
    }

    int max_flow()
    {
        int ans=0;
        while(BFS())
        {
            memset(cur,0,sizeof(cur));
            ans+=DFS(s,INF);
        }
        return ans;
    }
}DC;

struct Edge_dist
{
    int from,to,dist;
    Edge_dist(){}
    Edge_dist(int f,int t,int d):from(f),to(t),dist(d){}
}edges[maxm];

struct HeapNode
{
    int d,u;
    HeapNode(){}
    HeapNode(int d,int u):d(d),u(u){}
    bool operator<(const HeapNode& rhs)const
    {
        return d>rhs.d;
    }
};

struct Dijkstra
{
    int n,m;
    vector<Edge_dist> edges;
    vector<int> G[maxn];
    bool done[maxn];
    int d[maxn];

    void init(int n)
    {
        this->n=n;
        edges.clear();
        for(int i=1;i<=n;++i) G[i].clear();
    }

    void AddEdge(int from,int to,int dist)
    {
        edges.push_back(Edge_dist(from,to,dist));
        m=edges.size();
        G[from].push_back(m-1);
    }

    void dijkstra(int s)
    {
        priority_queue<HeapNode> Q;
        for(int i=1;i<=n;++i) d[i]=INF;
        d[s]=0;
        memset(done,0,sizeof(done));
        Q.push(HeapNode(d[s],s));
        while(!Q.empty())
        {
            HeapNode x=Q.top(); Q.pop();
            int u=x.u;
            if(done[u]) continue;
            done[u]=true;
            for(int i=0;i<G[u].size();++i)
            {
                Edge_dist &e=edges[G[u][i]];
                if(d[e.to]>d[u]+e.dist)
                {
                    d[e.to]=d[u]+e.dist;
                    Q.push(HeapNode(d[e.to],e.to));
                }
            }
        }
    }
}DJ1,DJ2;

int main()
{
    int T; scanf("%d",&T);
    while(T--)
    {
        int n,m,cnt=0;//cnt来保存有效边数
        scanf("%d%d",&n,&m);
        DJ1.init(n),DJ2.init(n);
        while(m--)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            if(u!=v)
            {
                DJ1.AddEdge(u,v,w);
                DJ2.AddEdge(v,u,w);
                edges[cnt++]=Edge_dist(u,v,w);
            }
        }
        int src,dst,len;
        scanf("%d%d",&src,&dst);
        DJ1.dijkstra(src),DJ2.dijkstra(dst);
        len = DJ1.d[dst];//len记录最短距离
        if(len==INF)
        {
            printf("0\n");
            continue;
        }
        DC.init(n,src,dst);
        for(int i=0;i<cnt;i++)
        {
            int u=edges[i].from,v=edges[i].to,w=edges[i].dist;
            if(DJ1.d[u]+DJ2.d[v]+w == len)
                DC.AddEdge(u,v,1);
        }
        printf("%d\n",DC.max_flow());
    }
}