HDU 4687 Boke and Tsukkomi (一般图匹配带花树)

题意：某场比赛，希望有效匹配数尽量多，在此条件下，输出题目给出组合中，无效匹配的边是哪些。

题解：一般图匹配带花树
先求一次最大匹配$cnt$是多少，然后遍历所有边，看删去该边上的两点（即带有这两个点的边都删除）最大匹配是否为$cnt-1$，若是，则为有效匹配，若小于该值，则为无效匹配，删除。

输出格式，pe一次，无效匹配可能为0，re一次…

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
//一般图匹配带花树
const int MAXN = 55;
int N; //点的个数，点的编号从1到N
bool Graph[MAXN][MAXN];
int Match[MAXN];
bool InQueue[MAXN], InPath[MAXN], InBlossom[MAXN];
int Head, Tail;
int Queue[MAXN];
int Start, Finish;
int NewBase;
int Father[MAXN], Base[MAXN];
int Count;//匹配数，匹配对数是Count/2
void Push(int u) {
    Queue[Tail] = u;
    Tail++;
    InQueue[u] = true;
}
int Pop() {
    int res = Queue[Head];
    Head++;
    return res;
}
int FindCommonAncestor(int u, int v) {
    memset(InPath, false, sizeof(InPath));
    while (true) {
        u = Base[u];
        InPath[u] = true;
        if (u == Start) break;
        u = Father[Match[u]];
    }
    while (true) {
        v = Base[v];
        if (InPath[v])break;
        v = Father[Match[v]];
    }
    return v;
}
void ResetTrace(int u) {
    int v;
    while (Base[u] != NewBase) {
        v = Match[u];
        InBlossom[Base[u]] = InBlossom[Base[v]] = true;
        u = Father[v];
        if (Base[u] != NewBase) Father[u] = v;
    }
}
void BloosomContract(int u, int v) {
    NewBase = FindCommonAncestor(u, v);
    memset(InBlossom, false, sizeof(InBlossom));
    ResetTrace(u);
    ResetTrace(v);
    if (Base[u] != NewBase) Father[u] = v;
    if (Base[v] != NewBase) Father[v] = u;
    for (int tu = 1; tu <= N; tu++)
        if (InBlossom[Base[tu]]) {
            Base[tu] = NewBase;
            if (!InQueue[tu]) Push(tu);
        }
}
void FindAugmentingPath() {
    memset(InQueue, false, sizeof(InQueue));
    memset(Father, 0, sizeof(Father));
    for (int i = 1; i <= N; i++)
        Base[i] = i;
    Head = Tail = 1;
    Push(Start);
    Finish = 0;
    while (Head < Tail) {
        int u = Pop();
        for (int v = 1; v <= N; v++)
            if (Graph[u][v] && (Base[u] != Base[v]) && (Match[u] != v)) {
                if ((v == Start) || ((Match[v] > 0) && Father[Match[v]] > 0))
                    BloosomContract(u, v);
                else if (Father[v] == 0) {
                    Father[v] = u;
                    if (Match[v] > 0)
                        Push(Match[v]);
                    else {
                        Finish = v;
                        return;
                    }
                }
            }
    }
}
void AugmentPath() {
    int u, v, w;
    u = Finish;
    while (u > 0) {
        v = Father[u];
        w = Match[v];
        Match[v] = u;
        Match[u] = v;
        u = w;
    }
}
void Edmonds() {
    memset(Match, 0, sizeof(Match));
    for (int u = 1; u <= N; u++)
        if (Match[u] == 0) {
            Start = u;
            FindAugmentingPath();
            if (Finish > 0)AugmentPath();
        }
}
int m, u[155], v[155];
bool g[MAXN][MAXN];
int main() {
    while (~scanf("%d%d", &N, &m)) {
        memset(Graph, false, sizeof(Graph));
        memset(g, false, sizeof(g));
        for (int i = 1; i <= m; i++) {
            scanf("%d%d", &u[i], &v[i]);
            Graph[u[i]][v[i]] = Graph[v[i]][u[i]] = true;
            g[u[i]][v[i]] = g[v[i]][u[i]] = true; //原图
        } 
        Edmonds();  //进行匹配
        Count = 0;
        for (int u = 1; u <= N; u++)
            if (Match[u] > 0)
                Count++;
        Count /= 2;
        vector<int> ans;
        for (int i = 1; i <= m; i++) {
            memcpy(Graph, g, sizeof(g));
            for (int j = 1; j <= N; j++) {
                Graph[u[i]][j] = Graph[j][u[i]] = false;
                Graph[v[i]][j] = Graph[j][v[i]] = false;
            }
            Edmonds();  //进行匹配
            int temp = 0;
            for (int u = 1; u <= N; u++)
                if (Match[u] > 0)
                    temp++;
            temp /= 2;
            if (temp < Count - 1) ans.push_back(i);
        }
        int siz = ans.size();
        printf("%d\n", siz);
        for (int i = 0; i < siz; i++) {
            printf("%d", ans[i]);
            if (i != siz - 1) printf(" ");
        }
        printf("\n");
    }
    return 0;
}