hdu 5727 - Necklace ( 环排列 + 二分图匹配）

Problem Description

SJX has 2*N magic gems.  N  of them have Yin energy inside while others have Yang energy. SJX wants to make a necklace with these magic gems for his beloved BHB. To avoid making the necklace too Yin or too Yang, he must place these magic gems Yin after Yang and Yang after Yin, which means two adjacent gems must have different kind of energy. But he finds that some gems with Yang energy will become somber adjacent with some of the Yin gems and impact the value of the neckless. After trying multiple times, he finds out M rules of the gems. He wants to have a most valuable neckless which means the somber gems must be as less as possible. So he wonders how many gems with Yang energy will become somber if he make the necklace in the best way.

 

Input

  Multiple test cases.

  For each test case, the first line contains two integers  N(0≤N≤9),M(0≤M≤N∗N) , descripted as above.

  Then  M  lines followed, every line contains two integers  X,Y , indicates that magic gem  X  with Yang energy will become somber adjacent with the magic gem  Y with Yin energy.

 

Output

One line per case, an integer indicates that how many gem will become somber at least.

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   1
1
  
  

 

题意：

有2n(0<=n<=9)个珠子，分成阴阳两极，每极各n个。

用这2n个珠子做成一个项链，使得相邻两个珠子的极性是不一样的，因为有一些阳性的珠子会被一些阴性的珠子所削弱在它们它们相邻的情况下。

给你m(0<=m<=n*(n-1)/2)个关系[x,y]表示阳性珠子x会被阴性珠子y在相邻情况下所削弱。问你最少有多少个阳性被削弱。

题解：

我们可以先暴力枚举出所有阴性珠子的排列情况(因为是环，所以有(n-1)!种)，然后在它们之间插入阳性的珠子，判断出阳性珠子插入在之间会不会被削弱。我们通过匈牙利算法算出最大匹配sum，然后算出n-sum,对于每种排列取最小值就得到了我们想要的答案，注意特判下n=0的情况。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));


int T;
int n,m;

int pos[12];
int vis[12];
int mp[12][12];
int ans=0;


int g[12][12];
int linker[12];
bool used[12];

bool dfs2(int u)
{
    for(int v=1;v<=n;v++)
        if(g[u][v] && !used[v])
    {
        used[v] = true;
        if(linker[v] == -1 || dfs2(linker[v]))
        {
            linker[v]=u;
            return  true;
        }
    }
    return false;
}

int hungary(int n)
{
    int res=0;
    memset(linker,-1,sizeof(linker));
    for(int u=1;u<=n;u++)
    {
        memset(used,0,sizeof(used));
        if(dfs2(u)) res++;
    }
    return res;
}



void solve()
{
    memset(g,1,sizeof(g));

    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if( mp[ pos[i] ][j] || mp[ pos[i-1] ][j])
                g[i][j]=0;
        }
    }

    for(int j=1;j<=n;j++)
    {
        if(mp[pos[1]][j] || mp[pos[n]][j]) g[1][j]=0;
    }

    int re=hungary(n);
    ans= min(ans,n-re);
}


void dfs(int ps)
{
    if(ps>=n+1)
    {
        solve();
        return;
    }
    for(int i=2;i<=n;i++)
    {
        if(vis[i]) continue;

        vis[i]=1;

        pos[ps]=i;
        dfs(ps+1);

        vis[i]=0;
    }
}

int main()
{
    int cas=1;
    int a,b;

    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(mp,0,sizeof(mp));
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            mp[b][a]=1;
        }

        ans=n;

        memset(vis,0,sizeof(vis));
        pos[1]=1;vis[1]=1;

        dfs(2);

        printf("%d\n",ans);

    }
    return 0
}