【HDOJ】3277 Marriage Match III

Dinic不同实现的效率果然不同啊。

/* 3277 */
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

const int INF = 0x1f1f1f1f;
const int maxn = 255;
const int maxm = maxn*maxn;
const int maxv = maxn*3;
const int maxe = maxv*maxv*4;
bool M[maxn][maxn];
int V[maxe], F[maxe], F_[maxe], nxt[maxe];
int dis[maxv], head[maxv], head_[maxv], Q[maxv];
int pre[maxn];
int X[maxm], Y[maxm];
int s, t;
int n, m;

void addEdge(int u, int v, int c) {
    #ifndef ONLINE_JUDGE
        printf("u = %d, v = %d, c = %d
", u, v, c);
    #endif
    V[m] = v;
    F_[m] = c;
    nxt[m] = head[u];
    head[u] = m++;
    
    V[m] = u;
    F_[m] = 0;
    nxt[m] = head[v];
    head[v] = m++;
}

int find(int x) {
    if (x == pre[x])
        return x;
    return pre[x] = find(pre[x]);
}

void merge(int x, int y) {
    int fx = find(x);
    int fy = find(y);
    
    if (fx != fy)
        pre[fx] = fy;
}

bool bfs() {
    int l = 0, r = 0;
    int u, v, k;
    
    memset(dis, 0, sizeof(dis));
    Q[r++] = s;
    dis[s] = 1;
    
    while (l < r) {
        u = Q[l++];
        for (k=head[u]; k!=-1; k=nxt[k]) {
            v = V[k];
            if (!dis[v] && F[k]) {
                dis[v] = dis[u] + 1;
                if (v == t)
                    return false;
                Q[r++] = v;
            }
        }
    }
    
    return true;
}

int dfs(int u, int val) {
    if (u==t || val==0)
        return val;
    
    int ret = 0;
    int tmp, v;
    
    for (int& k=head_[u]; k!=-1; k=nxt[k]) {
        v = V[k];
        if (F[k] && dis[v]==dis[u]+1 && (tmp=dfs(v, min(val, F[k])))>0) {
            F[k] -= tmp;
            F[k^1] += tmp;
            ret += tmp;
            val -= tmp;
            if (val == 0)
                break;
        }
    }
    
    return ret;
}

int Dinic() {
    int ret = 0, tmp;
    
    while (1) {
        if (bfs())
            break;
        
        memcpy(head_, head, sizeof(head));
        while (1) {
            tmp = dfs(s, INF);
            if (tmp == 0)
                break;
            ret += tmp;
        }
    }
    
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int tt;
    int c, K, f;
    int x, y;
    int l, r, mid;
    int ans, tmp;
    
    scanf("%d", &tt);
    while (tt--) {
        scanf("%d %d %d %d", &n, &c, &K, &f);
        rep(i, 0, c)
            scanf("%d %d", &X[i], &Y[i]);
        rep(i, 1, n+1)
            pre[i] = i;
        while (f--) {
            scanf("%d %d", &x, &y);
            merge(x, y);
        }
        
        m = 0;
        s = 3*n+1;
        t = s + 1;
        memset(head, -1, sizeof(head));
        memset(M, false, sizeof(M));
        
        rep(i, 1, n+1) {
            find(i);
            addEdge(s, i, 0);
            addEdge(i+n*2, t, 0);
        }
        rep(i, 1, n+1)
            addEdge(i, i+n, K);
        
        rep(i, 0, c) {
            x = X[i];
            y = Y[i];
            rep(j, 1, n+1) {
                if (pre[x]==pre[j] && !M[j][y]) {
                    M[j][y] = true;
                    addEdge(j, y+n*2, 1);
                }
            }
        }
        
        rep(i, 1, n+1) {
            rep(j, 1, n+1) {
                if (!M[i][j]) {
                    addEdge(i+n, j+n*2, 1);
                }
            }
        }
        
        l = 0;
        r = n;
        ans = 0;
        
        while (l <= r) {
            mid = (l + r) >> 1;
            for (int i=0; i<4*n; i+=4) {
                F[i] = F[i+2] = mid;
                F[i+1] = F[i+3] = 0;
            }
            rep(i, 4*n, m)
                F[i] = F_[i];
            tmp = Dinic();
            #ifndef ONLINE_JUDGE
                printf("tmp = %d
", tmp);
            #endif
            if (tmp >= mid*n) {
                ans = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        
        printf("%d
", ans);
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif
    
    return 0;
}