POJ3068："Shortest" pair of paths——题解

http://poj.org/problem?id=3068

题目大意：

从0～n-1找到两条边和点都不相同（除了0和n-1外）的最小费用路径。

————————————————————————————

POJ2135魔改版。

按照那题的思路并且把点拆成中间连一条容量为1的边即可。

切了切了。

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cctype>
using namespace std;
typedef long long ll;
const int INF=1e9;
const int N=;
const int M=;
inline int read(){
    int X=,w=;char ch=;
    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();
    return w?-X:X;
}
struct node{
    int nxt;
    int to;
    int w;
    int b;
}edge[M];
int head[N],cnt=-;
void add(int u,int v,int w,int b){
    cnt++;
    edge[cnt].to=v;
    edge[cnt].w=w;
    edge[cnt].b=b;
    edge[cnt].nxt=head[u];
    head[u]=cnt;
    return;
}
int dis[N];
bool vis[N];
inline bool spfa(int s,int t,int n){
    deque<int>q;
    memset(vis,,sizeof(vis));
    for(int i=;i<=n;i++)dis[i]=INF;
    dis[t]=;q.push_back(t);vis[t]=;
    while(!q.empty()){
    int u=q.front();
    q.pop_front();vis[u]=;
    for(int i=head[u];i!=-;i=edge[i].nxt){
        int v=edge[i].to;
        int b=edge[i].b;
        if(edge[i^].w&&dis[v]>dis[u]-b){
        dis[v]=dis[u]-b;
        if(!vis[v]){
            vis[v]=;
            if(!q.empty()&&dis[v]<dis[q.front()]){
            q.push_front(v);
            }else{
            q.push_back(v);
            }
        }
        }
    }
    }
    return dis[s]<INF;
}
int ans=;
int dfs(int u,int flow,int m){
    if(u==m){
    vis[m]=;
    return flow;
    }
    int res=,delta;
    vis[u]=;
    for(int e=head[u];e!=-;e=edge[e].nxt){
        int v=edge[e].to;
    int b=edge[e].b;
        if(!vis[v]&&edge[e].w&&dis[u]-b==dis[v]){
            delta=dfs(v,min(edge[e].w,flow-res),m);
            if(delta){
                edge[e].w-=delta;
                edge[e^].w+=delta;
                res+=delta;
        ans+=delta*b;
                if(res==flow)break;
            }
        }
    }
    return res;
}
inline int costflow(int S,int T,int n){
    int flow=;
    while(spfa(S,T,n)){
    do{
        memset(vis,,sizeof(vis));
        flow+=dfs(S,INF,T);
    }while(vis[T]);
    }
    return flow;
}
void restart(){
    memset(head,-,sizeof(head));
    cnt=-;
    ans=;
    return;
}
int main(){
    int ecnt=,n,m;
    while(scanf("%d%d",&n,&m)!=EOF&&n&&m){
    restart();
    ecnt++;
    int F=,E=n;
    int S=n*+,T=S+;
    add(S,F,,);add(F,S,,);
    add(E,T,,);add(T,E,,);
    for(int i=;i<=n-;i++){
        add(i,i+n,,);
        add(i+n,i,,);
    }
    for(int i=;i<=m;i++){
        int u=read()+;
        int v=read()+;
        int b=read();
        if(u!=&&u!=n)u+=n;
        add(u,v,,b);
        add(v,u,,-b);
    }
    int flow=costflow(S,T,T);
    printf("Instance #%d: ",ecnt);
    if(flow!=){
        printf("Not possible\n");
    }else printf("%d\n",ans);
    }
    return ;
}