Cod sursa(job #2031124)

Utilizator robuvedVictor Robu robuved Data 2 octombrie 2017 19:14:40
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
#include <vector>
#include <climits>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

#define INF INT_MAX
int main()
{
	int N;
	in >> N;
	vector<vector<int>> adj(N, vector<int>(N, 0));
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			in >> adj[i][j];
			if (!adj[i][j])
				adj[i][j] = INF;
		}
	}

	for (int k = 0; k < N; k++)
	{
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < N; j++)
			{
				if (i != j && adj[i][k] != INF && adj[k][j] != INF &&
					adj[i][k] + adj[k][j] < adj[i][j])
				{
					if (i == 0 && j == 0)
						out << "DERP";
					adj[i][j] = adj[i][k] + adj[k][j];
				}
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			if (adj[i][j] == INF)
				out << "0 ";
			else
				out << adj[i][j] << ' ';
		}
		out << '\n';
	}
}