Cod sursa(job #2311211)

Utilizator AlexnolifeAlexandru Ica Alexnolife Data 2 ianuarie 2019 19:25:12
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 kb
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <algorithm>
#include <utility>
#include <type_traits>
#include <functional>
#include <cstdint>
#include <thread>
#include <limits>
#include <cassert>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <bitset>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <regex>
#include <future>

std::ofstream g{ "royfloyd.out" };

std::array<std::array<int, 100>, 100> matrix;
int n;

void read()
{
    std::ifstream f{ "royfloyd.in" };

    f >> n;

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            f >> matrix[i][j];
        }
    }
}

void roy_floyd()
{
    for(int k = 0; k < n; ++k) {
        for(int i = 0; i < n; ++i) {
            for(int j = 0; j < n; ++j) {
                if(i != j 
                    && matrix[i][k] 
                    && matrix[k][j] 
                    && (matrix[i][j] > matrix[i][k] + matrix[k][j]) //|| !matrix[i][j])
                )
                { 
                    matrix[i][j] = matrix[i][k] + matrix[k][j]; 
                }
            }
        }
    }
}

void print()
{
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            g << matrix[i][j] << ' ';
        }

        g << '\n';
    }
}

void solve()
{
    roy_floyd();
    print();
}

int main()
{
    read();
    solve();
    return 0;
}