Spoj1771-Yet Another N-Queen Problem(精确覆盖)

Description

After solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some queens have been set on particular locations on the board in this problem. Can you help him??

Input

The input contains multiple test cases. Every line begins with an integer N (N<=50), then N integers followed, representing the column number of the queen in each rows. If the number is 0, it means no queen has been set on this row. You can assume there is at least one solution.

Output

For each test case, print a line consists of N numbers separated by spaces, representing the column number of the queen in each row. If there are more than one answer, print any one of them.

Example

Input:
4 0 0 0 0
8 2 0 0 0 4 0 0 0

Output:
2 4 1 3
2 6 1 7 4 8 3 5

题意：N皇后问题，但是棋盘已经有一些皇后，然后问如何选择皇后的位置使得他们互不攻击，N<=50

 

解析:N这么大，显然不可能爆搜，这里用到的是精确覆盖DLX算法，行表示每个点，DLX的列对应棋盘的行，列和两个方向的斜对角。

搜到N步就可以了，考虑行就好了，不用考虑斜对角什么的。

 

代码：

#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int INF=1e9+7;
const int ms=51*51;
const int maxn=ms*5;
int N,ans[55],res[55];//ans存储第几个选择的编号，res保存第几行答案是第几列
struct DLX
{
    int n,id;
    int L[maxn],R[maxn],U[maxn],D[maxn];
    int C[maxn],S[maxn],loc[maxn][2];
    int H[ms];
    void init(int nn=0) //传列长
    {
        n=nn;
        for(int i=0;i<=n;i++) U[i]=D[i]=i,L[i]=i-1,R[i]=i+1;
        L[0]=n; R[n]=0;
        id=n;
        memset(S,0,sizeof(S));
        memset(H,-1,sizeof(H));
    }
    void Link(int x,int y)
    {
        ++id;
        D[id]=y; U[id]=U[y];
        D[U[y]]=id; U[y]=id;
        loc[id][0]=x,loc[id][1]=y;
        C[id]=y; S[y]++;
        if(H[x]==-1) H[x]=L[id]=R[id]=id;
        else
        {
            int a=H[x];
            int b=R[a];
            L[id]=a; R[a]=id;
            R[id]=b; L[b]=id;
            H[x]=id;
        }
    }
    void Remove(int c)
    {
        L[R[c]]=L[c];
        R[L[c]]=R[c];
        for(int i=D[c];i!=c;i=D[i])
            for(int j=R[i];j!=i;j=R[j])
        {
            U[D[j]]=U[j];
            D[U[j]]=D[j];
            S[C[j]]--;
        }
    }
    void Resume(int c)
    {
        for(int i=U[c];i!=c;i=U[i])
            for(int j=R[i];j!=i;j=R[j])
        {
            S[C[j]]++;
            U[D[j]]=j;
            D[U[j]]=j;
        }
        L[R[c]]=c;
        R[L[c]]=c;
    }
    bool dfs(int step)
    {
        if(step>=N) return true;
        if(R[0]==0) return false;
        int Min=INF,c=-1;
        for(int i=R[0];i;i=R[i])
        {
            if(i>N) break;
            if(Min>S[i]){ Min=S[i]; c=i; }
        }
        if(c==-1) return false;
        Remove(c);
        for(int i=D[c];i!=c;i=D[i])
        {
            ans[step]=loc[i][0];
            for(int j=R[i];j!=i;j=R[j]) Remove(C[j]);
            if(dfs(step+1)) return true;
            for(int j=L[i];j!=i;j=L[j]) Resume(C[j]);
        }
        Resume(c);
        return false;
    }
}dlx;
bool vis[55*6];
int main()
{
    while(scanf("%d",&N)!=EOF)
    {
        dlx.init(N*6-2);
        memset(vis,false,sizeof(vis));
        int y;
        for(int x=1;x<=N;x++)
        {
            scanf("%d",&y);
            if(y==0) continue;
            int a=x,b=N+y,c=2*N+N+x-y,d=4*N+x+y-2; //对应的行列斜对角编号
            vis[a]=vis[b]=vis[c]=vis[d]=true; //标记
            int t=(x-1)*N+y-1;
            dlx.Link(t,a); //连接
            dlx.Link(t,b);
            dlx.Link(t,c);
            dlx.Link(t,d);
        }
        for(int x=1;x<=N;x++)
            for(int y=1;y<=N;y++)
        {
            int a=x,b=N+y,c=2*N+N+x-y,d=4*N+x+y-2;
            if(vis[a]||vis[b]||vis[c]||vis[d]) continue; //有被占据不考虑
            int t=(x-1)*N+y-1;
            dlx.Link(t,a);
            dlx.Link(t,b);
            dlx.Link(t,c);
            dlx.Link(t,d);
        }
        if(!dlx.dfs(0)) printf("No answer find\n");
        else
        {
            for(int i=0;i<N;i++) res[ans[i]/N]=ans[i]%N;
            for(int i=0;i<N;i++) printf("%d%c",res[i]+1,i==N-1?'\n':' ');
        }
    }
    return 0;
}

View Code

 

转载于:https://www.cnblogs.com/wust-ouyangli/p/5749698.html