POJ 2049 Finding Nemo

时间：2016-05-02 18:21:31 阅读：149 评论：0 收藏：0 [点我收藏+]

标签：

Finding Nemo

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 8631		Accepted: 2019

Description

Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and couldn‘t find his way home. Therefore, he sent a signal to his father, Marlin, to ask for help.
After checking the map, Marlin found that the sea is like a labyrinth with walls and doors. All the walls are parallel to the X-axis or to the Y-axis. The thickness of the walls are assumed to be zero.
All the doors are opened on the walls and have a length of 1. Marlin cannot go through a wall unless there is a door on the wall. Because going through a door is dangerous (there may be some virulent medusas near the doors), Marlin wants to go through as few doors as he could to find Nemo.
Figure-1 shows an example of the labyrinth and the path Marlin went through to find Nemo.
技术分享

We assume Marlin‘s initial position is at (0, 0). Given the position of Nemo and the configuration of walls and doors, please write a program to calculate the minimum number of doors Marlin has to go through in order to reach Nemo.

Input

The input consists of several test cases. Each test case is started by two non-negative integers M and N. M represents the number of walls in the labyrinth and N represents the number of doors.
Then follow M lines, each containing four integers that describe a wall in the following format:
x y d t
(x, y) indicates the lower-left point of the wall, d is the direction of the wall -- 0 means it‘s parallel to the X-axis and 1 means that it‘s parallel to the Y-axis, and t gives the length of the wall.
The coordinates of two ends of any wall will be in the range of [1,199].
Then there are N lines that give the description of the doors:
x y d
x, y, d have the same meaning as the walls. As the doors have fixed length of 1, t is omitted.
The last line of each case contains two positive float numbers:
f1 f2
(f1, f2) gives the position of Nemo. And it will not lie within any wall or door.
A test case of M = -1 and N = -1 indicates the end of input, and should not be processed.

Output

For each test case, in a separate line, please output the minimum number of doors Marlin has to go through in order to rescue his son. If he can‘t reach Nemo, output -1.

Sample Input

Sample Output

5
-1

  1 #include <stdio.h>
  2 #include <string.h>
  3 #include <stdlib.h>
  4 #include <iostream>
  5 #include <algorithm>
  6 #include <queue>
  7 using namespace std;
  8 const int inf=0x3f3f3f3f;
  9 struct node {
 10         int x, y;
 11         int ans;
 12 } f1,f2;
 13 int map[210][210][3];
 14 int vis[210][210];
 15 int jx[]= {0,0,1,-1};
 16 int jy[]= {1,-1,0,0};
 17 int min1;
 18 void bfs(int s, int e)
 19 {
 20         int i, j;
 21         queue<node>q;
 22         f1.x=s;
 23         f1.y=e;
 24         f1.ans=0;
 25         vis[s][e]=1;
 26         q.push(f1);
 27         min1=inf;
 28         while(!q.empty()) {
 29                 f1=q.front();
 30                 q.pop();
 31                 if(f1.x<=0||f1.x>=199||f1.y<=0||f1.y>=199) {//边界处理，但是不能跳出，只能跳过，因为存在多个门的情况
 32                         min1=min(min1,f1.ans); //走出去之后，保存最小通过门数
 33                         continue ;
 34                 }
 35                 for(i=0; i<4; i++) {
 36                         f2.x=f1.x+jx[i];
 37                         f2.y=f1.y+jy[i];
 38                         if(i==0) {//向上走
 39                                 if(!vis[f2.x][f2.y]&&map[f1.x][f1.y][0]!=2) {
 40                                         if(map[f1.x][f1.y][0]==1)
 41                                                 f2.ans=f1.ans+1;
 42                                         else
 43                                                 f2.ans=f1.ans;
 44                                         vis[f2.x][f2.y]=1;
 45                                         q.push(f2);
 46                                 }
 47                         } else if(i==1) {//向下走
 48                                 if(!vis[f2.x][f2.y]&&map[f2.x][f2.y][0]!=2) {
 49                                         if(map[f2.x][f2.y][0]==1)
 50                                                 f2.ans=f1.ans+1;
 51                                         else
 52                                                 f2.ans=f1.ans;
 53                                         vis[f2.x][f2.y]=1;
 54                                         q.push(f2);
 55                                 }
 56                         } else if(i==2) {//向右走
 57                                 if(!vis[f2.x][f2.y]&&map[f1.x][f1.y][1]!=2) {
 58                                         if(map[f1.x][f1.y][1]==1)
 59                                                 f2.ans=f1.ans+1;
 60                                         else
 61                                                 f2.ans=f1.ans;
 62                                         vis[f2.x][f2.y]=1;
 63                                         q.push(f2);
 64                                 }
 65                         } else if(i==3) {//向左走
 66                                 if(!vis[f2.x][f2.y]&&map[f2.x][f2.y][1]!=2) {
 67                                         if(map[f2.x][f2.y][1]==1)
 68                                                 f2.ans=f1.ans+1;
 69                                         else
 70                                                 f2.ans=f1.ans;
 71                                         vis[f2.x][f2.y]=1;
 72                                         q.push(f2);
 73                                 }
 74                         }
 75                 }
 76         }
 77 }
 78 int main()
 79 {
 80         int n, m, i, j;
 81         int x,y,d,t;
 82         double a1,a2;
 83         int int_x,int_y;
 84         while(scanf("%d %d",&m,&n)!=EOF) {
 85                 if(n==-1&&m==-1) break;
 86                 memset(map,0,sizeof(map));
 87                 memset(vis,0,sizeof(vis));
 88                 for(i=0; i<m; i++) {
 89                         scanf("%d %d %d %d",&x, &y, &d, &t);
 90                         if(d) {
 91                                 for(j=0; j<t; j++) {
 92                                         map[x-1][y+j][1]=2;
 93                                 }
 94                         } else {
 95                                 for(j=0; j<t; j++) {
 96                                         map[x+j][y-1][0]=2;
 97                                 }
 98                         }
 99                 }
100                 for(i=0; i<n; i++) {
101                         scanf("%d %d %d",&x,&y,&d);
102                         if(d) {
103                                 map[x-1][y][1]=1;
104                         } else {
105                                 map[x][y-1][0]=1;
106                         }
107                 }
108                 scanf("%lf %lf",&a1,&a2);
109                 int_x=a1;
110                 int_y=a2;
111                 if(int_x<=0||int_x>=199||int_y<=0||int_y>=199) {//后台可能出现 0,0 200+,200+，虽然不符合题目描述
112                         printf("0\n");
113                         continue ;
114                 }
115                 bfs(int_x,int_y);
116                 if(min1==inf)
117                         printf("-1\n");
118                 else
119                         printf("%d\n",min1);
120         }
121         return 0;
122 }

POJ 2049 Finding Nemo

标签：

原文地址：http://www.cnblogs.com/glchen/p/5452693.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行