UVA10085-不知错在何处

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #include<map>
 #include<queue>
 #include<string>
 using namespace std;
 typedef struct state STA;
 struct state
 {
     int st[][];
     int stnum;
     int step;
     string way;
     bool operator< (const state p)const
     {
         return this->step<p.step;
     }
 };

 const int dx[]={,-,,};
 const int dy[]={,,,-};
 const char Wy[]={'D','U','R','L'};

 int ans[][];
 string answay;
 int ans_step;

 map<int,bool> cyc;
 queue<STA> psd;

 int bfs(STA start)
 {
     int nowstep=start.step;
     int nowstate=start.stnum;
     int nowst[][];
     memcpy(nowst,start.st,sizeof(start.st));
     string noway=start.way;
     while()
     {
         cyc[nowstate]=true;
         //cout<<noway<<endl;
         if(nowstep>ans_step)
         {
             ans_step=nowstep;
             memcpy(ans,nowst,sizeof(nowst));
             answay=noway;
         }
         int x,y; int ok=;
         for(x=;x<;++x)
         {
             for(y=;y<;++y)
                 if(nowst[x][y]==){ok=;break;}
             if(ok)break;
         }
         //
         STA m;
         for(int i=;i<;++i)
         {
             int newx=x+dx[i];
             int newy=y+dy[i];
             ok=(newx>=&&newx<&&newy>=&&newy<);
             if(!ok)continue;
             memcpy(m.st,nowst,sizeof(m.st));
             m.st[x][y]=nowst[newx][newy];
             m.st[newx][newy]=;
             m.stnum=;
             for(int k=;k<;++k)
                 for(int j=;j<;++j)
                     m.stnum=m.stnum*+m.st[k][j];
             if(cyc[m.stnum]==true)continue;
             m.step=nowstep+;
             //m.way=noway.append(1,Wy[i]);
             m.way=noway;
             (m.way).append(,Wy[i]);
             psd.push(m);
         }
         if(psd.empty())break;
         m=psd.front();psd.pop();
         //
         nowstep=m.step;
         nowstate=m.stnum;
         memcpy(nowst,m.st,sizeof(m.st));//st[][]
         noway=m.way;//string
     }
     return ;
 }

 int main()
 {
     freopen("input.txt","r",stdin);
     freopen("ans.txt","w",stdout);
     int n;
     scanf("%d",&n);
     for(int c=;c<=n;c++)
     {
         ans_step=;
         cyc.clear();
         //
         STA m;
         m.way="";
         m.step=;
         int sum=;
         for(int i=;i<;++i)
         {
             for(int k=;k<;++k)
             {
                 scanf("%d",&m.st[i][k]);
                 sum=sum*+m.st[i][k];
             }
         }
         m.stnum=sum;
         //
         bfs(m);
         //
         printf("Puzzle #%d\n",c);
         for(int i=;i<;++i)
             printf("%d %d %d\n",ans[i][],ans[i][],ans[i][]);
         cout<<answay<<"\n"<<endl;
     }
     return ;
 }

下面是Udebug提供的查错：

样例：

我的结果：

Puzzle #

DDRUURDLLDRRULLURRDLDLUURDDLUUR

Puzzle #

DDRUULLDDRURULLDDRURULLDDRRUULL

Puzzle #

DDLUURDDLLUURDLURRDDLURDLLUURRD

Puzzle #

DRUULDDRRUULDRULLDDRULDRRUULLDD

Puzzle #

DRUULDDRUULDDRULLDRULURDDRUULD

Puzzle #

DLUURDDLLUURDLURRDDLURDLLUURRDD

Puzzle #

UURDDRULLURRDLLDRRULULDDRUULDDR

Puzzle #

UURDDLLUURDRDLLUURDRDLLUURRDDLL

Puzzle #

UULDDRUULLDDRULDRRUULDRULLDDRRU

正确答案：

Puzzle #

DDRUULDDRRUULDRULLDDRULDRRUULLD

Puzzle #

DDRULLURRDLLDRRULULDDRUULDDRRUU

Puzzle #

DDLUULDRRDLLURRULLDRDRUULDDRUUL

Puzzle #

URDRDLULDRUURDDLULURRDLLURRDLDL

Puzzle #

DRULLURRDLLDRRULULDDRUULDDRRUU

Puzzle #

ULDRDLULDRUURDDLULURRDLLURRDLDR

Puzzle #

UURDDLUURRDDLURDLLUURDLURRDDLLU

Puzzle #

UURDLLDRRULLURRDLDLUURDDLUURRDD

Puzzle #

UULDDLURRULLDRRDLLURURDDLUURDDL