POJ2502——Subway
来源:互联网 发布:mac 重装flash player 编辑:程序博客网 时间:2024/06/11 05:18
Description
You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want to be late for class, you want to know how long it will take you to get to school.
You walk at a speed of 10 km/h. The subway travels at 40 km/h. Assume that you are lucky, and whenever you arrive at a subway station, a train is there that you can board immediately. You may get on and off the subway any number of times, and you may switch between different subway lines if you wish. All subway lines go in both directions.
You walk at a speed of 10 km/h. The subway travels at 40 km/h. Assume that you are lucky, and whenever you arrive at a subway station, a train is there that you can board immediately. You may get on and off the subway any number of times, and you may switch between different subway lines if you wish. All subway lines go in both directions.
Input
Input consists of the x,y coordinates of your home and your school, followed by specifications of several subway lines. Each subway line consists of the non-negative integer x,y coordinates of each stop on the line, in order. You may assume the subway runs in a straight line between adjacent stops, and the coordinates represent an integral number of metres. Each line has at least two stops. The end of each subway line is followed by the dummy coordinate pair -1,-1. In total there are at most 200 subway stops in the city.
Output
Output is the number of minutes it will take you to get to school, rounded to the nearest minute, taking the fastest route.
Sample Input
0 0 10000 10000 200 5000 200 7000 200 -1 -1 2000 600 5000 600 10000 600 -1 -1
Sample Output
21
Source
Waterloo local 2001.09.22
按地铁速度来建边的只有相邻的处于同一线上的点,其他的就全部按行走速度建边。
按地铁速度来建边的只有相邻的处于同一线上的点,其他的就全部按行走速度建边。
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<math.h>#include<map>#include<vector>#include<set>#include<list>#include<stack>#include<queue>#include<iterator>using namespace std;const int maxn=420;const double inf=100000000;struct node{int to;int next;double weight;}edge[maxn*maxn];struct _list{int x,y;}point[maxn];int head[maxn];double dist[maxn];int tot;double dis(int x1,int y1,int x2,int y2){return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}void addedge(int from,int to,double weight){edge[tot].to=to;edge[tot].weight=weight;edge[tot].next=head[from];head[from]=tot++;}int spfa(int n){for(int i=0;i<=n;i++) dist[i]=inf; dist[1]=0;queue<int>qu;while(!qu.empty()) qu.pop(); qu.push(1); while(!qu.empty()) { int cur=qu.front(); qu.pop(); for(int i=head[cur];i!=-1;i=edge[i].next) { int v=edge[i].to; if(dist[v]>dist[cur]+edge[i].weight) { dist[v]=dist[cur]+edge[i].weight; qu.push(v); } } } return (dist[2]+0.5);}int main(){int sx,sy,tx,ty;while(~scanf("%d%d%d%d",&sx,&sy,&tx,&ty)){memset(head,-1,sizeof(head));tot=0;point[1].x=sx;point[1].y=sy;point[2].x=tx;point[2].y=ty;int x,y,t=3;int lastx=-1,lasty=-1;double v1=40000.0/60,v2=10000.0/60;while(scanf("%d%d",&x,&y)==2){if(x==-1 && y==-1){lastx=-1;lasty=-1;continue;} if(lastx!=-1 && lasty!=-1) { addedge(t-1,t,dis(lastx,lasty,x,y)/v1); addedge(t,t-1,dis(lastx,lasty,x,y)/v1); lastx=x; lasty=y; } else { lastx=x; lasty=y; } point[t].x=x; point[t++].y=y;}for(int i=1;i<t;i++) for(int j=1;j<t;j++) { addedge(i,j,dis(point[i].x,point[i].y,point[j].x ,point[j].y)/v2); addedge(j,i,dis(point[i].x,point[i].y,point[j].x ,point[j].y)/v2); } printf("%d\n",spfa(t));}return 0;}
0 0
- POJ2502——Subway
- poj2502 - Subway
- poj2502 SubWay
- Poj2502 Subway
- poj2502 Subway
- POJ2502 subway
- poj2502 Subway最短路
- POJ2502 Subway flody
- POJ2502 Subway(Floyd)
- POJ2502 Subway 最短路
- poj2502 subway dijkstra
- POJ2502 subway(spfa)
- POJ2502 Subway(最短路径)
- POJ2502 Subway -DIJKSTRA最短路练习
- POJ2502 Subway(最短路Floyed)
- 【最短路】POJ2502 SUBWAY (spfa)
- POJ2502 subway(dijkstra以最短时间代替最短路)
- POJ2502---Subway (最短路:spfa or floyed)
- mysql 存储过程输入输出参数
- 在ecilpse中添加freemarker插件
- 设计模式——代理设计模式
- SiteMesh 初试 学习之路2
- spring(基础二) 注解@Component,@Service,@Controller,@Repository
- POJ2502——Subway
- 错误处理:Command /usr/bin/codesign failed with exit code 1
- 太阳能LED路灯价格如何,贵不贵?
- 不同浏览器事件监听
- WSGI 简介
- hadoop配置文件说明
- setuptools " UnicodeDecodeError:"问题探究
- 关于editText的细节
- ID混淆算法