UVA705-Slash Maze

摘文：~

很有意思的题目，无从下手，看到别人的用0,1的方式表示/ \感觉豁然开朗了许多，

这个题目可以把原题放大即可，放大2倍每次需要考虑8个方向，放大三倍每次考虑四个方向

放大2倍图

\  10     /   01

   01         10

放大3倍图

\  100  /   001

   010      010

   001      100

只需要把没个斜杠按放大图转化为0,1的矩阵，0表示可走，1表示不可走，剩下的就和以前一样了。

放大2倍的代码:

#include <iostream>
#include <cstring>
#define max 80
using namespace std;
int data[max*2][max*2], vis[max*2][max*2], flag, w, h, sum;
void dfs(int i, int j)
{
    if(i<0||i>=2*h||j<0||j>=2*w){flag = 0; return;}
    if(data[i][j]==1||data[i][j]==-1||vis[i][j])return;
    vis[i][j] = 1;
    sum++;
    if(data[i-1][j]==-1&&data[i][j-1]==-1)dfs(i-1,j-1);
    dfs(i-1,j);
    if(data[i-1][j]==1&&data[i][j+1]==1)dfs(i-1,j+1);
    dfs(i,j-1);             dfs(i,j+1);
    if(data[i][j-1]==1&&data[i+1][j]==1)dfs(i+1,j-1);
    dfs(i+1,j);
    if(data[i][j+1]==-1&&data[i+1][j]==-1)dfs(i+1,j+1);
}
int main ()
{
    int m, n, count = 0;
    while(cin>>w>>h&&w&&h)
    {
        cin.get();
        memset(data,0,sizeof(data));
        memset(vis,0,sizeof(vis));
        m = sum = n = 0;
        for(int i = 0; i < 2*h; i+=2,cin.get())
        for(int j = 0; j < 2*w; j+=2)
        {
            char ch = cin.get();
            if(ch == '\\')
            data[i][j] = data[i+1][j+1] = -1;
            else if(ch == '/')
            data[i][j+1] = data[i+1][j] = 1;
        }
        for(int i = 0; i < 2*h; i++)
        for(int j = 0; j < 2*w; j++)
        {
            if(!vis[i][j]&&!data[i][j])
            {
            flag = 1;
            dfs(i,j);
            n+=flag;
            m = (m<sum&&flag)?sum:m;
            sum = 0;
            }
        }
        cout<<"Maze #"<<++count<<":"<<endl;
        if(n)cout<<n<<" Cycles; the longest has length "<<m<<".\n\n";
        else cout<<"There are no cycles.\n\n";
    }
    return 0;
}

放大3倍的代码：

#include <iostream>
#include <cstring>
#define max 80
using namespace std;
int data[max*3][max*3], vis[max*3][max*3], flag, w, h, sum;
void dfs(int i, int j)
{
    if(i<0||i>=3*h||j<0||j>=3*w){flag = 0; return;}
    if(data[i][j]||vis[i][j])return;
    vis[i][j] = 1;
    sum++;
    dfs(i-1,j);
    dfs(i,j-1);
    dfs(i,j+1);
    dfs(i+1,j);
}
int main ()
{
    int m, n, count = 0;
    while(cin>>w>>h&&w&&h)
    {
        cin.get();
        memset(data,0,sizeof(data));
        memset(vis,0,sizeof(vis));
        m = sum = n = 0;
        for(int i = 0; i < 3*h; i+=3,cin.get())
        for(int j = 0; j < 3*w; j+=3)
        {
            char ch = cin.get();
            if(ch == '\\')
            data[i][j] = data[i+1][j+1] = data[i+2][j+2]= 1;
            else if(ch == '/')
            data[i][j+2] = data[i+1][j+1] = data[i+2][j]= 1;
        }
        for(int i = 0; i < 3*h; i++)
        for(int j = 0; j < 3*w; j++)
        {
            if(!vis[i][j]&&!data[i][j])
            {
            flag = 1;
            dfs(i,j);
            n+=flag;
            m = (m<sum&&flag)?sum:m;
            sum = 0;
            }
        }
        cout<<"Maze #"<<++count<<":"<<endl;
        if(n)cout<<n<<" Cycles; the longest has length "<<m/3<<".\n\n";
        else cout<<"There are no cycles.\n\n";
    }
    return 0;
}

此题的难度在于图的放大。只要放大了以后，再进行dfs，水到渠成的事。