ujn20161222的博客

life is like a box of chocolates you never know what you re gonna get

X floyd

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
Case 2: 0
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

#define ll long long

const int N=100+10;
int dis[N][N],pre[N][N];
bool vis[N][N];
const int inf=0x3f3f3f3f;

int main(){
    int t;
    //freopen("in.txt","r",stdin);
    scanf("%d",&t);
    int z=1;
    while(t--){
        int n,m;
        ll ans=0;
        scanf("%d%d",&n,&m);
        fill(&dis[0][0],&dis[0][0]+N*N,inf);
        memset(vis,0,sizeof(vis));
        memset(pre,0,sizeof(pre));
        for(int i=0;i<m;i++){
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            if(dis[x][y]!=inf)ans++;
            dis[x][y]=dis[y][x]=min(dis[x][y],z);
            vis[x][y]=vis[y][x]=true;
            pre[y][x]=y;
            pre[x][y]=x;
        }

        for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        if(i!=j&&i!=k&j!=k)
        {
            if(dis[i][j]>=dis[i][k]+dis[k][j]){
                dis[i][j]=dis[i][k]+dis[k][j];
                pre[i][j]=k;
            }
        }
        for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++){
            if(pre[i][j]!=i&&vis[i][j])
                ans++;
        }

        printf("Case %d: %lld\n",z++,ans);
    }
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ujn20161222/article/details/80041158
想对作者说点什么? 我来说一句

Floyd算法(matlab实现)

2014年09月08日 555B 下载

Floyd算法的完整Matlab程序

2008年06月13日 702B 下载

没有更多推荐了,返回首页

不良信息举报

X floyd

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭