Gym - 101670J Punching Power（CTU Open Contest 2017 最大独立集）

题目：

The park management finally decided to install some popular boxing machines at various strategic places in the park. In fact, to compensate for the previous lack of machines, they decided to install as many machines as possible. Surprisingly enough, the park is not going to be choked with new machines because there are some quite serious legal limitations regarding the locations of the machines. The management has marked all possible boxing machine locations and their respective coordinates on the park plan. Additionally, they also have to respect manufacturer security rule: The distance between any two boxing machines has to be at least 1.3 meters.

Help the management to establish the maximum possible number of boxing machines which can be installed in the park.

Input Specification：

There are several test cases. Each case starts with a line containing one integer N which specifies the number of possible boxing machine locations in the park (1 ≤ N ≤ 2000). Next, there are N lines representing the location coordinates, each line describes one location by a pair of integer coordinates in meters. All locations in one test case are unique. Each coordinate is non-negative and less than or equal to 10⁹ .

You are guaranteed that all locations form a single connected group, that is, it is possible to start in any location and reach any other location by a sequence of steps, each of which changes exactly one coordinate by 1, without leaving the area suitable for placing boxing machines.

Output Specification:

For each test case, print a single line with one integer representing the maximum number of boxing machines which can be installed in the park.

思路：

反向来解决这道题目，先对不符合条件的点建图，求这个图的二分匹配。

建图的规则是水平竖直相邻的，距离是1，不符合题意，其他的距离肯定是大于1.3米的，直接自闭。

首先建好图，然后求最大独立集就ok了，最大独立集 = 点的个数 - 最大匹配数。

总结这道题被卡的原因：

对匈牙利算法的理解太浅显！

读题不精！

代码：

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = ;
struct Node
{
    int x,y;
} node[maxn];
vector<int>v[maxn];
int n,vis[maxn],linker[maxn];

bool dfs(int u)
{
    for(int i = ; i<v[u].size(); i++)//每个与u相连的点
    {
        int _v = v[u][i];//放进交替路中
        if(!vis[_v])
        {
            vis[_v] = ;
            if(linker[_v]== || dfs(linker[_v]))//是未匹配点，说明该交替路是增广路径，交换路径
            {
                linker[_v] = u;
                linker[u] = _v;
                return true;
            }
        }
    }
    return false;
}

int match()
{
    int res = ;
    memset(linker,,sizeof(linker));
    for(int i = ; i<n; i++)
    {
        memset(vis,,sizeof(vis));
        if(linker[i]== && dfs(i))
            res++;
    }
    return res;
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for(int i = ; i<=n; i++)
        {
            scanf("%d%d",&node[i].x,&node[i].y);
        }
        for(int i = ; i<=n; i++)
        {
            v[i].clear();
            for(int j = ; j<=n; j++)
            {
                if(abs(node[i].x-node[j].x)+abs(node[i].y-node[j].y)==)
                {
                    v[i].push_back(j);
                }
            }
        }
        int ans = match();
        //cout<<"ans: "<<ans<<endl;
        printf("%d\n",n-ans);
    }
    return ;
}