Cod sursa(job #1424257)

Utilizator o_micBianca Costin o_mic Data 23 aprilie 2015 19:57:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>
#include <iostream>
#include <vector>
#define infinity (1 << 29)
#define DN 105
using namespace std;

int dst[DN][DN];

int main() {
  int n, x;
  //freopen("input.txt", "r", stdin);
  ifstream fin("royfloyd.in");
  ofstream fout("royfloyd.out");
  fin >> n; 
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      fin >> dst[i][j];
      if(dst[i][j] == 0)
        dst[i][j] = infinity;
    }
  }
  for(int k = 0; k < n; ++k)
    for(int i = 0; i < n; ++i){
      for(int j = 0; j < n; ++j){
        if(i == j || i == k || j == k)
          continue;
        dst[i][j] = min(dst[i][j], dst[i][k] + dst[k][j]);
      }
    }
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j)
      if(dst[i][j] == infinity)
        fout << 0 << " ";
      else
        fout << dst[i][j] << " ";
      fout << '\n';
  }
  return 0;
}