Cod sursa(job #2756652)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 2 iunie 2021 11:33:20
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <cstdio>
#include <vector>

using namespace std;

vector<vector<int>> A, DP;

int main()
{
  freopen("royfloyd.in", "r", stdin);
  freopen("royfloyd.out", "w", stdout);

  int N;
  scanf("%d", &N);
  A.resize(N, vector<int>(N));
  DP.resize(N, vector<int>(N));

  const int INF = 0x3f3f3f3f;
  
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < N; ++j) {
      scanf("%d", &A[i][j]);
      DP[i][j] = A[i][j];
      if (A[i][j] == 0)
	DP[i][j] = INF;
    }

  for (int k = 0; k < N; ++k)
    for (int i = 0; i < N; ++i)
      if (i != k)
	for (int j = 0; j < N; ++j)
	  if (j != k && j != i)
	    DP[i][j] = min(DP[i][j], DP[i][k] + DP[k][j]);

  for (auto it : DP) {
    for (auto jt: it)
      if (jt >= INF)
	printf("0 ");
      else
	printf("%d ", jt);
    printf("\n");
  }
  
  
  return 0;
}