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.
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.
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.
2 2 3 1 2 1 1 2 1 1 2 2 3 3 1 2 1 2 3 1 1 3 1
Case 1: 2 Case 2: 0给出一个n个顶点和m条边的图,问最多能删除多少条边,使每两个顶点之间的最短路径不变。
其实就是Floyd的一个变形,但是因为没有考虑到双向边的问题,wa了好多发,一条边有时候删了好几次
#include<stdio.h>
#include<iostream>
#include<set>
#include<queue>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<string>
#include<vector>
using namespace std;
const int inf = 0x3f3f3f3f ;
const int mx = 105 ;
int cost[mx][mx];//记录两点之间的最短路
int used[mx][mx] ;
int main()
{
int t , n , m , kk = 1 ;
scanf("%d" , &t);
while(t--){
scanf("%d %d" , &n , &m) ;
memset(used , 0 , sizeof(used));
for(int i = 0 ; i <= n ; i ++){
for(int j = 0 ; j <= n ; j ++){
cost[i][j] = inf ;
}
}
int cnt = 0;
for(int i = 0 ; i < m ; i ++){
int u , v , c ;
scanf("%d%d%d" , &u , &v , &c);
if(cost[u][v] == inf){
cost[u][v] = cost[v][u] = c;
used[u][v] = used[v][u] = c;
}
else if(cost[u][v] >= c){
cost[u][v] = cost[v][u] = c;
used[u][v] = used[v][u] = c;
cnt ++;
}
else if(cost[u][v] < c){
cnt ++;
}
}
for(int i = 0 ; i <= n ; i ++)
cost[i][i] = 0;
for(int k = 1 ; k <= n ; k ++){
for(int i = 1 ;i <= n ; i ++){
for(int j = 1 ; j <= n ; j ++){
if(cost[i][j] >= cost[i][k] + cost[k][j] && cost[i][j]!=0&&cost[i][k]!=0&&cost[k][j]!=0){
if(used[i][j]) {//这里要注意,不然可能造成同一条边删除两次的情况
cnt++;
used[i][j] = used[j][i] = 0 ;
}
cost[i][j] = cost[j][i] = cost[i][k] + cost[k][j];
}
}
}
}
printf("Case %d: " , kk++);
cout<<cnt<<endl;
}
return 0;
}