Cod sursa(job #1839277)

Utilizator msciSergiu Marin msci Data 2 ianuarie 2017 17:58:27
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <bits/stdc++.h>

using namespace std;

#define SIZE(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()

typedef long long int64; typedef unsigned long long uint64;
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;

const int NMAX = 105;

int dist[NMAX][NMAX];
int N;

void floydWarshall() {
    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                if (dist[i][k] && dist[k][j] && dist[i][j]) {
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
        }
    }
}

int main() {
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &N);
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= N; j++)
            scanf("%d", &dist[i][j]);
    floydWarshall();
    for (int i = 1; i <= N; i++) {
        int num = 0;
        for (int j = 1; j <= N; j++) {
            if (num++) printf(" ");
            printf("%d", dist[i][j]);
        }
        printf("\n");
    }
}