Pagini recente » Cod sursa (job #2952314) | Cod sursa (job #2230864) | Cod sursa (job #2005320) | Cod sursa (job #184953) | Cod sursa (job #3248214)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
struct Info {
int node2;
int w;
Info() = default;
Info(int node2, int w) : node2(node2), w(w) {}
};
int n;
vector<vector<int>> graph;
void read() {
cin >> n;
graph.resize(n + 1, vector<int>(n + 1));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> graph[i][j];
}
}
}
void solve() {
vector<vector<int>> dist(n + 1, vector<int>(n + 1, 1e9));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (graph[i][j] == 0) {
continue;
}
dist[i][j] = min(dist[i][j], graph[i][j]);
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i != j && dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (dist[i][j] == 1e9) {
cout << 0 << " ";
continue;
}
cout << dist[i][j] << " ";
}
cout << "\n";
}
}
int main() {
read();
solve();
return 0;
}