11339：[Baltic2008]Mafia

最新推荐文章于 2024-08-28 16:31:41 发布

☈弑.

最新推荐文章于 2024-08-28 16:31:41 发布

阅读量67

点赞数 1

文章标签：图论

本文链接：https://blog.csdn.net/HRC122449/article/details/141591280

版权

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
inline int read(){
    int sum(0);char ch(getchar());
    for(;ch<'0'||ch>'9';ch=getchar());
    for(;ch>='0'&&ch<='9';sum=sum*10+(ch^48),ch=getchar());
    return sum;
}
struct edge{int e,w;edge *n,*rev;}*pre[405];
inline void insert(int s,int e,int w){
    edge *tp1(new edge),*tp2(new edge);
    tp1->e=e;tp1->w=w;tp1->rev=tp2;tp1->n=pre[s];pre[s]=tp1;
    tp2->e=s;tp2->w=0;tp2->rev=tp1;tp2->n=pre[e];pre[e]=tp2;
}
const int inf(0x3f3f3f3f);
int n,m,a,b,S,T,ans,dis[405];
queue<int>q;
inline bool bfs(){
    memset(dis,0,sizeof(dis));while(!q.empty())q.pop();dis[S]=1;q.push(S);
    while(!q.empty()){
        int k(q.front());q.pop();
        for(edge *i=pre[k];i;i=i->n)
            if(i->w&&!dis[i->e]){
                dis[i->e]=dis[k]+1;
                if(i->e==T)return true;
                q.push(i->e);
            }
    }
    return false;
}
inline int dfs(int u,int f){
    if(u==T||!f)return f;
    int ret(0);
    for(edge *i=pre[u];i;i=i->n)
        if(i->w&&dis[i->e]==dis[u]+1){
            int tmp(dfs(i->e,min(i->w,f-ret)));
            i->w-=tmp;i->rev->w+=tmp;ret+=tmp;
            if(ret==f)break;
        }
    return ret;
}
int main(){
    n=read(),m=read(),a=read(),b=read();S=0,T=(n<<1)+1;
    insert(S,a,inf);insert(b+n,T,inf);
    for(int i=1;i<=n;++i){int x(read());insert(i,i+n,x);}
    for(int i=1;i<=m;++i){
        int x(read()),y(read());
        insert(x+n,y,inf);insert(y+n,x,inf);
    }
    while(bfs())ans+=dfs(S,inf);
    printf("%d",ans);
}