UVa10047 - The Monocycle

2014-11-24 11:05:34 · 作者: · 浏览: 0

题目地址:点击打开链接

数组int visited[maxsize][maxsize][4][5];//4代表4个方向,5代编5中颜色,0,1,2,3代编北东南东西,Color:0,1,2,3,4

用来标记到达某个点的方向,颜色和时间。

注意输出格式!

C++代码:

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        using namespace std; const int maxsize = 30; string s[maxsize]; int visited[maxsize][maxsize][4][5];//4代表4个方向,5代编5中颜色,0,1,2,3代编北东南东西,Color:0,1,2,3,4 int m,n;//m行n列 bool flag; int start_x,start_y,end_x,end_y; int add[4][2]={-1,0,0,-1,1,0,0,1}; int t; struct MyStruct { int x; int y; int d; int c; }; void bfs(int x,int y,int d,int c) { visited[x][y][d][c]=0; deque
       
         dp; MyStruct p; p.x=x;p.y=y;p.d=d;p.c=c; dp.push_back(p); while(!dp.empty()) { MyStruct q=dp.front(); if(q.x==end_x&&q.y==end_y&&q.c==0) { t=visited[q.x][q.y][q.d][q.c]; flag=true; return ; } dp.pop_front(); int x_temp=q.x+add[q.d][0]; int y_temp=q.y+add[q.d][1]; int d=q.d; int c=(q.c+1)%5; if(x_temp>=0&&x_temp
        
         =0&&y_temp
         
          >m>>n&&(m||n)) { int i,j; for(i=0;i
          
           >s[i]; for(j=0;j
           
            1) cout<