POJ(2387) Til the Cows Come Home
来源:互联网 发布:兄弟标牌打印机软件 编辑:程序博客网 时间:2024/05/17 08:52
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
5 51 2 202 3 303 4 204 5 201 5 100
90
用搜索做,果断wa......
Dijkstra的:
#include <cstdio>#include <cstring>#include <queue>#include <iostream>using namespace std;#define INF 0x7FFFFFFFint n,m,cnt;int head[1005];struct node{int to;int next;int weight;}edge[4005];struct node1{int to,dis;node1(int x,int y):to(x),dis(y){}bool operator< (const node1 a)const{return this->dis>a.dis;}};void Add(int x,int y,int w){cnt++;edge[cnt].to=y;edge[cnt].weight=w;edge[cnt].next=head[x];head[x]=cnt;}int Dijkstra(int n){int book[1005],distance[1005];priority_queue<node1> q;for(int i=1;i<=n;i++){distance[i]=INF;}distance[n]=0;q.push(node1(n,0));memset(book,0,sizeof(book));while(!q.empty()){node1 t=q.top();q.pop();if(book[t.to]){continue;}book[t.to]=1;for(int i=head[t.to];i;i=edge[i].next){if(distance[edge[i].to]>t.dis+edge[i].weight){distance[edge[i].to]=t.dis+edge[i].weight;q.push(node1(edge[i].to,distance[edge[i].to]));}}}return distance[1];}int main(){int re,x,y,w;cin>>m>>n;for(int i=1;i<=m;i++){cin>>x>>y>>w;Add(x,y,w);Add(y,x,w);}re=Dijkstra(n);cout<<re<<endl;return 0;}
1 0
- POJ 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- Poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- POJ-2387-Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- rhel6关于samba访问权限
- 搬家至博客园说明
- 【Oracle】对表的操作——修改列名(即修改字段名)
- 服务器--你知道多少?
- 微软在手机上做的实时SLAM,可以用在AR上。
- POJ(2387) Til the Cows Come Home
- map_server介绍及参数说明
- 一步一步学MySQL----8 简单数据查询
- 实验吧密码学WriteUp(四)
- MATLAB作业-名解
- hello world!
- eclipse上部署第一个tomcat服务器
- [c++]class中方法的类型
- Highcharts+PHP+Mysql生成饼状统计图