백준 - 11404 플로이드

문제 링크입니다 : https://www.acmicpc.net/problem/11404

11404번: 플로이드

 

 

플로이드 와샬 문제!

 

 

 

 

 

#include <iostream>
#include <vector>
#define INF 987654321

using namespace std;

int n;
vector<vector<int>> board;

vector<vector<int>> floydWarshall() {
	vector<vector<int>> ret;

	ret = board;

	for(int k = 0; k < n; k++) {
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				if(ret[i][k] + ret[k][j] < ret[i][j]) {
					ret[i][j] = ret[i][k] + ret[k][j];
				}
			}
		}
	}
	return ret;
}


int main() {
	int m;
	cin >> n >> m;
	board.assign(n, vector<int>(n, INF));

	int u, v, cost;
	for(int i = 0; i < m; i++) {
		cin >> u >> v >> cost;
		if(board[u - 1][v - 1] > cost) {
			board[u - 1][v - 1] = cost;
		}
	}

	for(int i = 0; i < n; i++) {
		board[i][i] = 0;
	}

	vector<vector<int>> temp = floydWarshall();
	
	for(const auto& el : temp) {
		for(const auto& e : el) {
			if(e == INF) cout << 0 << ' ';
			else cout << e << ' ';
		}
		cout << '\n';
	}

	
    return 0;
}

 

 

 

개발 환경 : vscode

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~