LightOJ 1019 （FLoyd裸题）

最新推荐文章于 2018-08-14 22:54:02 发布

原创最新推荐文章于 2018-08-14 22:54:02 发布 · 348 阅读

0 ·

CC 4.0 BY-SA版权

图论-最短路专栏收录该内容

74 篇文章

订阅专栏

本文介绍了一道经典的最短路径算法题目，并提供了一个使用Floyd-Warshall算法的C++实现示例。该算法可以解决带权图中任意两点间的最短路径问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题解：

模板题

代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
const int INF = 0x3f3f3f3f;
int dis[N][N];
int n, m, cas = 1;
void init() {
    scanf("%d%d", &n, &m);
    memset(dis, 0x3f, sizeof(dis));

    for (int i = 1; i <= n; i++)
        dis[i][i] = 0;
    int u, v, d;
    for (int i = 0; i < m; i++) {
        scanf("%d%d%d", &u, &v, &d);
        dis[u][v] = dis[v][u] = min(dis[u][v], d);
    }
}

void solve() {
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (dis[i][k] != INF && dis[k][j] != INF && dis[i][j] > dis[i][k] + dis[k][j]) 
                    dis[i][j] = dis[i][k] + dis[k][j];

    if (dis[1][n] == INF) printf("Case %d: Impossible\n", cas++);
    else printf("Case %d: %d\n", cas++, dis[1][n]);

}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}

题目

Description
Tanvir returned home from the contest and got angry after seeing his room dusty. Who likes to see a dusty room after a brain storming programming contest? After checking a bit he found that there is no brush in him room. So, he called Atiq to get a brush. But as usual Atiq refused to come. So, Tanvir decided to go to Atiq’s house.

The city they live in is divided by some junctions. The junctions are connected by two way roads. They live in different junctions. And they can go to one junction to other by using the roads only.

Now you are given the map of the city and the distances of the roads. You have to find the minimum distance Tanvir has to travel to reach Atiq’s house.

Input
Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a blank line. The next line contains two integers N (2 ≤ N ≤ 100) and M (0 ≤ M ≤ 1000), means that there are N junctions and M two way roads. Each of the next M lines will contain three integers u v w (1 ≤ u, v ≤ N, w ≤ 1000), it means that there is a road between junction u and v and the distance is w. You can assume that Tanvir lives in the 1st junction and Atiq lives in the Nth junction. There can be multiple roads between same pair of junctions.

Output
For each case print the case number and the minimum distance Tanvir has to travel to reach Atiq’s house. If it’s impossible, then print ‘Impossible’.

Sample Input
2

3 2
1 2 50
2 3 10

3 1
1 2 40
Sample Output
Case 1: 60
Case 2: Impossible