FZU Problem 2271 X(Floyd)
来源:互联网 发布:王珊数据库视频 编辑:程序博客网 时间:2024/05/04 20:16
X is a fully prosperous country, especially known for its complicated transportation networks. But recently, for the sake of better controlling by the government, the president Fat Brother thinks it’s time to close some roads in order to make the transportation system more effective.
Country X has N cities, the cities are connected by some undirected roads and it’s possible to travel from one city to any other city by these roads. Now the president Fat Brother wants to know that how many roads can be closed at most such that the distance between any two cities in country X does not change. Note that the distance between city A and city B is the minimum total length of the roads you need to travel from A to B.
Input
The first line of the date is an integer T (1 <= T <= 50), which is the number of the text cases.
Then T cases follow, each case starts with two numbers N, M (1 <= N <= 100, 1 <= M <= 40000) which describe the number of the cities and the number of the roads in country X. Each case goes with M lines, each line consists of three integers x, y, s (1 <= x, y <= N, 1 <= s <= 10, x is not equal to y), which means that there is a road between city x and city y and the length of it is s. Note that there may be more than one roads between two cities.
Output
For each case, output the case number first, then output the number of the roads that could be closed. This number should be as large as possible.
See the sample input and output for more details.
Sample Input
2
2 3
1 2 1
1 2 1
1 2 2
3 3
1 2 1
2 3 1
1 3 1
Sample Output
Case 1: 2
Country X has N cities, the cities are connected by some undirected roads and it’s possible to travel from one city to any other city by these roads. Now the president Fat Brother wants to know that how many roads can be closed at most such that the distance between any two cities in country X does not change. Note that the distance between city A and city B is the minimum total length of the roads you need to travel from A to B.
Input
The first line of the date is an integer T (1 <= T <= 50), which is the number of the text cases.
Then T cases follow, each case starts with two numbers N, M (1 <= N <= 100, 1 <= M <= 40000) which describe the number of the cities and the number of the roads in country X. Each case goes with M lines, each line consists of three integers x, y, s (1 <= x, y <= N, 1 <= s <= 10, x is not equal to y), which means that there is a road between city x and city y and the length of it is s. Note that there may be more than one roads between two cities.
Output
For each case, output the case number first, then output the number of the roads that could be closed. This number should be as large as possible.
See the sample input and output for more details.
Sample Input
2
2 3
1 2 1
1 2 1
1 2 2
3 3
1 2 1
2 3 1
1 3 1
Sample Output
Case 1: 2
Case 2: 0
题意:一共m条路,去掉最多的路,使原本任意两点最短路不变,最多可以去掉几条路。。因为是任意两点,所以可以用Floyd。先求一下最短路,然后用原路跟最短路比较一下,看一看哪些路可以去掉。
#include<stdio.h>#include<iostream>#include<cstring>#include<string.h>#include<algorithm>#include<stdlib.h>#include<queue>#define inf 0x3f3f3f3fusing namespace std;int e[105][105];int vis[105][105];int b[105][105];int main(){ int t,c=0; scanf("%d",&t); while(t--) { c++; memset(vis,0,sizeof(vis)); memset(b,0,sizeof(b)); int n,m; scanf("%d%d",&n,&m); for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { e[i][j]=inf; } } int ans=0; for(int i=1; i<=m; i++) { int a,b,c; scanf("%d%d%d",&a,&b,&c); if(e[a][b]<inf) ans++; e[a][b]=e[b][a]=min(e[a][b],c); } memcpy(vis,e,sizeof(vis)); for(int k=1; k<=n; k++) { for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { if(e[i][j]>=e[i][k]+e[k][j]&&i!=j) { e[i][j]=e[i][k]+e[k][j]; b[i][j]=1; } } } } for(int i=1;i<n;i++) { for(int j=i+1;j<=n;j++) { if(b[i][j]&&e[i][j]<=vis[i][j]&&vis[i][j]!=inf) ans++; } } printf("Case %d: %d\n",c,ans); }}
阅读全文
0 0
- FZU Problem 2271 X(Floyd)
- FZU 2271:Problem 2271 X <Floyd>
- FZU 2271 X(Floyd)
- Fzu 2271 X【Floyd】
- FZU 2271 X Floyd
- FZU Problem 2271 X(最短路)
- FZU Problem 2271 X(最短路)
- FZU 2271 X (Floyd)(第七届福建省大学生程序设计竞赛)
- 第七届福建省赛 FZU 2267 X(floyd)
- 第七届福建省大学生程序设计竞赛 Problem J- X(floyd)
- fzu 2104 Floor problem(水题)
- FZU Problem 2110 Star (数学啊 )
- FZU Problem 2112 Tickets (dfs 欧拉图)
- (BFS)FZU.Problem 2188 过河I
- FZU 1692 Key problem(循环矩阵)
- FZU 2104 Floor problem(floor)
- FZU 2104 Floor problem(水题)
- FZU Problem 2256 迷宫(dfs序)
- 图处理:使用graphstream来计算无向图的介数中心性
- java求解LeetCode题目,实现求解数组中的majority element
- 算法杂记
- 推荐系统总结MF->PMF->CTR->CDL->CNN
- Oracle内连接、左外连接、右外连接、全外连接
- FZU Problem 2271 X(Floyd)
- Arp
- python最小二乘法拟合直线
- js正则表达test、exec和match的区别
- scikit-learn的学习笔记
- java学习笔记之内部类
- PHP 即点即改
- Unity_Transform组件_006
- 程序员面试金典:平分的直线、穿点最多的直线