bzoj2095: [Poi2010]Bridges 二分+最大流

想当年第一次看到这个题是在**p的一套模拟题里？然后当时想过二分也想过最大流。然后就是没有想到一块，最后知道做法后就不了了之了。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std;
#define INF 0x3fffffff
#define maxn 8000
typedef long long sint;
struct node
{
    int v,c,next;
}e[222222];
int q[999999];
int first[maxn],n,m,dis[maxn],st,ed,en;
int vi[maxn],vo[maxn],flag;
void init()
{
    en=0;
    memset(first,-1,sizeof(first));
    memset(vi,-1,sizeof(vi));
    memset(vo,-1,sizeof(vo));
    st=n+1;
    ed=n+2;
}
void add(int a,int b,int c)
{
    e[en].v=b;
    e[en].c=c;
    e[en].next=first[a];
    first[a]=en;
    en++;
    e[en].v=a;
    e[en].c=0;
    e[en].next=first[b];
    first[b]=en;
    en++;
}
bool bfs()
{
    memset(dis,-1,sizeof(dis));
    int tail=1;
    int head=1;
    tail++;
    q[tail]=st;
    dis[st]=0;
    while(head<tail)
    {
        head++;
        int u=q[head];
        for(int i=first[u];i!=-1;i=e[i].next)
        {
            if(!e[i].c||dis[e[i].v]!=-1) continue;
            dis[e[i].v]=dis[u]+1;
            if(e[i].v==ed){return true;}
            tail++;
            q[tail]=e[i].v;
        }
    }
    return false;
}
int dfs(int x,int mx)
{
    if(x==ed||mx==0) return mx;
    int f,flow=0,v,ret=0;
    for(int i=first[x];i!=-1;i=e[i].next)
    {
        v=e[i].v;
        if(dis[x]+1!=dis[v]) continue;
        if((f=dfs(v,min(mx,e[i].c))))
        {
            e[i].c-=f;
            e[i^1].c+=f;
            flow+=f;
            ret+=f;
            mx-=f;
            if(!mx) break;
        }
    }
    if(ret==0) dis[x]=-1;
    return flow;
}
int dinic()
{
    int tmp=0,maxflow=0;
    while(bfs())
    {
        while((tmp=dfs(st,INF)))
            maxflow+=tmp;
    }
    return maxflow;
}
struct edge
{
    int u,v,val1,val2;
}g[maxn];
void build(int lim)
{
    for(int i=1;i<=m;i++)
    {
        if(g[i].val1<=lim&&g[i].val2<=lim)
        {
            vi[g[i].v]++;
            vo[g[i].u]++;
            add(g[i].u,g[i].v,1);
        }
        else if(g[i].val1>lim&&g[i].val2>lim)
        {
            flag=0;
            return;
        }
        else if(g[i].val1<=lim&&g[i].val2>lim)
        {
            vi[g[i].v]++;
            vo[g[i].u]++;
        }
        else if(g[i].val1>lim&&g[i].val2<=lim)
        {
            vi[g[i].u]++;
            vo[g[i].v]++;
        }
    }
}
void judge()
{
    int sum=0;
    if(!flag) return ;
    for(int i=1;i<=n;i++)
    {
        if(abs(vi[i]-vo[i])%2!=0)
        {
            flag=0;return;
        }
        if(vo[i]-vi[i]>0)
        {
            add(st,i,(vo[i]-vi[i])/2);
            sum+=(vo[i]-vi[i])/2;
        }
        if(vo[i]-vi[i]<0)
        {
            add(i,ed,(vi[i]-vo[i])/2);
        }
    }
    if(dinic()!=sum) flag=0;
}
int main()
{
    int a,b,c,d;
    scanf("%d%d",&n,&m);
    int ll=0x3f3f3f3f,rr=0,mid,ans=-1;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d%d",&g[i].u,&g[i].v,&g[i].val1,&g[i].val2);
        rr=max(rr,max(g[i].val1,g[i].val2));
        ll=min(ll,min(g[i].val1,g[i].val2));
    }
    while(ll<=rr)
    {
        mid=(ll+rr)>>1;
        init();
        flag=1;
        build(mid);
        judge();
        if(flag)
        {
            ans=mid;
            rr=mid-1;
        }
        else ll=mid+1;
    }
    if(ans!=-1)
          printf("%d\n",ans);
    else
          printf("NIE\n");
    return 0;
}