洛谷 P2057 [SHOI2007] 善意的投票 题解

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int N = 2010, M = 200100;
int head[N], ver[M], edge[M], Next[M], v[N], incf[N], pre[N];
int n, m, s, t, tot;
int maxflow;
void add(int x, int y, int z) {
    ver[++tot] = y, edge[tot] = z, Next[tot] = head[x], head[x] = tot;
    ver[++tot] = x, edge[tot] = 0, Next[tot] = head[y], head[y] = tot;
}
bool bfs() {//寻找增广路
    memset(v, 0, sizeof(v));
	queue<int> q;
	q.push(s); v[s] = 1;
	incf[s] = inf; // 增广路上各边的最小剩余容量
	while (q.size()) {
		int x = q.front(); q.pop();
		for (int i = head[x]; i; i = Next[i])
			if (edge[i]) {
				int y = ver[i];
				if (v[y]) continue;
				incf[y] = min(incf[x], edge[i]);
				pre[y] = i; // 记录前驱，便于找到最长路的实际方案
				q.push(y), v[y] = 1;
				if (y == t) return 1;
			}
	}
	return 0;
}
void update() {
    int x = t;
	while (x != s) {
		int i = pre[x];
		edge[i] -= incf[t];
		edge[i ^ 1] += incf[t]; // 利用“成对存储”的xor 1技巧
		x = ver[i ^ 1];
	}
	maxflow += incf[t];
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
	cin >> n >> m;
	tot = 1;
	s = n + 1;
	t = s + 1;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		if (x == 1) add(s, i, 1);
		else add(i, t, 1);
	}
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		add(a, b, 1);
		add(b, a, 1);
	}
	while (bfs()) update();
	cout << maxflow;
    return 0;
}