zoukankan      html  css  js  c++  java
  • POJ 3037 Skiing(Dijkstra)

    Skiing
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 4668   Accepted: 1242   Special Judge

    Description

    Bessie and the rest of Farmer John's cows are taking a trip this winter to go skiing. One day Bessie finds herself at the top left corner of an R (1 <= R <= 100) by C (1 <= C <= 100) grid of elevations E (-25 <= E <= 25). In order to join FJ and the other cows at a discow party, she must get down to the bottom right corner as quickly as she can by travelling only north, south, east, and west. 

    Bessie starts out travelling at a initial speed V (1 <= V <= 1,000,000). She has discovered a remarkable relationship between her speed and her elevation change. When Bessie moves from a location of height A to an adjacent location of eight B, her speed is multiplied by the number 2^(A-B). The time it takes Bessie to travel from a location to an adjacent location is the reciprocal of her speed when she is at the first location. 

    Find the both smallest amount of time it will take Bessie to join her cow friends. 

    Input

    * Line 1: Three space-separated integers: V, R, and C, which respectively represent Bessie's initial velocity and the number of rows and columns in the grid. 

    * Lines 2..R+1: C integers representing the elevation E of the corresponding location on the grid.

    Output

    A single number value, printed to two exactly decimal places: the minimum amount of time that Bessie can take to reach the bottom right corner of the grid.

    Sample Input

    1 3 3
    1 5 3
    6 3 5
    2 4 3

    Sample Output

    29.00


    Dijkstra

    用优先队列,否则可能会超时。还是比较直白的

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    #include <queue>
    
    using namespace std;
    #define MAX 9000000000
    struct Node
    {
        int x,y;
        double time;
        double v;
        Node (){};
        Node (int x,int y,double time,double v)
        {
            this->x=x;
            this->y=y;
            this->time=time;
            this->v=v;
        }
        friend bool operator <(Node a,Node b)
        {
    		if(a.time==b.time)
    			return a.v<b.v;
            return a.time>b.time;
        }
    };
    int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
    int n,m;
    int v;
    int vis[105][105];
    int a[105][105];
    double s[105][105];
    void Dijsktra()
    {
        priority_queue<Node> q;
        q.push(Node(1,1,0,v));
        while(!q.empty())
        {
            Node term=q.top();
            q.pop();
            if(vis[term.x][term.y]) continue;
            vis[term.x][term.y]=1;
            for(int i=0;i<4;i++)
            {
                int xx=term.x+dir[i][0];
                int yy=term.y+dir[i][1];
                if(xx<1||xx>n||yy<1||yy>m) continue;
                if(vis[xx][yy]) continue;
                if(s[xx][yy]>term.time+1.0/term.v)
                {
                    s[xx][yy]=term.time+1.0/term.v;
    				q.push(Node(xx,yy,s[xx][yy],term.v*pow(2.0,a[term.x][term.y]-a[xx][yy])));
    				
                }
            }
        }
    }
    int main()
    {
        while(scanf("%d%d%d",&v,&n,&m)!=EOF)
        {
            for(int i=1;i<=n;i++)
                for(int j=1;j<=m;j++)
                {scanf("%d",&a[i][j]);s[i][j]=MAX;}
            memset(vis,0,sizeof(vis));
            s[1][1]=0;
            Dijsktra();
            printf("%.2f
    ",s[n][m]);
        }
        return 0;
    }


  • 相关阅读:
    50道sql练习题和答案
    异步编程的数据同步
    浅说异步编程
    进程、应用程序域,线程和上下文之间的关系
    关于薪资和技术的一些思考
    SharePoint2013 列表栏设置
    SharePoint2013 功能区的配置
    EF Code First 数据迁移配置
    EF CodeFirst 数据库初始化策略
    用加减边距写图片轮播
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228685.html
Copyright © 2011-2022 走看看