zoukankan      html  css  js  c++  java
  • HDU 1240 Asteroids!(DFS简单搜索)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1240

    Asteroids!

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 2383    Accepted Submission(s): 1612


    Problem Description
    You're in space.
    You want to get home.
    There are asteroids.
    You don't want to hit them.
     
    Input
    Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.

    A single data set has 5 components:

    Start line - A single line, "START N", where 1 <= N <= 10.

    Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:

    'O' - (the letter "oh") Empty space

    'X' - (upper-case) Asteroid present

    Starting Position - A single line, "A B C", denoting the <A,B,C> coordinates of your craft's starting position. The coordinate values will be integers separated by individual spaces.

    Target Position - A single line, "D E F", denoting the <D,E,F> coordinates of your target's position. The coordinate values will be integers separated by individual spaces.

    End line - A single line, "END"

    The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.

    The first coordinate in a set indicates the column. Left column = 0.

    The second coordinate in a set indicates the row. Top row = 0.

    The third coordinate in a set indicates the slice. First slice = 0.

    Both the Starting Position and the Target Position will be in empty space.

     
    Output
    For each data set, there will be exactly one output set, and there will be no blank lines separating output sets.

    A single output set consists of a single line. If a route exists, the line will be in the format "X Y", where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be "NO ROUTE" instead.

    A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.

     
    Sample Input
    START 1 O 0 0 0 0 0 0 END START 3 XXX XXX XXX OOO OOO OOO XXX XXX XXX 0 0 1 2 2 1 END START 5 OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO XXXXX XXXXX XXXXX XXXXX XXXXX OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO OOOOO 0 0 0 4 4 4 END
     
    Sample Output
    1 0 3 4 NO ROUTE
     
    Source
     
    Recommend
    zf
     
    简单搜索题,一次水过。。。。数据不大,果断用DFS。。。
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<iostream>
     4 using namespace std;
     5 char g[20][20][20];
     6 int n,sx,sy,sz,ex,ey,ez,ok;
     7 int dis[6][3]={{1,0,0},{0,1,0},{0,0,1},{-1,0,0},{0,-1,0},{0,0,-1}};
     8 struct node
     9 {
    10     int x;
    11     int y;
    12     int z;
    13     int time;
    14 };
    15 void getdata()
    16 {
    17     int i,j,k=0;
    18     char s[20];
    19     memset(g,'\0',sizeof(g));
    20     for(k=0;k<n;k++)
    21     {
    22         for(i=0;i<n;i++)
    23         {
    24             scanf("%s",s);
    25             for(j=0;j<n;j++)
    26             g[i][j][k]=s[j];
    27         }
    28     }
    29     scanf("%d %d %d",&sx,&sy,&sz);
    30     scanf("%d %d %d",&ex,&ey,&ez);
    31     scanf("%s",s);
    32     getchar();
    33     ok=0;
    34 }
    35 void dfs(node po)
    36 {
    37     int i,j;
    38     node te;
    39     if(po.x==ex&&po.y==ey&&po.z==ez)
    40     {
    41         ok=1;
    42         printf("%d %d\n",n,po.time);
    43         return ;
    44     }
    45     for(i=0;!ok&&i<6;i++)
    46     {
    47         te.x=po.x+dis[i][0];
    48         te.y=po.y+dis[i][1];
    49         te.z=po.z+dis[i][2];
    50         te.time=po.time+1;
    51         if(!(te.x>=0&&te.x<n&&te.y>=0&&te.y<n&&te.z>=0&&te.z<n&&g[te.x][te.y][te.z]=='O'))continue;
    52         g[te.x][te.y][te.z]='X';
    53         dfs(te);
    54     }
    55 }
    56 int main()
    57 {
    58     node po;
    59     while(scanf("START %d",&n)!=EOF)
    60     {
    61         getchar();
    62         getdata();
    63         po.x=sx;
    64         po.y=sy;
    65         po.z=sz;
    66         po.time=0;
    67         dfs(po);
    68         if(!ok)printf("NO ROUTE\n");
    69     }
    70     return 0;
    71 }
  • 相关阅读:
    free解释
    无损 JBIG2 编码库(Lossless JBIG2 Encoder)
    PDF补丁丁暂停更新
    PDF补丁丁将字符识别结果写入PDF文件功能即将完成
    PDF补丁丁0.3.3版:字符识别结果写入PDF文件功能邀请测试
    PDF补丁丁 0.3.3.58版修复打开、输出超大型PDF文件问题
    PDF补丁丁0.3.3版即将发布
    PDF补丁丁0.3.3.12 新增查看PDF文件隐藏对象及导出流对象功能
    PDF 补丁丁 0.3.3 正式版发布
    PDF 补丁丁0.3.3.20版新增JBIG2压缩功能,可为扫描PDF瘦身
  • 原文地址:https://www.cnblogs.com/lfeng/p/3068695.html
Copyright © 2011-2022 走看看