Hello World!

https://www.acmicpc.net/problem/18126코드#include #include using namespace std;typedef long long ll;vector>> tree;ll ans = 0;vector visit(5001);void dist(int start, ll len) { ans = max(ans, len); if (tree[start].empty()) return; else { for (int i = 0; i > n; tree.resize(n + 1); visit[1] = true; for (int i = 0, a, b, len; i > a >> b >> len; tree[a].push_back({ b, len }); tree[b].push_back({ a, l..

https://www.acmicpc.net/problem/1240 코드#include #include #include using namespace std;typedef long long ll;vector>> tree;ll ans = LLONG_MAX;vector visit(1001);void find_node(int now, int target, ll tmp) { if (now == target) { ans = min(ans, tmp); return; } else { visit[now] = true; for (int i = 0; i > n >> m; tree.resize(n+1); for (int i = 0, a, b, len; i > a >> b >> len; tree[a].push_back(..