Cod sursa(job #2488750)

Utilizator bogdanvladmihaiBogdan Vlad-Mihai bogdanvladmihai Data 7 noiembrie 2019 16:29:29
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <bits/stdc++.h>

const int MAX_N = 105;
const int INF = (1 << 25);

int n;

int g[MAX_N][MAX_N];

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", &g[i][j]);
      if (g[i][j] == 0) {
        g[i][j] = INF;
      }
    }
  }
  for (int k = 1; k <= n; ++k) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (g[i][k] > 0 && g[k][j] > 0) {
          g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (g[i][j] == INF || i == j) {
        g[i][j] = 0;
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      printf("%d ", g[i][j]);
    }
    printf("\n");
  }
#ifdef LOCAL_DEFINE
  std::cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}