uva321 The New Villa

好久好久没一次ac了。。。。

隐式图搜索，直接可以用数组记录是否访问，bfs中保存每个状态之前的状态下标，便于打印路径。

依然出现了一些不该出现的错误，还是要加强基本功。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define HASHSIZE 110000
#define MAX 1000000
#define ROOM 11
using namespace std;

int R,D,S,amount[MAX],father[MAX];
char door[ROOM][ROOM],onoff[ROOM][ROOM],s[MAX][ROOM+1],vis[HASHSIZE];

int insert(int cur)
{
    int value=s[cur][0]*10000,i;
    for(i=1;i<=R;i++)
    {
        value+=s[cur][i]*(1<<(i-1));
    }
    if(vis[value]==1)
        return 0;
    else
    {
        vis[value]=1;
        return 1;
    }
}

void print(int cur)
{
    int i,j=father[cur];
    //printf("%d %d\n",cur,j);
    if(j==-1)
        return ;
    print(j);
    if(s[cur][0]!=s[j][0])
    {
        printf("- Move to room %d.\n",s[cur][0]);
    }
    for(i=1;i<=R;i++)
    {
        if(s[cur][i]!=s[j][i])
        {
            if(s[cur][i]==1)
                printf("- Switch on light in room %d.\n",i);
            else
                printf("- Switch off light in room %d.\n",i);//写错了
            break;
        }
    }
}
void bfs()
{
    int front=0,rear=1,i,j,flag=0,now;
    memset(s[0],0,ROOM+1);
    s[front][0]=1,s[front][1]=1,amount[front]=0,father[front]=-1;
    memset(vis,0,HASHSIZE);
    while(front<rear)
    {
        if(s[front][0]==R)
        {
            for(i=1;i<=R;i++)
                if(s[front][i]==1)
                break;
            if(i==R)
            {
                flag=1;
                break;
            }
        }
        now=s[front][0];
        for(i=1;i<=R;i++)//改变房间
        {
            if(door[now][i]==1&&s[front][i]==1)
            {
                memcpy(s[rear],s[front],ROOM+1);
                s[rear][0]=i;
                if(insert(rear)==1)
                {
                    father[rear]=front;
                    amount[rear]=amount[front]+1;
                    rear++;
                }
            }
        }
        for(i=1;i<=R;i++)//开关灯
        {
            if(i!=now&&onoff[now][i]==1)
            {
                memcpy(s[rear],s[front],ROOM+1);
                if(s[rear][i]==0)
                    s[rear][i]=1;
                else
                    s[rear][i]=0;
                if(insert(rear)==1)
                {
                    father[rear]=front;
                    amount[rear]=amount[front]+1;
                    rear++;
                }
            }
        }
        front++;
    }
    if(flag==0)
    {
        printf("The problem cannot be solved.\n");
    }
    else
    {
        printf("The problem can be solved in %d steps:\n",amount[front]);
        print(front);
    }
}

int main()
{
    int i,j,a,b,all=1;
    while(scanf("%d%d%d",&R,&D,&S)&&R+D+S)
    {
        memset(door,0,ROOM*ROOM);
        memset(onoff,0,ROOM*ROOM);
        for(i=0;i<D;i++)
        {
            scanf("%d%d",&a,&b);
            door[a][b]=door[b][a]=1;
        }
        for(i=0;i<S;i++)
        {
            scanf("%d%d",&a,&b);
            onoff[a][b]=1;
        }
        printf("Villa #%d\n",all++);
        bfs();
        printf("\n");
    }
    return 0;
}