Accept: 13 Submit: 62
Time Limit: 1500 mSec Memory Limit : 32768 KB
Problem Description
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
Sample Output
Source
第七届福建省大学生程序设计竞赛-重现赛(感谢承办方闽江学院)
题意:给你一个无向图,问最多可以删除几条边使得所有点对之间的最短距离不变
解:一开始用带权并查集WA。。。又用spfaT。。。原来是floyd最简单的反而忘了。。。看看跑完最短路后,哪些边变化了就删除。。。有一个坑点,去重边时
先要按大小排序。。。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<vector>
using namespace std;
const int N = 400010;
typedef long long LL;
int w[110][110], w1[110][110];
const int inf= 0x3f3f3f3f;
struct node
{
int x, y, z;
}p[N];
int cmp(node A,node B)
{
if(A.x!=B.x) return A.x<B.x;
else if(A.y!=B.y) return A.y<B.y;
return A.z<B.z;
}
int vis[110][110];
int main()
{
int t, ncase=1;
scanf("%d", &t);
while(t--)
{
int n, m;
scanf("%d %d", &n, &m);
memset(w,inf,sizeof(w));
memset(vis,0,sizeof(vis));
int cnt=0;
for(int i=0;i<m;i++)
{
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
if(x>y) swap(x,y);
p[i].x=x,p[i].y=y,p[i].z=z;
if(w[x][y]==inf) w[x][y]=z,w[y][x]=z;
else if(w[x][y]>z) w[x][y]=z,w[y][x]=z;
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
if(i==k||w[i][k]==inf) continue;
for(int j=1;j<=n;j++)
{
if(j==k||w[k][j]==inf) continue;
if(w[i][j]==w[i][k]+w[k][j]) vis[i][j]=1;
w[i][j]=min(w[i][j], w[i][k]+w[k][j]);
}
}
}
sort(p,p+m,cmp);
int k=0;
for(int i=1;i<m;i++)
{
if(p[i].x==p[k].x&&p[i].y==p[k].y&&p[i].z==p[k].z) cnt++;
else p[++k]=p[i];
}
for(int i=0;i<=k;i++)
{
int x=p[i].x,y=p[i].y,z=p[i].z;
if(w[x][y]<z) cnt++;
if(w[x][y]==z&&vis[x][y]) cnt++;
}
printf("Case %d: %d\n",ncase++,cnt);
}
return 0;
}