P2057 [SHOI2007]善意的投票 最大流最小割

原题链接：https://www.luogu.com.cn/problem/P2057

题意

有n个小朋友，每个小朋友都选择是否午觉用0/1表示，接下来有两种可能会产生冲突

1. 两个好朋友之间的意见不和
2. 有小朋友改变自己的意见

问如何使得冲突数最小

分析

每个人都有两种选择方式，可以想到最小割，首先建立源点和汇点分别表示想要午觉的集合和不想午觉的集合，然后分别和持有相应意见的小朋友连边，边权为1。接下来考虑如何计算好朋友之间的冲突，我们用a->b代表a和b保持一个意见和所产生的的冲突，那么最小割割开这条边就意味着a和b不保持一个意见，因此好朋友之间要连上双向边保证好朋友之间相互妥协，最后跑一遍最大流就是答案。

Code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
//#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<ll, ll> PII;
typedef unsigned long long ull;
const int N = 1e5 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
int st, ed, n, m;
ll ans;
struct Maxflow {
    int h[N], cnt, deep[N], cur[N];
    ll maxflow;
    struct Edge {
        int to, next;
        ll cap;
    } e[M<<1];

    void init() {
        memset(h, -1, sizeof h);
        cnt = maxflow = 0;
    }
    void add(int u, int v, int cap) {
        e[cnt].to = v;
        e[cnt].cap = cap;
        e[cnt].next = h[u];
        h[u] = cnt++;

        e[cnt].to = u;
        e[cnt].cap = 0;
        e[cnt].next = h[v];
        h[v] = cnt++;
    }

    bool bfs() {
        for (int i = 0; i <= ed; i++) deep[i] = -1, cur[i] = h[i];
        queue<int> q; q.push(st); deep[st] = 0;
        while (q.size()) {
            int u = q.front();
            q.pop();
            for (int i = h[u]; ~i; i = e[i].next) {
                int v = e[i].to;
                if (e[i].cap && deep[v] == -1) {
                    deep[v] = deep[u] + 1;
                    q.push(v);
                }
            }
        }
        if (deep[ed] >= 0) return true;
        else return false;
    }

    ll dfs(int u, ll mx) {
        ll a;
        if (u == ed) return mx;
        for (int i = cur[u]; ~i; i = e[i].next) {
            cur[u] = i;//优化
            int v = e[i].to;
            if (e[i].cap && deep[v] == deep[u] + 1 && (a = dfs(v, min(e[i].cap, mx)))) {
                e[i].cap -= a;
                e[i ^ 1].cap += a;
                return a;
            }
        }
        return 0;
    }

    void dinic() {
        ll res;
        while (bfs()) {
            while (1) {
                res = dfs(st, INF);
                if (!res) break;
                maxflow += res;
            }
        }
    }
}mf;
int val[N];
void solve() {
    cin >> n >> m; mf.init();
    st = n + 1, ed = n + 2;
    for (int i = 1; i <= n; i++) {
        cin >> val[i];
        if (val[i] == 1) mf.add(st, i, 1);
        else mf.add(i, ed, 1);
    }
    for (int i = 1; i <= m; i++) {
        int u, v; cin >> u >> v;
        mf.add(u, v, 1);
        mf.add(v, u, 1);
    }
    mf.dinic();
    cout << mf.maxflow << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
    return 0;
}