Skip to content

260126 : [BOJ 11780] 플로이드 2 #2334

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KII1ua wants to merge 1 commit into
base: main
Choose a base branch
from
Open

260126 : [BOJ 11780] 플로이드 2 #2334

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
100 changes: 100 additions & 0 deletions _sungyoon/11780.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,100 @@
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define endl "\n"

struct Tree {
int Node, left, right;
};

const int INF = 1e9;
const int MAX = 101;
const int MOD = 1e9 + 7;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int n, m;
int graph[MAX][MAX];
int path[MAX][MAX];
vector<int> v;

void Print() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(graph[i][j] == INF) cout << 0 << " ";
else cout << graph[i][j] << " ";
}
cout << endl;
}
}

void find_route(int start, int end) {
if(path[start][end] == 0) {
v.push_back(start);
v.push_back(end);
return;
}
find_route(start, path[start][end]);
v.pop_back();
find_route(path[start][end], end);
}

void solve() {
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
int value = graph[i][k] + graph[k][j];

if(value < graph[i][j]) {
graph[i][j] = value;
path[i][j] = k;
}
}
}
}

Print();
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(i == j || graph[i][j] == INF) cout << 0 << endl;
else {
v.clear();
find_route(i, j);
cout << v.size() << " ";
for(auto &it : v) {
cout << it << " ";
}
cout << endl;
}
}
}
}

void Init() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(i == j) continue;
graph[i][j] = INF;
}
}
}

void input() {
cin >> n >> m;

Init();

for(int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
graph[a][b] = min(graph[a][b], c);
}
}

int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);

input();
solve();
}