poj 3009 - Curling 2.0

点击(此处)折叠或打开

1. #include <iostream>
   
2. #include <stdio.h>
   
3. #include <cstring>
   
4. 
   
5. using namespace std;
   
6. 
   
7. int p,q;
   
8. int si,sj;
   
9. #define MAX_V (20+1)
   
10. #define MAX_L (10)
    
11. int T[MAX_V][MAX_V];
    
12. #define inf (2000000000)
    
13. 
    
14. struct move{
    
15.     int i;
    
16.     int j;
    
17. }MOVE[4]={{0,1},{1,0},{0,-1},{-1,0}};
    
18. 
    
19. int isValid(int i,int j)
    
20. {
    
21.     if(i < 1 || i> q)
    
22.         return 0;
    
23.     if(j < 1 || j> p)
    
24.         return 0;
    
25. 
    
26.     return 1;
    
27. }
    
28. 
    
29. #define printf //
    
30. int dfs(int i,int j,int t[][MAX_V],int l) //l表示当前步数
    
31. {
    
32. 
    
33.     if(l > MAX_L)
    
34.         return -1;
    
35. 
    
36.     int mi,mj,lmi,lmj;
    
37.     int minp=inf;
    
38. 
    
39.     printf("\n%d-------------------------------------------\n",l);
    
40.     printf("\nfrom (%d,%d)=%d\n\n",i,j,t[i][j]);
    
41. 
    
42.     for(int m=0;m<4;m++)
    
43.     {
    
44.         mi=i;
    
45.         mj=j;
    
46.         bool bFirstAdj=true;
    
47. 
    
48.         printf("\n m=%d\n\n",m);
    
49.         while(true)
    
50.         {
    
51.             lmi=mi;
    
52.             lmj=mj;
    
53.             mi += MOVE[m].i;
    
54.             mj += MOVE[m].j;
    
55. 
    
56.             //printf("try (%d,%d)\n",mi,mj);
    
57.             if(!isValid(mi,mj))
    
58.                 break;
    
59. 
    
60.             printf("t[%d][%d]=%d\n",mi,mj,t[mi][mj]);
    
61.             if(t[mi][mj] == 1)
    
62.             {
    
63.                 if(bFirstAdj)
    
64.                 {
    
65.                     printf("first block break....\n");
    
66.                     break;
    
67.                 }
    
68. 
    
69.                 int tmp[MAX_V][MAX_V];
    
70.                 memcpy(tmp,t,sizeof(tmp));
    
71.                 tmp[mi][mj]=0;
    
72. 
    
73.                 printf("set (%d,%d)=%d\n",mi,mj,tmp[mi][mj]);
    
74. 
    
75.                 int ret = dfs(lmi,lmj,tmp,l+1);
    
76. 
    
77.                 if(ret != -1)
    
78.                 {
    
79.                     if(ret < minp)
    
80.                     {
    
81.                         minp = ret;
    
82.                         printf("(%d,%d) ret =%d < minp=%d",mi,mj,ret,minp);
    
83.                     }
    
84.                 }
    
85. 
    
86.                 break;
    
87.             }
    
88.             else if(t[mi][mj] == 3)
    
89.             {
    
90.                 return l;
    
91.             }
    
92. 
    
93.             bFirstAdj=false;
    
94.         }
    
95.         
    
96.     }    
    
97. 
    
98.     if(minp == inf)
    
99.         return -1;
    
100.     return minp;
     
101. }
     
102. 
     
103. int main()
     
104. {
     
105.     while(cin>>p>>q)
     
106.     {
     
107.         if( p == 0 )
     
108.             break;
     
109. 
     
110.         for(int i=1;i<=q;i++)
     
111.         {
     
112.             for(int j=1;j<=p;j++)
     
113.             {
     
114.                 cin >>T[i][j];
     
115.                 if(T[i][j] == 2)
     
116.                 {
     
117.                     si=i;
     
118.                     sj=j;
     
119.                     //printf("si=%d,sj=%d\n",si,sj);
     
120.                 }
     
121.             }
     
122.         }
     
123. 
     
124.         printf("---------------------------------------\n");
     
125.         cout<<dfs(si,sj,T,1)<<endl;
     
126.         printf("---------------------------------------\n");
     
127.     }
     
128. }

<script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=3&lang=zh"></script> <script type=text/javascript charset=utf-8 src="http://static.bshare.cn/b/bshareC0.js"></script>

阅读(17) | 评论(0) | 转发(0) |

0

上一篇：poj 1321

下一篇：poj 3083

相关热门文章

• linux 常见服务端口
• 【ROOTFS搭建】busybox的httpd...
• 什么是shell
• linux socket的bug??
• linux的线程是否受到了保护？...

• cpu %和load average是怎样的...
• 如何确定线程使用的端口...
• mysql整形数据类型插入0001数...
• weblogic集群下启动服务有一个...
• Ajax 权限验证

给主人留下些什么吧！~~

评论热议