zoukankan      html  css  js  c++  java
  • poj 2449 Remmarguts' Date

    Remmarguts' Date
    Time Limit: 4000MS   Memory Limit: 65536K
    Total Submissions: 30658   Accepted: 8378

    Description

    "Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. 

    "Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission." 

    "Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)" 

    Being interested in the trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister's help! 

    DETAILS: UDF's capital consists of N stations. The hall is numbered S, while the station numbered T denotes prince' current place. M muddy directed sideways connect some of the stations. Remmarguts' path to welcome the princess might include the same station twice or more than twice, even it is the station with number S or T. Different paths with same length will be considered disparate. 

    Input

    The first line contains two integer numbers N and M (1 <= N <= 1000, 0 <= M <= 100000). Stations are numbered from 1 to N. Each of the following M lines contains three integer numbers A, B and T (1 <= A, B <= N, 1 <= T <= 100). It shows that there is a directed sideway from A-th station to B-th station with time T. 

    The last line consists of three integer numbers S, T and K (1 <= S, T <= N, 1 <= K <= 1000).

    Output

    A single line consisting of a single integer number: the length (time required) to welcome Princess Uyuw using the K-th shortest path. If K-th shortest path does not exist, you should output "-1" (without quotes) instead.

    Sample Input

    2 2
    1 2 5
    2 1 4
    1 2 2
    

    Sample Output

    14

    Source

    POJ Monthly,Zeyuan Zhu
     
    思路:K短路板子题
    #include<iostream>
    #include<queue>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #define INF 0x3f3f3f3f
    #define MAXN 300000
    using namespace std;
    struct nond{
        int g,f,to;
        bool operator<(const nond &r) const {
            if(r.f==f)    return r.g<g;
            return r.f<f;
        }
    }tmp,opt;
    int n,m,s,t,k,cnt,tot,tot1;
    int dis[MAXN],vis[MAXN];
    int to[MAXN],cap[MAXN],net[MAXN],head[MAXN];
    int to1[MAXN],cap1[MAXN],net1[MAXN],head1[MAXN];
    void add(int u,int v,int w){
        to[++tot]=v;net[tot]=head[u];cap[tot]=w;head[u]=tot;
        to1[++tot1]=u;net1[tot1]=head1[v];cap1[tot1]=w;head1[v]=tot1;
    }
    void spfa(int s){
        queue<int>que1;
        for(int i=0;i<=n;i++)    dis[i]=INF;
        que1.push(s);
        vis[s]=1;dis[s]=0;
        while(!que1.empty()){
            int now=que1.front();
            que1.pop();
            vis[now]=0;
            for(int i=head1[now];i;i=net1[i])
                if(dis[to1[i]]>dis[now]+cap1[i]){
                    dis[to1[i]]=dis[now]+cap1[i];
                    if(!vis[to1[i]]){
                        vis[to1[i]]=1;
                        que1.push(to1[i]);
                    }
                }
        }
    }
    int Astar(){
        priority_queue<nond>que;
        if(s==t)    k++;
        if(dis[s]==INF)    return  -1;
        tmp.g=0;
        tmp.to=s;
        tmp.f=dis[s];
        que.push(tmp);
        while(!que.empty()){
            tmp=que.top();
            que.pop();
            if(tmp.to==t)    cnt++;
            if(cnt==k)    return tmp.g;
            for(int i=head[tmp.to];i;i=net[i]){
                opt.to=to[i];
                opt.g=tmp.g+cap[i];
                opt.f=opt.g+dis[to[i]];
                que.push(opt);
            }
        }
        return -1;
    }
    int main(){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            add(a,b,c);
        }
        scanf("%d%d%d",&s,&t,&k);
        spfa(t);
        printf("%d
    ",Astar());
    }
     
    细雨斜风作晓寒。淡烟疏柳媚晴滩。入淮清洛渐漫漫。 雪沫乳花浮午盏,蓼茸蒿笋试春盘。人间有味是清欢。
  • 相关阅读:
    数据库学习之四--Join, Left Join, Right Join, Full Join对比
    数据库学习之三--Select查询及运算符
    数据库学习之二--SQL语句以及数据类型
    随身笔记 Python中__init__和self的意义和作用
    爬虫Request Header请求头各参数含义
    爬虫中的Header请求头 在浏览器中通过F12和F5分析
    爬虫中的User-Agent 使用与作用
    Maven build 命令介绍(转)
    Linux 确定tomcat的运行状态命令
    Several ports (8005, 8080, 8009) required by Tomcat v7.0 Server at localhost are already in use.解决办法
  • 原文地址:https://www.cnblogs.com/cangT-Tlan/p/7409848.html
Copyright © 2011-2022 走看看