Cod sursa(job #1262474)

Utilizator abel1090Abel Putovits abel1090 Data 13 noiembrie 2014 11:13:35
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
/// ROY-FLOYD INFO1 11.13
#include <iostream>
#include <fstream>
#include <vector>
#include <limits>

using namespace std;

const int MAXINT = numeric_limits<int>::max();

void royFloyd(vector<vector<int> >& adjMatr) {
    int N = adjMatr.size();

    for(int k=0; k<N; k++)
        for(int i=0; i<N; i++)
            for(int j=0; j<N; j++)
                if(i!=j && adjMatr[i][k] != MAXINT && adjMatr[k][j] != MAXINT &&
                    adjMatr[i][k] + adjMatr[k][j] < adjMatr[i][j])
                        adjMatr[i][j] = adjMatr[i][k] + adjMatr[k][j];
}

int main() {
    ifstream inStr("royfloyd.in");
    ofstream outStr("royfloyd.out");

    int N;
    inStr >> N;

    vector<vector<int> > adjMatr(N, vector<int>(N));

    for(int i=0; i<N; i++)
        for(int j=0; j<N; j++) {
            inStr >> adjMatr[i][j];
            if(i != j && adjMatr[i][j] == 0)
                adjMatr[i][j] == MAXINT;
        }

    royFloyd(adjMatr);

    for(int i=0; i<N; i++) {
        for(int j=0; j<N; j++)
            if(adjMatr[i][j] == MAXINT)
                outStr << 0 << ' ';
            else
                outStr << adjMatr[i][j] << ' ';
        outStr << '\n';
    }

    return 0;
}