Cod sursa(job #2865198)

Utilizator QwertyDvorakQwerty Dvorak QwertyDvorak Data 8 martie 2022 16:39:53
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define dbg(x) cout << #x <<": " << x << "\n";
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];

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

	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			for (int k = 1; k <= n; ++k)
				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)
			fout << (d[i][j] == 2e9 ? 0 : d[i][j]) << " \n"[j == n];



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