bzoj3396 ISAP

分析：裸的最大流，顺便复习了一波ISAP，速度起飞，非常舒服。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define fo(i,a,b) for(ll i=a;i<=b;i++)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
using namespace std; 
typedef long long ll;
const int N=1e5+5;
const int inf=1e9+5;
int n,maxn,u,t,maxflow;
int tot;
int d[N],cur[N],last[N],num[N];
int head[N],next[N],v[N],remain[N];
queue<int> q;
inline void add(int x,int y,int z)
{
    v[++tot]=y;remain[tot]=z;next[tot]=head[x];head[x]=tot;
    v[++tot]=x;remain[tot]=0;next[tot]=head[y];head[y]=tot;
}
inline void bfs(int t)
{
    fo(i,1,maxn)d[i]=maxn;
    d[t]=0;
    fo(i,1,maxn)cur[i]=head[i];
    while (!q.empty()) q.pop();
    q.push(t);  
    while (!q.empty())
    {
        int now=q.front();
        q.pop();
        for (int i=head[now];i!=-1;i=next[i])
        {
            if (d[v[i]]==maxn&&remain[i^1])
            {
                d[v[i]]=d[now]+1;
                q.push(v[i]);
            }

        }
    }
}
inline int augment(int s,int t)
{
    int now=t,ans=inf;
    while (now!=s)
    {
        ans=min(ans,remain[last[now]]);
        now=v[last[now]^1];
    }
    now=t;
    while (now!=s)
    {
        remain[last[now]]-=ans;
        remain[last[now]^1]+=ans;
        now=v[last[now]^1];
    }
    return ans;
}
inline void isap(int s,int t)
{
    bfs(t);
    fo(i,1,maxn)++num[d[i]];
    int now=s;
    while (d[s]<maxn)
    {
        if (now==t)
        {
            maxflow+=augment(s,t);
            now=s;
        }
        bool flag=false;
        int i=cur[now];
        while (i!=-1)
        {
            if (d[v[i]]+1==d[now]&&remain[i])
            {
                flag=true;
                cur[now]=i;
                last[v[i]]=i;
                now=v[i];
                break;
            }
            i=next[i];
        }
        if (!flag)
        {
            int minn=maxn-1;
            int i=head[now];
            while(i!=-1)
            {
                if (remain[i])
                minn=min(minn,d[v[i]]);
                i=next[i];
            }
            if (!(--num[d[now]]))break;
            num[d[now]=minn+1]++;
            cur[now]=head[now];
            if (now!=s)now=v[last[now]^1];
        }
    }
}
int main()
{
    tot=-1;scanf("%d",&n);
    memset(head,-1,sizeof(head));
    memset(next,-1,sizeof(next));
    maxn=60;
    fo(i,1,n)
    {
        char x,y;
        int z;
        cin>>x>>y>>z;
        //scanf("%d%d%d",&x,&y,&z);
        u=x-'A'+2,t=y-'A'+2;
        add(u,t,z); 
    }
    add(1,2,inf);
    add(27,maxn,inf);
    isap(1,maxn);
    printf("%d\n",maxflow);
    return 0;
}