Gideok_it

#include using namespace std; #define X first #define Y second int v, e, st,en; //{비용, 정점 번호} vector adj[20005]; const int INF = 1e9 + 10; int d[1005]; // 최단 거리 테이블 int pre[1005]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> v >> e; fill(d, d + v + 1, INF); while (e--) { int u, v, w; cin >> u >> v >> w; adj[u].push_back({ w,v }); } cin >> st >> en; priority_queue pq; d[st] = 0; /..

#include using namespace std; #define X first #define Y second int v, e, st; //{비용, 정점 번호} vector adj[20005]; const int INF = 1e9 + 10; int d[20005]; // 최단 거리 테이블 int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> v >> e >> st; fill(d, d + v + 1, INF); while (e--) { int u, v, w; cin >> u >> v >> w; adj[u].push_back({ w,v }); } priority_queue pq; d[st] = 0; // 우선순위 큐에 {0, 시작점} 추가 pq.pus..

#include using namespace std; const int INF = 0x3f3f3f3f; int v[12][12]; int n, start; int a, b, c; int ans=INF; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> start; for (int i = 1; i >v[i][j]; } } for (int i = 0; i < n; i++) v[i][i] = 0; for (int k = 0; k < n; k++) for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) v[i][j] = min(v[i][j], v[i][k] + v[k][j]); // if 문으로 바꾸..

#include using namespace std; const int INF = 0x3f3f3f3f; int v[205][205]; vector vv; int ans[205]; int n, e,kk; int a, b, c; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> e; for (int i = 1; i > a >> b >> c; v[a][b] = min(v[a][b], c); } for (int i = 1; i > kk; for (int i = 0; i > aa; vv.push_back(aa); } for (int k = 1; k

#include using namespace std; const int INF = 0x3f3f3f3f; int v[105][105]; int it[105]; int n, e,m; int a, b, c; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m>>e; for (int i = 1; i it[i]; } for (int i = 0; i > a >> b >> c; v[a][b] = min(v[a][b], c); v[b][a] = min(v[b][a], c); } for (int i = 1; i

#include using namespace std; const int INF = 0x3f3f3f3f; int v[105][105]; int nxt[105][105]; int n, e; int a, b, c; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> e; for (int i = 1; i > a >> b >> c; v[a][b] = min(v[a][b], c); nxt[a][b] = b; } for (int i = 1; i

#include using namespace std; const int INF = 0x3f3f3f3f; int v[105][105]; int n, e; int a, b, c; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> e; for (int i = 1; i > a >> b >> c; v[a][b] = min(v[a][b],c); } for (int i = 1; i