| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324364 | sh_qaxxorov_571 | Evacuation plan (IZhO18_plan) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 1e9;
vector<pair<int, int>> adj[MAXN], mst_adj[MAXN];
int D[MAXN], up[MAXN][20], min_val[MAXN][20], depth[MAXN];
int parent[MAXN];
// Kruskal uchun DSU
int find_set(int v) {
if (v == parent[v]) return v;
return parent[v] = find_set(parent[v]);
}
void dfs(int u, int p, int d, int w) {
depth[u] = d;
up[u][0] = p;
min_val[u][0] = w;
for (int i = 1; i < 20; i++) {
up[u][i] = up[up[u][i-1]][i-1];
min_val[u][i] = min(min_val[u][i-1], min_val[up[u][i-1]][i-1]);
}
for (auto& edge : mst_adj[u]) {
if (edge.first != p) dfs(edge.first, u, d + 1, edge.second);
}
}
int query(int u, int v) {
if (depth[u] < depth[v]) swap(u, v);
int res = INF;
for (int i = 19; i >= 0; i--) {
if (depth[u] - (1 << i) >= depth[v]) {
res = min(res, min_val[u][i]);
u = up[u][i];
}
}
if (u == v) return res;
for (int i = 19; i >= 0; i--) {
if (up[u][i] != up[v][i]) {
res = min(res, min(min_val[u][i], min_val[v][i]));
u = up[u][i]; v = up[v][i];
}
}
return min(res, min(min_val[u][0], min_val[v][0]));
}