Cod sursa(job #2862477)

Utilizator QwertyDvorakQwerty Dvorak QwertyDvorak Data 5 martie 2022 13:37:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair

using ll = long long;

const string myf = "royfloyd";
ifstream fin(myf + ".in");
ofstream fout(myf + ".out");

int n;
int a[105][105];
int d[105][105];

int main() {

	fin >> n;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j) {
			fin >> a[i][j];
			if (a[i][j] == 0 && i != j)
				a[i][j] = 1e9;
		}

	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			d[i][j] = a[i][j];
	for (int k = 1; k <= n; ++k)
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			if (d[i][j] == 1e9)
				fout << "0" << " \n"[j == n];
			else fout << d[i][j] << " \n"[j == n];

	fin.close();
	fout.close();
	return 0;
}