HDOJ 1054 Strategic Game

题意：有n个城镇，每个城镇有mi条路与其他城镇相连，城镇中的岗哨能观察到所有与这个城镇相连的路，求最少要多少个岗哨才能观察到所有的路。

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1054

思路：最小顶点覆盖问题，将图转化为二分图，利用匈牙利算法求解，最小顶点数=最大匹配数/2

注意点：数据读入时可用scanf，便于读入。注意邻接表的初始化

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
12836637	2015-01-29 10:35:18	Accepted	1054	670MS	1716K	1839 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
const int maxn = 1505;
vector<int> g[maxn];
int from[maxn];
int tot;
bool use[maxn];

bool match ( int x )
{
    for ( int i = 0; i < g[x].size(); i ++ ){
        if ( ! use[g[x][i]] ){
            use[g[x][i]] = true;
            if ( from[g[x][i]] == -1 || match ( from[g[x][i]] ) ){
                from[g[x][i]] = x;
                return true;
            }
        }
    }
    return false;
}

int hungary( int n )
{
    tot = 0;
    clr ( from, 255 );
    for ( int i = 0; i < n; i ++ ){
        clr ( use, 0 );
        if ( match( i ) )tot++;
    }
    return tot;
}

int main()
{
    ios::sync_with_stdio( false );

    int n;
    while ( scanf ( "%d", &n ) != EOF ){
        for ( int i = 0; i < maxn; i ++ )g[i].clear();
        int k, tmp, m;
        for ( int i = 0; i < n; i ++ ){
            scanf ( "%d:(%d)", &k, &m );//cin >> k;
            for ( int i = 0; i < m; i ++ ){
                scanf ( "%d", &tmp );//cin >> tmp;
                g[k].pb( tmp );
                g[tmp].pb( k );
            }
        }
        printf ( "%d\n", hungary( n ) / 2 );//cout << hungary( n ) / 2 << endl;
    }
    return 0;
}