HDU3861 - The King’s Problem

数组开小了一直判WA太坑了。 SCC + 最小路径覆盖

#include <cstring>
#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define INF (int)(1e9)
#define maxn 5050
using namespace std;
typedef long long ll;
int p = 0;
struct node {
    int to, w, next;
};
node edge[100010];
int head[maxn];
void add_edge(int u, int v, int w) {
    edge[p].to = v;
    edge[p].w = w;
    edge[p].next = head[u];
    head[u] = p;
    ++ p;
}
int pre[maxn], lowlink[maxn], sccno[maxn], dfs_clock, scc_cnt;
//sccno[i]为i所在scc编号
stack<int> S;
ll res, num, cnt;
void dfs1(int u) {
    pre[u] = lowlink[u] = ++dfs_clock;
    S.push(u);
    for (int k = head[u]; k != -1; k = edge[k].next) {
        int v = edge[k].to;
        if (!pre[v]) {
            dfs1(v);
            lowlink[u] = min(lowlink[u], lowlink[v]);
        } else if (!sccno[v]) {
            lowlink[u] = min(lowlink[u], pre[v]);
        }
    }
    if (lowlink[u] == pre[u]) {
        scc_cnt++;
        for (;;) {
            int x = S.top(); S.pop();
            sccno[x] = scc_cnt;
            if (x == u) break;
        }
    }
}
void find_scc(int n) {
    dfs_clock = scc_cnt = 0;
    memset(sccno, 0, sizeof(sccno));
    memset(pre, 0, sizeof(pre));
    for (int i = 0; i < n; ++ i) {
        if (!pre[i]) dfs1(i);
    }
}
int uN, vN;//u,v数目
int linker[maxn];
bool used[maxn];
bool dfs(int u) { //从左边开始找增广路径
    for (int k = head[u]; k != -1; k = edge[k].next) {
        int v = edge[k].to;
        if(!used[v]) {
            used[v] = true;
            if(linker[v] == -1 || dfs(linker[v])) {
                //找增广路，反向
                linker[v] = u;
                return true;
            }
        }
    }
    return false;
}
int max_match() {
    int res=0;
    int u;
    memset(linker,-1,sizeof(linker));
    for(u = 0; u < uN; u++) {
        memset(used, 0, sizeof(used));
        if(dfs(u)) res ++;
    }
    return res;
}
int no[100010][2];
int main() {
    int t;
    scanf("%d", &t);
    while (t --) {
        memset(head, -1, sizeof(head)), p = 0;
        int n, m, u, v;
        scanf("%d%d", &n, &m);
        for (int i = 0; i < m; ++ i) {
            scanf("%d%d", &u, &v);
            -- u, -- v;
            no[i][0] = u, no[i][1] = v;
            add_edge(u,v,0);
        }
        find_scc(n);
        memset(head, -1, sizeof(head)), p = 0;
        for (int i = 0; i < m; ++ i) {
            u = no[i][0], v = no[i][1];
            if (sccno[u] != sccno[v]) {
                add_edge(sccno[u]-1,sccno[v]-1,0);
            }
        }
        uN = vN = scc_cnt;
        cout << scc_cnt - max_match() << endl;
    }
}