1163: [Baltic2008]Mafia

扫了一眼题，看到数据范围200，理所当然想到了网络流...

一开始看题以为是费用流...

但是仔细一想并不能用费用流，应该是个最小割.

考虑把每个点拆成两个点即x ,x`，那么在x -> x`连一个容量为 wi的边，代表经过这个点以后最多花费只能是wi

对于一个边u,v，把u` 连一个容量为inf的边到v，跑一边最大流即可.

c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
	x = 0;char c;int sign = 1;
	do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
	do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
	x *= sign;
}

const int N = 405,M = 2e5+500,inf = 0x3f3f3f3f;
int n,m,s,t,ans,d[N],cur[N];
int head[N],nxt[M],to[M],f[M],tot;

inline void add(int x,int y,int flow)
{
	f[tot] = flow;
	to[tot] = y;
	nxt[tot] = head[x];
	head[x] = tot++;
}

inline bool bfs()
{
	memset(d,0,sizeof d);
	queue<int>q ;
	q.push(s);d[s] = 1;
	while(!q.empty())
	{
		int x = q.front(); q.pop(); cur[x] = head[x];
		for(register int i = head[x];~i;i = nxt[i])
			if(f[i] && !d[to[i]])
			{
				d[to[i]] = d[x] + 1;
				q.push(to[i]);
			}
	}
	return d[t];
}

int dfs(int x,int w)
{
	if(!w || x == t) return w;
	int flow = 0,F;
	for(register int&i = cur[x];~i;i=nxt[i])
		if(d[to[i]] == d[x] + 1 && (F = dfs(to[i],min(w,f[i]))))
		{
			f[i] -= F;f[i^1] += F;
			w -= F;flow += F;
			if(!w) return flow;
		}
	return flow;
}

int main()
{
	ans = inf;
	memset(head,-1,sizeof head);
	read(n); read(m);
	read(s); read(t);
	rep(i,1,n)
	{
		int x;
		read(x);
		if(i == s || i == t)
		{
			ans = min(ans,x);
			continue;
		}
		add(i,i + n,x);
		add(i + n,i,0);
	}
	rep(i,1,m)
	{
		int u,v;
		read(u); read(v);
		add(u+n,v,inf);
		add(v,u+n,0);
		add(v+n,u,inf);
		add(u,v+n,0);
	}
	
	s += n;
	int num = 0;
	while(bfs())
		num += dfs(s,inf);
	cout << min(ans,num) << endl;
	return 0;
}