hdu 2828

最新推荐文章于 2022-02-25 19:38:17 发布

阅读量933

点赞数

文章标签： include c build

本文链接：https://blog.csdn.net/ywhorizen/article/details/6839771

版权

http://acm.hdu.edu.cn/showproblem.php?pid=2828

DLX重复覆盖，以开关的两种状态为行，灯泡为列，所以矩阵大小为 (m+m)*n 。为了方便这题加了行指针，对于选中某个开关的某一种状态，那么搜索的时候要把另一种状态去掉

# include <math.h>
# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <algorithm>
# include <iostream>
# include <string>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <vector>
# include <cstring>
# include <list>
# include <ctime>

# define For(i,a)   for((i)=0;i<(a);(i)++)
# define MAX(x,y)   ((x)>(y)? (x):(y))
# define MIN(x,y)   ((x)<(y)? (x):(y))
# define MEM(a)     (memset((a),0,sizeof(a)))
# define MEME(a)    (memset((a),-1,sizeof(a)))
# define MEMX(a)    (memset((a),0x7f,sizeof(a)))

using namespace std;

typedef long long           ll      ;
typedef unsigned long long  ull     ;
typedef unsigned int        uint    ;
typedef unsigned char       uchar   ;
#define N 505000

int U[N],R[N],L[N],D[N];
int S[505],H[1050],C[N],rol[N];
int n,m,head,size;
void build(int r,int c)
{
    S[c]++; C[size]=c;
    U[size]=U[c]; D[U[c]]=size;
    D[size]=c; U[c]=size;
    L[size]=L[r+n]; R[L[r+n]]=size;
    R[size]=r+n; L[r+n]=size;
    rol[size]=r;
    size++;
}
void remove(int &c)
{
    if(c>=n+1&&c<=n+m+m)
        return ;
    for(int i=D[c];i!=c;i=D[i])
    {
        L[R[i]]=L[i];
        R[L[i]]=R[i];
    }
}
void resume(int &c)
{
    for(int i=U[c];i!=c;i=U[i])
    {
        L[R[i]]=i;
        R[L[i]]=i;
    }
}
int ans[1050];
char b[550][4];
int dfs(int dep)
{
    int i,j,k,r,c,min;
    if(R[head]==head)
    {
        for(i=0;i<dep;i++)
        {
            if(ans[i]%2==0)
                strcpy(b[ans[i]/2],"OFF");
            else
                strcpy(b[(ans[i]+1)/2],"ON");
        }
        for(i=1;i<=m;i++)
            if(b[i][0]==0)
                printf("ON ");
            else
                printf("%s ",b[i]);
        printf("\n");
        return 1;
    }
    for(i=R[head],min=N;i!=head;i=R[i])
        if(S[i]<min)
        {
            min=S[i]; c=i;
        }
    remove(c);
    L[R[c]]=L[c]; R[L[c]]=R[c];
    for(i=D[c];i!=c;i=D[i])
    {
        L[R[i]]=i;R[L[i]]=i;
        ans[dep]=k=rol[i];
        if(k%2==0) r=k-1;
        else r=k+1;
        for(j=R[r+n];j!=r+n;j=R[j])
        {
            U[D[j]]=U[j];D[U[j]]=D[j];
            S[C[j]]--;
        }
        for(j=R[i];j!=i;j=R[j])
            remove(j);
        if(dfs(dep+1))
            return 1;
        for(j=L[i];j!=i;j=L[j])
            resume(j);
        for(j=L[r+n];j!=r+n;j=L[j])
        {
            U[D[j]]=j; D[U[j]]=j;
            S[C[j]]++;
        }
        L[R[i]]=L[i];R[L[i]]=R[i];
    }
    L[R[c]]=c; R[L[c]]=c;
    resume(c);
    return 0;
}
int main()
{
    int i,j,k,r;
    char str[4];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(i=0;i<=n;i++)
        {
            R[i]=i+1;L[i]=i-1;
            U[i]=i; D[i]=i;
            S[i]=0;
        }
        R[n]=0;L[0]=n;
        for(i=n+1;i<=n+m+m;i++)
        {
            R[i]=i;L[i]=i;
            D[i]=i+1; U[i]=i-1;
        }
        D[0]=n+1;U[n+1]=0;
        U[0]=n+m+m;D[n+m+m]=0;
        head=0;size=n+m+m+1;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&k);
            for(j=1;j<=k;j++)
            {
                scanf("%d%s",&r,str);
                if(str[1]=='N')
                    build(2*r-1,i);
                else
                    build(2*r,i);
            }
        }
        if(dfs(0)==0)
            printf("-1\n");
    }
}