【 bzoj 2400 】Spoj 839 Optimal Marks - 最小割

　　每一位之间的贡献是独立的，所以枚举二进制位来算。
　　每个未确定的点，显然他的权值要么是0要么是1，他划进0有一个代价，划进1有一个代价，同时和相邻的未确定点也有代价。如果用最小割，割完后$S$的权值均为1，$T$的权值均为0，这样最小割就是最小代价。考虑怎么去构造这样的图。
　　对于确定是1的，从s连到他inf流量，确定是0的连到t也是inf流量，剩下按无向图建图即可。
　　割完后从S开始跑个dfs然后算贡献。
　　依旧是玄学复杂度= =反正边不多。。

#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a , _ = b ; i <= _ ; i ++)
#define per(i,a,b) for (int i = a , _ = b ; i >= _ ; i --)
#define fore(i,u)  for (int i = head[u] ; i ; i = nxt[i])
#define cr(x) memset(x , 0 , sizeof x)

inline int rd() {
    char c = getchar();
    while (!isdigit(c) && c != '-') c = getchar() ; int x = 0 , f = 1;
    if (c == '-') f = -1; else x = c - '0';
    while (isdigit(c = getchar())) x = x * 10 + c - '0';
    return x * f;
}

const int maxn = 4207;
const int maxm = 100007;
const int inf = 0x7fffffff;

typedef long long ll;

typedef int arr[maxn];
typedef int adj[maxm];

arr val , u , v , ext , mark;

int n , m , S , T;

ll ans;

void input() {
    n = rd() , m = rd();
    rep (i , 1 , n) val[i] = rd();
    rep (i , 1 , m) u[i] = rd() , v[i] = rd();
    S = n + 1 , T = S + 1;
}

namespace dinic {
    arr head , dis , cur;
    adj to , nxt , cap , flow;
    int ett;

    std::queue<int> Q;

    inline void ins(int u , int v , int c) {
        to[++ ett] = v , nxt[ett] = head[u] , cap[ett] = c , head[u] = ett;
        to[++ ett] = u , nxt[ett] = head[v] , cap[ett] = 0 , head[v] = ett;
    }

    inline void clear() {
        rep (i , 1 , ett) flow[i] = 0;
        rep (i , 1 , T) head[i] = 0;
        ett = 1;
    }

    inline bool bfs() {
        rep (i , 1 , T) dis[i] = 0;
        dis[S] = 1 , Q.push(S);
        while (!Q.empty()) {
            int u = Q.front() ; Q.pop();
            fore (i , u) if (cap[i] > flow[i]) {
                int v = to[i];
                if (!dis[v]) {
                    dis[v] = dis[u] + 1;
                    Q.push(v);
                }
            }
        }
        return dis[T] > 0;
    }

    int dfs(int u , int a) {
        if (u == T || !a) return a;
        int ret = 0 , f;
        for (int&i = cur[u] ; i ; i = nxt[i]) {
            int v = to[i];
            if (dis[v] == dis[u] + 1 && (f = dfs(v , std::min(a , cap[i] - flow[i])))) {
                flow[i] += f , flow[i^1] -= f , a -= f , ret += f;
                if (!a) break;
            }
        }
        return ret;
    }

    int max_flow() {
        int ret = 0;
        while (bfs()) {
            rep (i , 1 , T) cur[i] = head[i];
            ret += dfs(S , inf);
        }
        return ret;
    }

    void dfs(int u) {
        mark[u] = 1;
        fore (i , u) if (cap[i] > flow[i]) {
            int v = to[i];
            if (!mark[v]) dfs(v);
        }
    }
}

void solve() {
    using namespace dinic;
    rep (x , 0 , 30) {
        clear();
        rep (i , 1 , n) if (val[i] >= 0) {
            if ((val[i] >> x) & 1) ins(S , i , inf);
            else ins(i , T , inf);
        }
        rep (i , 1 , m) ins(u[i] , v[i] , 1) , ins(v[i] , u[i] , 1);
        ll t = 1ll << x;
        ans += max_flow() * t;
        cr(mark) , dfs(S);
        rep (i , 1 , n) if (mark[i]) ext[i] |= t;
    }
    printf("%lld\n" , ans);
    ans = 0;
    rep (i , 1 , n) if (val[i] > 0) ans += val[i];
    else ans += ext[i];
    printf("%lld\n" , ans);
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("data.txt" , "r" , stdin);
    #endif
    input();
    solve();
    return 0;
}