hdu floyd 逆向理解

最新推荐文章于 2019-03-22 13:16:00 发布

Tian_Fei

最新推荐文章于 2019-03-22 13:16:00 发布

阅读量331

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/lois_123/article/details/46565181

版权

图论专栏收录该内容

21 篇文章 0 订阅

订阅专栏

Graph

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)

Total Submission(s): 2046 Accepted Submission(s): 1024

Problem Description

Everyone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Given the length of shortest path between each pair of vertexes, can you find the original graph?

Input

The first line is the test case number T (T ≤ 100).
First line of each case is an integer N (1 ≤ N ≤ 100), the number of vertexes.
Following N lines each contains N integers. All these integers are less than 1000000.
The jth integer of ith line is the shortest path from vertex i to j.
The ith element of ith line is always 0. Other elements are all positive.

Output

For each case, you should output “Case k: ” first, where k indicates the case number and counts from one. Then one integer, the minimum possible edge number in original graph. Output “impossible” if such graph doesn't exist.

Sample Input

Sample Output

  
  
   
   Case 1: 6
Case 2: 4
Case 3: impossible

题意：一张有向图，给出各点之间的最短长度如果该图存在求出最少的边；

分析：由题意知，该图为有向图，且给出的是各点的最短路径则一定不存在 map[i][j]>map[i][k]+map[k][j]的情况，若存在这样的情况则该图不存在输出impossible；当该图存在的时候，最多存在n*(n-1)条路径，当存在map[i][j]=map[i][k]+map[k][j]时 map[i][j]这条边可以删去。

PS:对一张图求最短路径的时候只需迭代一个点即可，即：当i->j=i->f->g->h->j时，一定存在一个点使得i->j=i->g->j 只需迭代一个点即可，本题中将 k 放在内层，也就是在正向floyd的最外层控制变量，

code：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int t,n,map[1000][1000],ans;
int floy()
{
    int k,i,j;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        for(k=0;k<n;k++)
    {
        if(i!=j&& i!=k&& j!=k)
        {
            if( map[i][j]==map[i][k]+map[k][j])//该边可以省略
            {
                ans--;
                break;
            }
            if(map[i][j]>map[i][k]+map[k][j])//不存在这种情况
                return 0;
        }
    }
    return 1;
}
int main()
{
    int i,j,tt=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(map,0,sizeof(map));
        for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            scanf("%d",&map[i][j]);
        ans=n*(n-1);

        int flag=floy();
        printf("Case %d: ",tt++);
        if(flag)
            printf("%d\n",ans);
        else
            printf("impossible\n");
    }
    return 0;
}