算法设计 第二次上机 Subway
来源:互联网 发布:软件测试简单吗 编辑:程序博客网 时间:2024/06/05 14:48
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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. - 输入
- 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 is the number of minutes it will take you to get to school, rounded to the nearest minute, taking the fastest route.
- 样例输入
0 0 10000 10000 200 5000 200 7000 200 -1 -1 2000 600 5000 600 10000 600 -1 -1
- 样例输出
21
- 来源
- Waterloo local 2001.09.22
注意,memset不能用于float数组的赋值!!!!!!!!
将每个地铁站以及家、学校的位置作为一个点,计算各点之间的距离。
#include <iostream>#include <stdio.h>#include <math.h>#include <climits>#include <float.h>#include <string.h>#include <stdlib.h>using namespace std;float graph[205][205];int cor[205][2];int station;bool isvisit[205];float dis[205];float getdis(int x1, int y1, int x2, int y2){ return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));}void dijkstra(){ for(int i = 0; i < station; i++) dis[i] = -1.0; memset(isvisit, false, sizeof(isvisit)); int now = 0; isvisit[0] = true; dis[0] = 0; for(int i = 1; i < station; i++) { float mindis = -1.0; int next = -1; for(int j = 1; j < station; j++) { if(j == now) continue; if(!isvisit[j]) { if( dis[j] == -1.0 || dis[j] > dis[now] + graph[now][j]) { dis[j] = dis[now] + graph[now][j]; } if(mindis == -1.0 || dis[j] < mindis) { mindis = dis[j]; next = j; } } } now = next; isvisit[now] = true; }}int main(){ //freopen("test.txt", "r", stdin); int x0, y0, x1, y1; station = 2; cin >> x0 >> y0 >> x1 >> y1; //cout << x0 << "\t" << y0 << "\t" << x1 << "\t" << y1 << endl; cor[0][0] = x0; cor[0][1] = y0; cor[1][0] = x1; cor[1][1] = y1; graph[0][1] = graph[1][0] = getdis(x0, y0, x1, y1) / 10000 * 60; while(cin >> x0 >> y0) { //cout << x0 << "\t" << y0 << "\t"; cor[station][0] = x0; cor[station][1] = y0; station ++; for(int i = 0; i < station -1; i ++) { graph[i][station - 1] = graph[station - 1][i] = getdis(x0, y0, cor[i][0], cor[i][1]) / 10000 * 60; //cout << "graph[" << i << "][" << station - 1 << "]:" << graph[i][station - 1] << endl; } cin >> x1 >> y1; //cout << x1 << "\t" << y1 << "\t" << endl; while(x1 != -1 && y1 != -1) { cor[station][0] = x1; cor[station][1] = y1; station ++; //cout << station << endl; for(int i = 0; i < station -2; i ++) { graph[i][station - 1] = graph[station - 1][i] = getdis(x1, y1, cor[i][0], cor[i][1]) / 10000 * 60; //cout << "graph[" << i << "][" << station - 1 << "]:" << graph[i][station - 1] << endl; } graph[station - 2][station - 1] = graph[station - 1][station - 2] = getdis(x1, y1, cor[station - 2][0], cor[station - 2][1]) / 40000 * 60; //cout << "graph[" << station - 2 << "][" << station - 1 << "]:" << graph[station - 2][station - 1] << endl; cin >> x1 >> y1; //cout << x1 << "\t" << y1 << "\t" << endl; } } dijkstra(); cout << int(dis[1] + 0.5) << endl; return 0;}
阅读全文
0 0
- 算法设计 第二次上机 Subway
- 算法设计 第二次上机 The Unique MST
- 算法设计 第二次上机 All discs considered
- 算法设计与复杂性分析 第二次上机 Dynamic Median
- 算法分析 第二次上机 Butterfly
- 算法第二次上机部分题解
- c程序语言设计第二次上机实验报告
- 第二次C语言设计上机报告
- 第二次c语言上机设计报告
- 第二次C语言设计上机报告
- 15级算法第二次上机解题报告
- 算法分析 第二次上机 Yogurt factory
- 第二次上机
- 第二次上机
- 第二次上机
- 第二次上机
- 算法设计与优化编程 第十讲 Subway
- 【上机作业】第二次上机试题
- C和C++中标准输入中遇到的问题
- Educational Codeforces Round 28 题解
- 【DFS】NOIP2014Day1T2[联合权值]题解
- 【2014acm西安现场赛】K
- <Android 进阶(二)> 自定义View之Dota2能力雷达图
- 算法设计 第二次上机 Subway
- SQL中 % ,_,【】,【^】通配符的的使用
- 董付国老师6本Python系列图书阅读指南
- [xor最小生成树 分治 字典树合并] BNUOJ52318 Be Friends
- Windows环境下nDPI编译调试
- 如何用3升和5升桶量取4升水?
- python基础(3) 匿名函数和文件处理、异常
- cyclicBarrier
- SpringBoot解决跨域问题