BZOJ 1191

1191: [HNOI2006]超级英雄Hero

二分图匹配
一开始把m写成从0开始了。
因为match那位置是用0来标记未匹配，所以不能从0开始

BZOJ 1191

/**************************************************************
    Problem: 1191
    User: Dream_Tonight
    Language: C++
    Result: Accepted
    Time:48 ms
    Memory:1308 kb
****************************************************************/
 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <iostream>
#include <cstdio>
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 2e5 + 7;
const int INF = 1e9;
vector<int> e[1005];
int v[1005], match[1005];
 
bool hount(int x) {
    for (int i = 0; i < e[x].size(); i++) {
        int p = e[x][i];
        if (v[p] == 0) {
            v[p] = 1;
            if (match[p] == 0 || hount(match[p])) {
                match[p] = x;
                return true;
            }
        }
    }
    return false;
}
 
int main() {
    int n, m, x, y;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d", &x, &y);
        e[i].push_back(x);
        e[i].push_back(y);
    }
    int ans = 0;
    for (int i = 1; i <= m; i++) {
        memset(v,0,sizeof(v));
        if (hount(i)) ans++;
        else break;
    }
    printf("%d\n", ans);
    return 0;
}