Cod sursa(job #3321048)

Utilizator n6v26rDedu Razvan Matei n6v26r Data 8 noiembrie 2025 01:03:34
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
// SOURCE: infoarena.ro
#include <climits>
#include <stdio.h>

#define MAXN 300
#define MIN(a, b) ((a) < (b) ? (a) : (b))

int n;
int dp[MAXN][MAXN];

int main() {
  freopen("royfloyd.in", "r", stdin);
  freopen("royfloyd.out", "w", stdout);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      scanf("%d", &dp[i][j]);
    }
  }

  for (int k = 0; k < n; k++) {
    for (int i = 0; i < n; i++) {
      if (dp[i][k] == 0)
        continue;
      for (int j = 0; j < n; j++) {
        if (i == j)
          continue;

        if (dp[k][j] == 0)
          continue;

        if (dp[i][j] > dp[i][k] + dp[k][j] || !dp[i][j])
          dp[i][j] = dp[i][k] + dp[k][j];
      }
    }
  }

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++)
      printf("%d ", dp[i][j]);
    printf("\n");
  }
  return 0;
}