zoukankan      html  css  js  c++  java
  • POJ 2049 Finding Nemo



    Finding Nemo
    Time Limit: 2000MSMemory Limit: 30000K
    Total Submissions: 7006Accepted: 1612

    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. 
    POJ 2049 Finding Nemo - qhn999 - 码代码的猿猿

    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

    8 9
    1 1 1 3
    2 1 1 3
    3 1 1 3
    4 1 1 3
    1 1 0 3
    1 2 0 3
    1 3 0 3
    1 4 0 3
    2 1 1
    2 2 1
    2 3 1
    3 1 1
    3 2 1
    3 3 1
    1 2 0
    3 3 0
    4 3 1
    1.5 1.5
    4 0
    1 1 0 1
    1 1 1 1
    2 1 1 1
    1 2 0 1
    1.5 1.7
    -1 -1

    Sample Output

    5
    -1

    Source

    Beijing 2004 

    判重的时候:用位置+已经穿过的门数


    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <queue>
    #include <cmath>

    using namespace std;

    int N,M;
    const int INF=0x3f3f3f3f;
    int mp[205][205][4];
    int vis[205][205];

    struct node
    {
        int x,y;
        int door;
    };

    bool isOK(node s)
    {
        if(s.x<205&&s.x>=0&&s.y<205&&s.y>=0)
            return true;
        else
            return false;
    }

    int main()
    {
    while(cin>>N>>M)
    {
        int x,y,d,t;
        if(N==-1&&M==-1break;
        memset(mp,0,sizeof(mp));
        memset(vis,63,sizeof(vis));
        for(int o=0;o<N;o++)
        {
            cin>>x>>y>>d>>t;
            if(d==0)
            {
                for(int i=x;i<x+t;i++)
                {
                    mp[y][2]=1;
                    if(y-1>=0)
                        mp[y-1][0]=1;
                }
            }
            else if(d==1)
            {
                for(int i=y;i<y+t;i++)
                {
                    mp[x][3]=1;
                    if(x-1>=0)
                        mp[x-1][1]=1;
                }
            }
        }
        for(int o=0;o<M;o++)
        {
            cin>>x>>y>>d;
            if(d==0)
            {
                mp[x][y][2]=2;
                if(y-1>=0)
                    mp[x][y-1][0]=2;
            }
            else if(d==1)
            {
                mp[x][y][3]=2;
                if(x-1>=0)
                    mp[x-1][y][1]=2;
            }
        }

        double a,b;
        cin>>a>>b;
        node st;
        st.x=floor(a),st.y=floor(b);
        st.door=0;
        if(!isOK(st))
        {
            cout<<0<<endl;
            continue;
        }
        vis[st.x][st.y]=0;
        queue<node> q;
        q.push(st);
        int ans=INF;
        while(!q.empty())
        {
            node A,B;
            A=q.front(); q.pop();
            if(A.x==0&&A.y==0)
            {
                ans=min(A.door,ans);
                continue ;
            }
            ///up
            B.x=A.x; B.y=A.y+1;B.door=A.door;
            if(isOK(B)&&mp[A.x][A.y][0]!=1)
            {
                if(mp[A.x][A.y][0]==2) B.door++;
                if(vis[B.x][B.y]>B.door)
                {
                    vis[B.x][B.y]=B.door;
                    q.push(B);
                }
            }
            ///down
            B.x=A.x; B.y=A.y-1;B.door=A.door;
            if(isOK(B)&&mp[A.x][A.y][2]!=1)
            {
                if(mp[A.x][A.y][2]==2) B.door++;
                if(vis[B.x][B.y]>B.door)
                {
                    vis[B.x][B.y]=B.door;
                    q.push(B);
                }
            }
            ///left
            B.x=A.x-1;B.y=A.y;B.door=A.door;
            if(isOK(B)&&mp[A.x][A.y][3]!=1)
            {
                if(mp[A.x][A.y][3]==2) B.door++;
                if(vis[B.x][B.y]>B.door)
                {
                    vis[B.x][B.y]=B.door;
                    q.push(B);
                }
            }
            ///right
            B.x=A.x+1;B.y=A.y;B.door=A.door;
            if(isOK(B)&&mp[A.x][A.y][1]!=1)
            {
                if(mp[A.x][A.y][1]==2) B.door++;
                if(vis[B.x][B.y]>B.door)
                {
                    vis[B.x][B.y]=B.door;
                    q.push(B);
                }
            }
        }
        if(ans==INF) ans=-1;
        cout<<ans<<endl;
    }

        return 0;
    }
    * This source code was highlighted by YcdoiT. ( style: Pyte )
     
  • 相关阅读:
    应用程序域的用法
    WCF 暴露元数据的配置
    无svc文件发布WCF服务到IIS上
    C#输出毫秒
    [一点一滴学英语]20051017
    从其他平台转向Windows,MS提供了很多便利;那反过来呢?
    Ward Cunningham加入Eclipse?
    [导入][链接]Linux常用命令/快捷键
    [导入][号外]Oracle to buy JBoss, Zend and Sleepycat?
    [导入][链接]Google开始向Linux移植其Windows应用程序?
  • 原文地址:https://www.cnblogs.com/CKboss/p/3350901.html
Copyright © 2011-2022 走看看