Cod sursa(job #2637981)

Utilizator FilipCuciucFilip Cuciuc FilipCuciuc Data 26 iulie 2020 11:20:50
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.39 kb
//
//  main.cpp
//  C++ - teste
//
//  Created by Filip Cuciuc on 03/02/2020.
//  Copyright © 2020 Filip Cuciuc. All rights reserved.
//

//#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <map>
#include <string>
#include <cctype>
//#include "MED.h"
using namespace std;
//using namespace std::chrono;

ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");

const int MAX = 105;
const int INF = 2e9;
int n, m;
int mat[MAX][MAX];


void read() {
    cin >> n ;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++) {
            cin >> mat[i][j];
            if (!mat[i][j])
                mat[i][j] = INF;
            
        }
//    cout << '\n';
}


void solve() {
    read();
    
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            if (mat[i][k] == INF)
                continue;
            for (int j = 1; j <= n; j++) {
                if (i == j || mat[k][j] == INF)
                    continue;
                mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j]);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (mat[i][j] == INF) {
                mat[i][j] = 0;
            }
            cout << mat[i][j] << " ";
        }
        cout << '\n';
    }
}

int main() {

    solve();

    return 0;
}