Cod sursa(job #2506705)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 8 decembrie 2019 17:23:09
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <memory.h>

using namespace std;
int DP[105][105], N;
const int INF = 0x3f3f3f3f;

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

  scanf("%d", &N);

  memset(DP, INF, sizeof(DP));
  int aux;
  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= N; ++j) {
      scanf("%d", &aux);
      if (i == j)
	DP[i][j] = 0;
      if (aux == 0)
	DP[i][j] = INF;
      else
	DP[i][j] = aux;
    }
  }

  for (int k = 1; k <= N; ++k) {
    for (int i = 1; i <= N; ++i) {
      if (i != k)
	for (int j = 1; j <= N; ++j) {
	  if (i != j && k != j) 
	    if(DP[i][j] > DP[i][k] + DP[k][j]) 
	      DP[i][j] = DP[i][k] + DP[k][j];
	}	
    }
  }

  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= N; ++j)
      if (DP[i][j] >= INF)
	printf("0 ");
      else
	printf("%d ", DP[i][j]);
    printf("\n");	       
  }
  
  return 0;
}