POJ_2387_最短路
Posted Jason333
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了POJ_2387_最短路相关的知识,希望对你有一定的参考价值。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 46859 | Accepted: 15941 |
Description
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.
Input
* 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.
Output
Sample Input
5 5 1 2 20 2 3 30 3 4 20 4 5 20 1 5 100
Sample Output
90
熟悉一下刚学的SPFA,注意双向边,所以边数组要开倍。
#include<iostream> #include<cstdio> #include<map> #include<cstring> #include<queue> using namespace std; #define V 1005 #define E 4005 #define INF 99999999 struct Edge { int v,w; int next; } edge[E]; int head[V]; int cnte=0; void addEdge(int a,int b,int c) { edge[cnte].v=b; edge[cnte].w=c; edge[cnte].next=head[a]; head[a]=cnte++; } int t,n; int dist[V],vis[V]; void Spfa() { for(int i=0; i<=n; i++) { dist[i]=INF; vis[i]=0; } queue<int>q; q.push(1); dist[1]=0; vis[1]=1; while(!q.empty()) { int u=q.front(); q.pop(); for(int i=head[u]; i!=-1; i=edge[i].next) { int v=edge[i].v; if(dist[v]>dist[u]+edge[i].w) { dist[v]=dist[u]+edge[i].w; if(!vis[v]) { vis[v]=1; q.push(v); } } } vis[u]=0; } } int main() { //cout<<INF<<endl; scanf("%d%d",&t,&n); memset(head,-1,sizeof(head)); for(int i=0; i<t; i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); addEdge(a,b,c); addEdge(b,a,c); } Spfa(); printf("%d\n",dist[n]); return 0; }
#include<iostream>#include<cstdio>#include<map>#include<cstring>#include<queue>using namespace std;#define V 1005#define E 4005#define INF 99999999
struct Edge{ int v,w; int next;} edge[E];
int head[V];
int cnte=0;void addEdge(int a,int b,int c){ edge[cnte].v=b; edge[cnte].w=c; edge[cnte].next=head[a]; head[a]=cnte++;}
int t,n;int dist[V],vis[V];void Spfa(){ for(int i=0; i<=n; i++) { dist[i]=INF; vis[i]=0; } queue<int>q; q.push(1); dist[1]=0; vis[1]=1; while(!q.empty()) { int u=q.front(); q.pop(); for(int i=head[u]; i!=-1; i=edge[i].next) { int v=edge[i].v; if(dist[v]>dist[u]+edge[i].w) { dist[v]=dist[u]+edge[i].w; if(!vis[v]) { vis[v]=1; q.push(v); } } } vis[u]=0; }}int main(){ //cout<<INF<<endl; scanf("%d%d",&t,&n); memset(head,-1,sizeof(head)); for(int i=0; i<t; i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); addEdge(a,b,c); addEdge(b,a,c); } Spfa(); printf("%d\n",dist[n]); return 0;}
以上是关于POJ_2387_最短路的主要内容,如果未能解决你的问题,请参考以下文章
[ An Ac a Day ^_^ ] [kuangbin带你飞]专题四 最短路练习 POJ 2387 Til the Cows Come Home