TOJ 2017: N-Credible Mazes

2017: N-Credible Mazes 

Time Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByte
Total Submit: 6            Accepted:0

Description

An n-tersection is defined as a location in n-dimensional space, n being a positive integer, having all non-negative integer coordinates. For example, the location (1,2,3) represents an n-tersection in three dimensional space. Two n-tersections are said to be adjacent if they have the same number of dimensions and their coordinates differ by exactly 1 in a single dimension only. For example, (1,2,3) is adjacent to (0,2,3) and (2,2,3) and (1,2,4), but not to (2,3,3) or (3,2,3) or (1,2). An n-teresting space is defined as a collection of paths between adjacent n-tersections.

Finally, an n-credible maze is defined as an n-teresting space combined with two specific n-tersections in that space, one of which is identified as the starting n-tersection and the other as the ending n-tersection.

Input

The input file will consist of the descriptions of one or more n-credible mazes. The first line of the description will specify n, the dimension of the n-teresting space. (For this problem, n will not exceed 10, and all coordinate values will be less than 10.) The next line will contain 2n non-negative integers, the first n of which describe the starting n-tersection, least dimension first, and the next n of which describe the ending n-tersection. Next will be a nonnegative number of lines containing 2n non-negative integers each, identifying paths between adjacent n-tersections in the n-teresting space. The list is terminated by a line containing only the value ?C1. Several such maze descriptions may be present in the file. The end of the input is signalled by space dimension of zero. No further data will follow this terminating zero.

Output

For each maze output it's position in the input; e.g. the first maze is "Maze #1", the second is "Maze #2", etc. If it is possible to travel through the n-credible maze's n-teresting space from the starting n-tersection to the ending n-tersection, also output "can be travelled" on the same line. If such travel is not possible, output "cannot be travelled" instead.

Sample Input

2
0 0 2 2
0 0 0 1
0 1 0 2
0 2 1 2
1 2 2 2
-1
3
1 1 1 1 2 3
1 1 2 1 1 3
1 1 3 1 2 3
1 1 1 1 1 0
1 1 0 1 0 0
1 0 0 0 0 0
-1
0

Sample Output

Maze #1 can be travelled
Maze #2 cannot be travelled
数据的锅，理解题意写的代码大概都是可以AC的

爆搜的代码

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[][],b[][],c[][];
int main()
{
    int n,T=;
    while(~scanf("%d",&n),n)
    {
        int i,j,k;
        for(i=;;i++)
        {
            scanf("%d",&a[i][]);
            if(a[i][]==-)break;
            for(j=; j<n; j++)
                scanf("%d",&a[i][j]);
            for(j=; j<n; j++)
                scanf("%d",&b[i][j]);
        }
        for(k=; k<i; k++)
            for(j=; j<n; j++)
                c[k][j]=;
        c[][]=;
        for(i=; i<k; i++)
        {
            int f=;
            for(j=; j<n; j++)
                if(a[i+][j]!=a[i][j])
                {
                    f++;
                    if(abs(a[i+][j]-a[i][j])!=)break;
                }
            if(f<=&&j==n&&c[i][]==)c[i+][]=;
            f=;
            for(j=; j<n; j++)
                if(b[i][j]!=a[i][j])
                {
                    f++;
                    if(abs(b[i][j]-a[i][j])!=)break;
                }
            if(f<=&&j==n&&c[i][]==)c[i][]=;
            f=;
            for(j=; j<n; j++)
                if(b[i+][j]!=b[i][j])
                {
                    f++;
                    if(abs(b[i+][j]-b[i][j])!=)break;
                }
            if(f<=&&j==n&&c[i][]==)c[i+][]=;
            f=;
            for(j=; j<n; j++)
                if(b[i+][j]!=a[i+][j])
                {
                    f++;
                    if(abs(b[i+][j]-a[i+][j])!=)break;
                }
            if(f<=&&j==n&&c[i+][]==)c[i+][]=;
        }
        if(c[k-][]>=) printf("Maze #%d can be travelled\n",T++);
        else printf("Maze #%d cannot be travelled\n",T++);
    }
    return ;
}

map+set维护

#include<stdio.h>
#include<vector>
#include<set>
#include<map>
using namespace std;
map<int,vector<int> >M;
set<int>S;
int la(int &num,int n)
{
    num=;
    for(int i=; i<=n; i++)
    {
        int x;
        scanf("%d",&x);
        if(x==-)return ;
        num=num*+x;
    }
    return ;
}
int dfs(int st,int ed)
{
    if(st==ed)return ;
    int l=M[st].size();
    for(int i=; i<l; i++)
    {
        int v=M[st][i];
        if(!S.count(v))
        {
            S.insert(v);
            if(dfs(v,ed))return ;
        }
    }
    return ;
}
int main()
{
    int t=,n;
    while(~scanf("%d",&n))
    {
        if(n==)
        {
            if(scanf("%d",&n)==EOF)
                break;
        }
        M.clear(),S.clear();
        int st,ed;
        la(st,n);
        la(ed,n);
        int s,e;
        while(la(s,n))
        {
            la(e,n);
            M[s].push_back(e);
            M[e].push_back(s);
        }
        if(dfs(st,ed))
            printf("Maze #%d can be travelled\n",t++);
        else
            printf("Maze #%d cannot be travelled\n",t++);
    }
    return ;
}

网上的HDUac代码

#include<stdio.h>
#include<string.h>
int f,sum,e,s;
int a[],b[];
int mark[];
void dfs(int w)
{
    int i;
    if (w==e)
    {
        f=;
        return ;
    }
    for (i=; i<=sum; i++)
        if (mark[i]== && (a[i]==w || b[i]==w))
        {
            mark[i]=;
            if (a[i]==w) dfs(b[i]);
            else dfs(a[i]);
        }
}

int main()
{
    int Case,i,j,n,x;
    Case=;
    while (scanf("%d",&n)!=EOF)
    {
        if (n==) break;

        Case++;
        s=e=;
        for (i=; i<=n; i++)
        {
            scanf("%d",&x);
            s=s*+x;
        }
        for (i=; i<=n; i++)
        {
            scanf("%d",&x);
            e=e*+x;
        }

        sum=;
        memset(a,,sizeof(a));
        memset(b,,sizeof(b));

        while (scanf("%d",&x)!=EOF)
        {
            if (x==-) break;

            sum++;
            a[sum]=x;
            for (i=; i<n; i++)
            {
                scanf("%d",&x);
                a[sum]=a[sum]*+x;
            }
            for (i=; i<=n; i++)
            {
                scanf("%d",&x);
                b[sum]=b[sum]*+x;
            }

        }
        f=;
        memset(mark,,sizeof(mark));
        dfs(s);
        printf("Maze #%d ",Case);
        if (f==)
            printf("cannot be travelled\n");
        else
            printf("can be travelled\n");
    }
    return ;
}