HDU 1845 Jimmy’s Assignment(二分图匹配)

题意：给你一类无向图,图中每个顶点都与另外3个点相连了.且如果你想让该类图不连通,那么至少需要删除2条边才可能做到，现在要你找出尽量多的点对,使得每对点之间都有边.

思路：有点读不懂题目...瞎做然后过了...感觉是在求最大匹配

#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=5000+10;

struct Max_Match
{
    int n;
    vector<int> g[maxn];
    bool vis[maxn];
    int left[maxn];

    void init(int n)
    {
        this->n=n;
        for(int i=1;i<=n;i++)
        {
            g[i].clear();
            left[i]=-1;
        }
    }

    bool match(int u)
    {
        for(int i=0;i<g[u].size();i++)
        {
            int v=g[u][i];
            if(!vis[v])
            {
                vis[v]=true;
                if(left[v]==-1 || match(left[v]))
                {
                    left[v]=u;
                    return true;
                }
            }
        }
        return false;
    }

    int solve()
    {
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            memset(vis,0,sizeof(vis));//如果这里用循环初始化vis反而超时
            if(match(i)) ans++;
        }
        return ans;
    }
}MM;

int main()
{
    int T; scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        MM.init(n);
        for(int i=0;i<3*n/2;i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            MM.g[u].push_back(v);
            MM.g[v].push_back(u);
        }
        printf("%d\n",MM.solve()/2);
    }
    return 0;
}

Description

Jimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special kind of graph. This graph is undirected, has N vertices and each vertex has degree 3. Furthermore, the graph is 2-edge-connected (that is, at least 2 edges need to be removed in order to make the graph disconnected). A matching is a subset of the graph’s edges, such that no two edges in the subset have a common vertex. A maximum matching is a matching having the maximum cardinality. 
  Given a series of instances of the special graph mentioned above, find the cardinality of a maximum matching for each instance. 

 

Input

The first line of input contains an integer number T, representing the number of graph descriptions to follow. Each description contains on the first line an even integer number N (4<=N<=5000), representing the number of vertices. Each of the next 3*N/2 lines contains two integers A and B, separated by one blank, denoting that there is an edge between vertex A and vertex B. The vertices are numbered from 1 to N. No edge may appear twice in the input. 

 

Output

For each of the T graphs, in the order given in the input, print one line containing the cardinality of a maximum matching. 

 

Sample Input

       
       

        
        2
4
1 2
1 3
1 4
2 3
2 4
3 4
4
1 2
1 3
1 4
2 3
2 4
3 4 
       
       

 

Sample Output

       
       

        
        2
2