HDU1595 find the longest of the shortest(dijk+路径记录+枚举)
来源:互联网 发布:playclub捏脸数据论坛 编辑:程序博客网 时间:2024/04/29 23:46
find the longest of the shortest
Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3333 Accepted Submission(s): 1243
Problem Description
Marica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, she started preparing for the long journey.We know for every road how many minutes it takes to come from one city to another.
Mirko overheard in the car that one of the roads is under repairs, and that it is blocked, but didn't konw exactly which road. It is possible to come from Marica's city to Mirko's no matter which road is closed.
Marica will travel only by non-blocked roads, and she will travel by shortest route. Mirko wants to know how long will it take for her to get to his city in the worst case, so that he could make sure that his girlfriend is out of town for long enough.Write a program that helps Mirko in finding out what is the longest time in minutes it could take for Marica to come by shortest route by non-blocked roads to his city.
Mirko overheard in the car that one of the roads is under repairs, and that it is blocked, but didn't konw exactly which road. It is possible to come from Marica's city to Mirko's no matter which road is closed.
Marica will travel only by non-blocked roads, and she will travel by shortest route. Mirko wants to know how long will it take for her to get to his city in the worst case, so that he could make sure that his girlfriend is out of town for long enough.Write a program that helps Mirko in finding out what is the longest time in minutes it could take for Marica to come by shortest route by non-blocked roads to his city.
Input
Each case there are two numbers in the first row, N and M, separated by a single space, the number of towns,and the number of roads between the towns. 1 ≤ N ≤ 1000, 1 ≤ M ≤ N*(N-1)/2. The cities are markedwith numbers from 1 to N, Mirko is located in city 1, and Marica in city N.
In the next M lines are three numbers A, B and V, separated by commas. 1 ≤ A,B ≤ N, 1 ≤ V ≤ 1000.Those numbers mean that there is a two-way road between cities A and B, and that it is crossable in V minutes.
In the next M lines are three numbers A, B and V, separated by commas. 1 ≤ A,B ≤ N, 1 ≤ V ≤ 1000.Those numbers mean that there is a two-way road between cities A and B, and that it is crossable in V minutes.
Output
In the first line of the output file write the maximum time in minutes, it could take Marica to come to Mirko.
Sample Input
5 61 2 41 3 32 3 12 4 42 5 74 5 16 71 2 12 3 43 4 44 6 41 5 52 5 25 6 55 71 2 81 4 102 3 92 4 102 5 13 4 73 5 10
Sample Output
111327
大致思路很好想,先求一条最短路,记录下路径,然后枚举删去每一条边刷新最大值即可,主要在于不会计算时间复杂度不敢写,毕竟从起点到终点最多n-1条边而dijkstra又是O(N^2)的复杂度,这样算来都O(N^3)的复杂度了,N还是1000,搞不准时间
注意删边之后路径会改变,只记录未删时候的路径
1279MS
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #include<iostream> #include<queue> #define inf 0x3f3f3f3f #define mem(a,b) memset(a,b,sizeof(a)) using namespace std; const int N=1005; typedef long long ll; int n,m,flag; int pre[N],dis[N]; bool vis[N]; int e[N][N]; void dijkstra(int x) { for(int i=1; i<=n; i++) { dis[i]=inf; vis[i]=false; } int u; dis[x]=0; for(int i=1; i<n; i++) { int minn=inf; for(int j=1; j<=n; j++) { if(!vis[j]&&minn>dis[j]) { minn=dis[j]; u=j; } } vis[u]=1; for(int k=1; k<=n; k++) { if(dis[k]>dis[u]+e[u][k]) { dis[k]=dis[u]+e[u][k]; if(!flag) { pre[k]=u; } } } } } int main() { while(~scanf("%d%d",&n,&m)) { mem(pre,-1); for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { if(i==j)e[i][j]=0; else e[i][j]=inf; } } int u,v,w; for(int i=0; i<m; i++) { scanf("%d%d%d",&u,&v,&w); if(w<e[u][v]) e[u][v]=e[v][u]=w; } flag=0; dijkstra(1); flag=1; int temp,maxx=dis[n]; for(int i=n;~i; i=pre[i]) { if(pre[i]==-1)break; temp=e[pre[i]][i]; e[pre[i]][i]=inf; dijkstra(1); maxx=max(maxx,dis[n]); e[pre[i]][i]=temp; } printf("%d\n",maxx); } }
阅读全文
0 0
- HDU1595 find the longest of the shortest(dijk+路径记录+枚举)
- hdu1595 find the longest of the shortest (dijkstra+记录路径)
- HDU1595:find the longest of the shortest(spfa+记录路径)
- hdu1595-find the longest of the shortest
- HDU1595---find the longest of the shortest
- hdu1595 find the longest of the shortest
- HDU1595 find the longest of the shortest
- HDU1595 find the longest of the shortest
- find the longest of the shortest HDU1595
- hdu1595—find the longest of the shortest(dijkstra+枚举)
- HDOJ 题目1595 find the longest of the shortest(枚举,最短路记录路径)
- HDU1595:find the longest of the shortest(Dijkstra)
- hdu1595 find the longest of the shortest(Dijkstra)
- HDU1595:find the longest of the shortest(Dijkstra)
- hdu1595(spfa) find the longest of the shortest
- HDU1595 find the longest of the shortest(最短路)
- HDU1595 find the longest of the shortest(最短路,Dijkstra)
- HDU 1595 find the longest of the shortest (最短路+记录路径+枚举删边)
- Linux下搭建Jenkins+Github环境
- 微软之意不在Xbox,而在于将VR AR引入Win 10
- sql leetcode 627. Swap Salary
- 进程和线程
- Android商城购物车页面实现和逻辑实现
- HDU1595 find the longest of the shortest(dijk+路径记录+枚举)
- 记录一下Struts学习过程中遇到的问题
- Android Studio报错Error:Server sent an unsupported extension: type_35/下载依赖失败/gradle resolve dependenci
- 从网络获取数据,并绑定到listview上
- java eclipse的左侧目录栏不见了
- iOS基石 —— 不常用的基础控件
- 好的前端界面
- iOS 融云获取token
- 1 Traffic Server插件cache_range_request