tjut 3491

最新推荐文章于 2019-01-27 21:10:00 发布

Change_ZHONG

最新推荐文章于 2019-01-27 21:10:00 发布

阅读量201

点赞数

分类专栏：网络流

本文链接：https://blog.csdn.net/luozhong11/article/details/52312587

版权

网络流专栏收录该内容

7 篇文章 0 订阅

订阅专栏

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <string>  
#include <map>  
#include <stack>  
#include <vector>  
#include <set>  
#include <queue>  
#pragma comment (linker,"/STACK:102400000,102400000")  
#define pi acos(-1.0)  
#define eps 1e-6  
#define lson rt<<1,l,mid  
#define rson rt<<1|1,mid+1,r  
#define FRE(i,a,b)  for(i = a; i <= b; i++)  
#define FREE(i,a,b) for(i = a; i >= b; i--)  
#define FRL(i,a,b)  for(i = a; i < b; i++)  
#define FRLL(i,a,b) for(i = a; i > b; i--)  
#define mem(t, v)   memset ((t) , v, sizeof(t))  
#define sf(n)       scanf("%d", &n)  
#define sff(a,b)    scanf("%d %d", &a, &b)  
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)  
#define pf          printf  
#define DBG         pf("Hi\n")  
typedef long long ll;  
using namespace std;  
  
#define INF 0x3f3f3f3f  
#define mod 1000000009  
const int maxn = 1005;  
const int MAXN = 2005;  
const int MAXM = 200000;  
const int N = 1005;  
  
int S,H,n,m;  
  
struct Edge  
{  
    int to,next,cap,flow;  
}edge[MAXM];  
  
int tol;  
int head[MAXN];  
int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN];  
  
void init()  
{  
    tol=0;  
    memset(head,-1,sizeof(head));  
}  
  
//加边，单向图三个参数，双向图四个参数  
void addedge(int u,int v,int w,int rw=0)  
{  
    edge[tol].to=v; edge[tol].cap=w; edge[tol].next=head[u];  
    edge[tol].flow=0; head[u]=tol++;  
    edge[tol].to=u; edge[tol].cap=rw; edge[tol].next=head[v];  
    edge[tol].flow=0; head[v]=tol++;  
}  
  
//输入参数：起点，终点，点的总数  
//点的编号没有影响，只要输入点的总数  
int sap(int start,int end,int N)  
{  
    memset(gap,0,sizeof(gap));  
    memset(dep,0,sizeof(dep));  
    memcpy(cur,head,sizeof(head));  
    int u=start;  
    pre[u]=-1;  
    gap[0]=N;  
    int ans=0;  
    while (dep[start]<N)  
    {  
        if (u==end)  
        {  
            int Min=INF;  
            for (int i=pre[u];i!=-1;i=pre[edge[i^1].to])  
                if (Min>edge[i].cap-edge[i].flow)  
                    Min=edge[i].cap-edge[i].flow;  
            for (int i=pre[u];i!=-1;i=pre[edge[i^1].to])  
            {  
                edge[i].flow+=Min;  
                edge[i^1].flow-=Min;  
            }  
            u=start;  
            ans+=Min;  
            continue;  
        }  
        bool flag=false;  
        int v;  
        for (int i=cur[u];i!=-1;i=edge[i].next)  
        {  
            v=edge[i].to;  
            if (edge[i].cap-edge[i].flow && dep[v]+1==dep[u])  
            {  
                flag=true;  
                cur[u]=pre[v]=i;  
                break;  
            }  
        }  
        if (flag)  
        {  
            u=v;  
            continue;  
        }  
        int Min=N;  
        for (int i=head[u];i!=-1;i=edge[i].next)  
            if (edge[i].cap-edge[i].flow && dep[edge[i].to]<Min)  
            {  
                Min=dep[edge[i].to];  
                cur[u]=i;  
            }  
        gap[dep[u]]--;  
        if (!gap[dep[u]]) return ans;  
        dep[u]=Min+1;  
        gap[dep[u]]++;  
        if (u!=start) u=edge[pre[u]^1].to;  
    }  
    return ans;  
}  
  
int main()  
{  
#ifndef ONLINE_JUDGE  
    freopen("C:/Users/lyf/Desktop/IN.txt","r",stdin);  
#endif  
    int i,j,t,x,y;  
    sf(t);  
    while (t--)  
    {  
        scanf("%d%d%d%d",&n,&m,&S,&H);  
        init();  
        for (i=1;i<=n;i++)  
        {  
            scanf("%d",&x);  
            if (i==S||i==H) continue;  
            addedge(i,i+n,x);  
        }  
        addedge(S,S+n,INF);  
        addedge(H,H+n,INF);  
        addedge(0,S,INF);  
        addedge(H+n,2*n+1,INF);  
        for (i=0;i<m;i++)  
        {  
            scanf("%d%d",&x,&y);  
            addedge(x+n,y,INF);  
            addedge(y+n,x,INF);  
        }  
        printf("%d\n",sap(0,2*n+1,2*n+2));  
    }  
    return 0;  
}