uva 705

最新推荐文章于 2016-07-20 20:00:18 发布

mathfinder

最新推荐文章于 2016-07-20 20:00:18 发布

阅读量406

点赞数

分类专栏： uva题解文章标签： dfs uva

本文链接：https://blog.csdn.net/leader880022/article/details/47047549

版权

uva题解专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int maxn = 200;
int maps[maxn][maxn];
int vis[maxn][maxn];
int r,c,ans,cnum,flag;
int dis[8][2] = { {-1,0},{1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1} };
int test(int x,int y,int f)
{
    if(x>=0&&x<r&&y>=0&&y<c&&!vis[x][y]&&maps[x][y] ==0 || x*c+y == f)return 1;
    else return 0;
}
void dfs(int f,int pre,int u,int cnt)
{
    if(flag)return ;
    if(vis[f/c][f%c] && u == f){flag = 1;cnum++;ans = max(ans,cnt);return;}
    int x = u/c,y = u%c;
    int nx,ny;
    vis[x][y] = 1;
    if(x%2&&y%2 || y%2 == 0&&x%2 == 0){///leftdown
        nx = x + dis[6][0],ny = y + dis[6][1];
        if(test(nx,ny,f) && nx*c+ny != pre)dfs(f,u,nx*c+ny,cnt+1);
    }
    if(x%2&&y%2 || y%2 == 0&&x%2 == 0){///rightup
        nx = x + dis[5][0],ny = y + dis[5][1];
        if(test(nx,ny,f) && nx*c+ny != pre)dfs(f,u,nx*c+ny,cnt+1);
    }
    if(x%2&&y%2==0 || x%2==0&&y%2){///leftup
        nx = x + dis[4][0],ny = y + dis[4][1];
        if(test(nx,ny,f) && nx*c+ny != pre)dfs(f,u,nx*c+ny,cnt+1);
    }
    if(x%2==0&&y%2 || x%2&&y%2==0){
        nx = x + dis[7][0],ny = y + dis[7][1];
        if(test(nx,ny,f) && nx*c+ny != pre)dfs(f,u,nx*c+ny,cnt+1);
    }

    for(int i = 0;i<4;i++){
        nx = x + dis[i][0],ny = y + dis[i][1];
        if(test(nx,ny,f) && nx*c+ny != pre)dfs(f,u,nx*c+ny,cnt+1);
    }
    if(flag)return;
    vis[x][y] = 0;
}
int main()
{
    int w,h,num = 0;
    char ss[maxn];
    ///freopen("in.txt","r",stdin);
    while(scanf("%d%d",&w,&h) != EOF){
        if(w == 0&&h == 0)break;
        r = h*2,c = w*2;
        cnum = ans = 0;
        memset(vis,0,sizeof(vis));
        for(int i = 0;i<h;i++){
            scanf("%s",ss);
            for(int j = 0;j<w;j++){
                if(ss[j] == '/'){
                    maps[i*2][j*2] = 0;maps[i*2][j*2+1] = 1;maps[i*2+1][j*2] = 1;maps[i*2+1][j*2+1] = 0;
                }else{
                    maps[i*2][j*2] = 1;maps[i*2][j*2+1] = 0;maps[i*2+1][j*2] = 0;maps[i*2+1][j*2+1] = 1;
                }
            }
        }
        for(int i = 0;i<r;i++){
            for(int j = 0;j<c;j++){
                flag = 0;
                if(!maps[i][j] && !vis[i][j])dfs(i*c+j,i*c+j, i*c+j, 0);
            }
        }
        printf("Maze #%d:\n",++num);
        if(ans)printf("%d Cycles; the longest has length %d.\n",cnum,ans);
        else printf("There are no cycles.\n");
        printf("\n");
    }
    return 0;
}