hdu 2433 Travel(枚举删掉的边求取最短路)
来源:互联网 发布:易安卓播放器源码 编辑:程序博客网 时间:2024/04/30 06:44
Travel
Time Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1872 Accepted Submission(s): 627
Problem Description
One day, Tom traveled to a country named BGM. BGM is a small country, but there are N (N <= 100) towns in it. Each town products one kind of food, the food will be transported to all the towns. In addition, the trucks will always take the shortest way. There are M (M <= 3000) two-way roads connecting the towns, and the length of the road is 1.
Let SUM be the total distance of the shortest paths between all pairs of the towns. Please write a program to calculate the new SUM after one of the M roads is destroyed.
Let SUM be the total distance of the shortest paths between all pairs of the towns. Please write a program to calculate the new SUM after one of the M roads is destroyed.
Input
The input contains several test cases.
The first line contains two positive integers N, M. The following M lines each contains two integers u, v, meaning there is a two-way road between town u and v. The roads are numbered from 1 to M according to the order of the input.
The input will be terminated by EOF.
The first line contains two positive integers N, M. The following M lines each contains two integers u, v, meaning there is a two-way road between town u and v. The roads are numbered from 1 to M according to the order of the input.
The input will be terminated by EOF.
Output
Output M lines, the i-th line is the new SUM after the i-th road is destroyed. If the towns are not connected after the i-th road is destroyed, please output “INF” in the i-th line.
Sample Input
5 45 11 33 25 42 21 21 2
Sample Output
INFINFINFINF22
Source
2008 Asia Chengdu Regional Contest Online
题目分析:
记录以某一个点为源点的最短路的生成树中的边,然后每次删掉边,判断这条边是否在这个生成树中,如果在重新求取最短路,如果不在,那么当前的最短路生成树没有变化
记录以某一个点为源点的最短路的生成树中的边,然后每次删掉边,判断这条边是否在这个生成树中,如果在重新求取最短路,如果不在,那么当前的最短路生成树没有变化
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <queue>#define INF (0x3f3f3f3f)#define N 107using namespace std;int n,m;int mp[N][N];int pre[N][N];int dis[N];bool vis[N];int sum[N];struct Edge{ int u,v;}e[30*N];int spfa ( int s , int f ){ memset ( vis , 0 , sizeof ( vis ) ); memset ( dis, 0 , sizeof ( dis ) ); queue<int> q; q.push ( s ); vis[s] = 1; while ( !q.empty() ) { int u = q.front(); q.pop(); for ( int i = 1 ; i <= n ; i++ ) if ( mp[u][i] && !vis[i] ) { dis[i] = dis[u] + 1; vis[i] = 1; if ( f ) pre[s][i] = u; q.push ( i ); } } int sum = 0; for ( int i = 1 ; i <= n ; i++ ) if ( !dis[i]&& i != s ) return INF; else sum += dis[i]; return sum;}int main ( ){ while ( ~scanf ( "%d%d" , &n , &m ) ) { int u , v; memset ( mp , 0 , sizeof ( mp ) ); memset ( pre , 0 , sizeof ( pre ) ); for ( int i = 0 ; i < m ; i++ ) { scanf ( "%d%d" , &u , &v ); e[i].u = u; e[i].v = v; mp[u][v]++; mp[v][u]++; } int temp = 0; bool flag = 1; for ( int i = 1 ; i <= n ; i++ ) { sum[i] = spfa ( i , 1 ); temp += sum[i]; if ( temp >= INF ) { flag = 0; break; } } for ( int i = 0 ; i < m ; i++ ) { int ans = 0; u = e[i].u , v = e[i].v; if ( flag && mp[u][v] == 1 ) { ans = 0; for ( int j = 1 ; j <= n ; j++ ) { if ( pre[j][u] != v && pre[j][v] != u ) ans += sum[j]; else { mp[u][v]--; mp[v][u]--; ans += spfa ( j , 0 ); mp[u][v]++; mp[v][u]++; if ( ans >= INF ) break; } } } else ans = temp; if ( ans >= INF ) puts ( "INF" ); else printf ( "%d\n" , ans ); } }}
0 0
- hdu 2433 Travel(枚举删掉的边求取最短路)
- HDU 1595 枚举+最短路(删掉边)
- HDU 2433 Travel 枚举+最短路
- 【hdu】2433 Travel【最短路删边】
- hdu 2433 Travel 最短路
- hdu1595(枚举+最短路(删掉任意一条边的最长最短路)-MB
- HDU 1595 find the longest of the shortest枚举+最短路(删掉任意一条边的最长最短路)★★
- hdu 2433 Travel 最短路+预处理
- Hdu 2433 Travel 删边+最短路之和
- 【HDU】2433 Travel 最短路树优化
- HDU 2433 Travel 最短路SPAF
- hdu 2433 Travel 最短路 dijkstra算法。
- HDU 2433 Travel 最短路树
- HDU 2433 Travel 最短路应用
- HDU - 2433 Travel (最短路树)
- HDU-2433 Travel(最短路[Dijkstra])
- HDU 2433 Travel 最短路树
- HDU 1595 find the longest of the shortest 删掉任意一条边的最长最短路
- 超声波流量计测量时间传输比偏差较大解决的方法
- 2015小米在线笔试题
- 面向对象设计的六大原则简介
- git 常见命令
- 文件夹类Directory的常用方法
- hdu 2433 Travel(枚举删掉的边求取最短路)
- Hadoop分布式文件系统:架构和设计要点
- 山东省第一届ACM大学生程序设计竞赛(原题) 回顾 4.18
- OC中简单内存开辟 初始化
- 第八周【项目1-实现复数类中的运算符重载】
- 疯狂JAVA之学习笔记(5)----------注释
- 基于protobuf的RPC实现
- shell条件判断之test命令实例详解
- 树分治(hdu5016-2014西安现场赛)