HDU4280 Island Transport

ISAP求最大流模板

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
const int maxn=;
const int inf=1e9;
struct node {
    int from,to,next;
    int cap;
}edge[maxn*];
int tol;
int head[maxn];
int dep[maxn];
int gap[maxn];//gep[x]=y说明残量网络中dep[i]==x的个数为y
int n;//点的个数
void init()
{
    tol=;
    memset(head,-,sizeof(head));
}

void addedge(int u,int v,int w)
{
    edge[tol].from=u;
    edge[tol].to=v;
    edge[tol].cap=w;
    edge[tol].next=head[u];
    head[u]=tol++;
}
void bfs (int st,int ed) {
    memset (dep,-,sizeof(dep));
    memset (gap,,sizeof(gap));
    gap[]=;
    queue<int> q;
    dep[ed]=;
    q.push(ed);
    while (!q.empty()) {
        int u=q.front();
        q.pop();
        for (int i=head[u];i!=-;i=edge[i].next) {
            int v=edge[i].to;
            if (dep[v]!=-) continue;
            q.push(v);
            dep[v]=dep[u]+;
            gap[dep[v]]++;
        }
    }
}
int sap (int st,int ed) {
    int res=;
    bfs (st,ed);
    int cur[maxn];
    int s[maxn];
    int top=;
    memcpy (cur,head,sizeof(head));
    int u=st;
    int i;
    while (dep[st]<n) {
        if (u==ed) {
            int tmp=inf;
            int inser;
            for (i=;i<top;i++)
            if (tmp>edge[s[i]].cap) {
                tmp=edge[s[i]].cap;
                inser=i;
            }
            for (i=;i<top;i++) {
                edge[s[i]].cap-=tmp;
                edge[s[i]^].cap+=tmp;
            }
            res+=tmp;
            top=inser;
            u=edge[s[top]].from;
        }
        if (u!=ed&&gap[dep[u]-]==) break;
        for (i=cur[u];i!=-;i=edge[i].next)
        if (edge[i].cap!=&&dep[u]==dep[edge[i].to]+) break;
        if (i!=-) {
            cur[u]=i;
            s[top++]=i;
            u=edge[i].to;
        }
        else {
            int min=n;
            for (i=head[u];i!=-;i=edge[i].next) {
                if (edge[i].cap==) continue;
                if (min>dep[edge[i].to]) {
                    min=dep[edge[i].to];
                    cur[u]=i;
                }
            }
            gap[dep[u]]--;
            dep[u]=min+;
            gap[dep[u]]++;
            if (u!=st) u=edge[s[--top]].from;
        }
    }
    return res;
}
int main() {
    int start,end;
    int m;
    int u,v,z;
    int T;
    scanf("%d",&T);
    while(T--) {
        init();
        scanf("%d%d",&n,&m);
        int Min=inf;
        int Max=-inf;
        int x,y;
        for(int i=;i<=n;i++) {
            scanf("%d%d",&x,&y);
            if(Min>x) {
                Min=x;
                start=i;
            }
            if(Max<x) {
                Max=x;
                end=i;
            }
        }
        while(m--) {
            scanf("%d%d%d",&u,&v,&z);
            addedge(u,v,z);
            addedge(v,u,z);
        }
        //n一定是点的总数，这是使用SAP模板需要注意的
        int ans=sap(start,end);
        printf("%d\n",ans);
    }
    return ;
}