oj.uz

답안 #571413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571413 2022-06-02T07:22:51 Z Shin Evacuation plan (IZhO18_plan) C++14
100 / 100
 568 ms 67048 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

struct Disjoint_set {
    vector<int> lab;

    Disjoint_set(int n = 0) {
        lab.assign(n + 7, -1);
    }
    int root(int u) {
        return lab[u] < 0 ? u : lab[u] = root(lab[u]);
    }
    bool unite(int u, int v) {
        u = root(u); v = root(v);
        if (u == v) return false;
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }
};

const int N = 5e5 + 7;
const int LOG = 20;

int n, m, num_npp;
int npp[N];
int ind[N];
int dist[N];
int depth[N];
int f[N][LOG + 1];
int par[N][LOG + 1];

bool flag[N];
vector<pair<int, int>> adj[N];
vector<int> g[N];

void shotest_path() {
  priority_queue<pair<int, int>> heap;
  memset(dist, 0x3f, sizeof dist);
  for (int i = 1; i <= num_npp; i ++) {
    heap.emplace(0, npp[i]);
    dist[npp[i]] = 0;
  }
  while (!heap.empty()) {
    int u, d_u; tie(d_u, u) = heap.top();
    heap.pop();
    d_u *= -1;
    if (dist[u] != d_u) {
      continue;
    }
    for (pair<int, int> v: adj[u]) if (minimize(dist[v.fi], d_u + v.se)) {
      heap.emplace(-d_u - v.se, v.fi);
    } 
  }
}

void dfs(int u, int p) {
  par[u][0] = p;
  f[u][0] = dist[u];
  for (int i = 1; i <= LOG; i ++) {
    par[u][i] = par[par[u][i - 1]][i - 1];
    f[u][i] = min(f[u][i - 1], f[par[u][i - 1]][i - 1]);
  }
  for (int v: g[u]) if (v != p) {
    depth[v] = depth[u] + 1;
    dfs(v, u);
  } 
}

int lca(int u, int v) {
  if (depth[v] > depth[u]) {
    swap(u, v);
  }
  int dist = depth[u] - depth[v], res = (int) 1e9;
  for (int i = LOG; i >= 0; i --) if ((dist >> i) & 1) {
    minimize(res, f[u][i]);
    u = par[u][i];
  }
  if (u == v) {
    return min(res, f[u][0]);
  }
  for (int i = LOG; i >= 0; i --) if (par[u][i] != par[v][i]) {
    minimize(res, f[u][i]);
    minimize(res, f[v][i]);
    u = par[u][i];
    v = par[v][i];
  }
  int w = par[u][0];
  minimize(res, f[w][0]);
  minimize(res, f[u][0]);
  return min(res, f[v][0]);
}

void build_tree() {
  iota(ind + 1, ind + n + 1, 1);
  sort(ind + 1, ind + n + 1, [&](int u, int v) {
    return dist[u] > dist[v];
  });
  Disjoint_set dsu(n);
  for (int i = 1; i <= n; i ++) {
    int u = ind[i];
    for (pair<int, int> v: adj[u]) {
      if (flag[v.fi]) {
        if (dsu.unite(u, v.fi)) {
          g[u].push_back(v.fi);
          g[v.fi].push_back(u);
        }
      }
    }
    flag[u] = true;
  }
  dfs(1, 1);
}

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= m; i ++) {
    int u, v, w; cin >> u >> v >> w;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
  } 
  cin >> num_npp;
  for (int i = 1; i <= num_npp; i ++) {
    cin >> npp[i];
  }
  shotest_path();
  build_tree();
  int q; cin >> q;
  while (q --) {
    int u, v; cin >> u >> v;
    cout << lca(u, v) << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 25804 KB Output is correct
2 Correct 14 ms 26068 KB Output is correct
3 Correct 14 ms 26052 KB Output is correct
4 Correct 13 ms 25684 KB Output is correct
5 Correct 16 ms 26004 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 14 ms 25728 KB Output is correct
8 Correct 13 ms 25836 KB Output is correct
9 Correct 16 ms 26056 KB Output is correct
10 Correct 14 ms 26008 KB Output is correct
11 Correct 14 ms 26068 KB Output is correct
12 Correct 14 ms 26032 KB Output is correct
13 Correct 15 ms 26060 KB Output is correct
14 Correct 14 ms 26068 KB Output is correct
15 Correct 15 ms 26068 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 25804 KB Output is correct
2 Correct 14 ms 26068 KB Output is correct
3 Correct 14 ms 26052 KB Output is correct
4 Correct 13 ms 25684 KB Output is correct
5 Correct 16 ms 26004 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 14 ms 25728 KB Output is correct
8 Correct 13 ms 25836 KB Output is correct
9 Correct 16 ms 26056 KB Output is correct
10 Correct 14 ms 26008 KB Output is correct
11 Correct 14 ms 26068 KB Output is correct
12 Correct 14 ms 26032 KB Output is correct
13 Correct 15 ms 26060 KB Output is correct
14 Correct 14 ms 26068 KB Output is correct
15 Correct 15 ms 26068 KB Output is correct
16 Correct 240 ms 48340 KB Output is correct
17 Correct 519 ms 66900 KB Output is correct
18 Correct 48 ms 30192 KB Output is correct
19 Correct 161 ms 54380 KB Output is correct
20 Correct 522 ms 67048 KB Output is correct
21 Correct 274 ms 55988 KB Output is correct
22 Correct 222 ms 59040 KB Output is correct
23 Correct 458 ms 62748 KB Output is correct
24 Correct 486 ms 62812 KB Output is correct
25 Correct 469 ms 62736 KB Output is correct
26 Correct 178 ms 53660 KB Output is correct
27 Correct 183 ms 53680 KB Output is correct
28 Correct 145 ms 53640 KB Output is correct
29 Correct 157 ms 53748 KB Output is correct
30 Correct 170 ms 53804 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25856 KB Output is correct
2 Correct 13 ms 25768 KB Output is correct
3 Correct 13 ms 25708 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 17 ms 25680 KB Output is correct
6 Correct 15 ms 25812 KB Output is correct
7 Correct 15 ms 25760 KB Output is correct
8 Correct 13 ms 25684 KB Output is correct
9 Correct 14 ms 25712 KB Output is correct
10 Correct 14 ms 25812 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 206 ms 52548 KB Output is correct
2 Correct 410 ms 59268 KB Output is correct
3 Correct 382 ms 59264 KB Output is correct
4 Correct 151 ms 53608 KB Output is correct
5 Correct 406 ms 59380 KB Output is correct
6 Correct 463 ms 59336 KB Output is correct
7 Correct 441 ms 59240 KB Output is correct
8 Correct 411 ms 59296 KB Output is correct
9 Correct 412 ms 59248 KB Output is correct
10 Correct 388 ms 59192 KB Output is correct
11 Correct 417 ms 59240 KB Output is correct
12 Correct 386 ms 59372 KB Output is correct
13 Correct 407 ms 59372 KB Output is correct
14 Correct 387 ms 59268 KB Output is correct
15 Correct 401 ms 59296 KB Output is correct
16 Correct 361 ms 59260 KB Output is correct
17 Correct 412 ms 59252 KB Output is correct
18 Correct 360 ms 59356 KB Output is correct
19 Correct 149 ms 55632 KB Output is correct
20 Correct 406 ms 59236 KB Output is correct
21 Correct 355 ms 59504 KB Output is correct
22 Correct 114 ms 51016 KB Output is correct
23 Correct 133 ms 50908 KB Output is correct
24 Correct 116 ms 50944 KB Output is correct
25 Correct 110 ms 50892 KB Output is correct
26 Correct 153 ms 51408 KB Output is correct
27 Correct 159 ms 55440 KB Output is correct
28 Correct 116 ms 50840 KB Output is correct
29 Correct 147 ms 54476 KB Output is correct
30 Correct 109 ms 50952 KB Output is correct
31 Correct 147 ms 54512 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 25804 KB Output is correct
2 Correct 14 ms 26068 KB Output is correct
3 Correct 14 ms 26052 KB Output is correct
4 Correct 13 ms 25684 KB Output is correct
5 Correct 16 ms 26004 KB Output is correct
6 Correct 15 ms 26068 KB Output is correct
7 Correct 14 ms 25728 KB Output is correct
8 Correct 13 ms 25836 KB Output is correct
9 Correct 16 ms 26056 KB Output is correct
10 Correct 14 ms 26008 KB Output is correct
11 Correct 14 ms 26068 KB Output is correct
12 Correct 14 ms 26032 KB Output is correct
13 Correct 15 ms 26060 KB Output is correct
14 Correct 14 ms 26068 KB Output is correct
15 Correct 15 ms 26068 KB Output is correct
16 Correct 240 ms 48340 KB Output is correct
17 Correct 519 ms 66900 KB Output is correct
18 Correct 48 ms 30192 KB Output is correct
19 Correct 161 ms 54380 KB Output is correct
20 Correct 522 ms 67048 KB Output is correct
21 Correct 274 ms 55988 KB Output is correct
22 Correct 222 ms 59040 KB Output is correct
23 Correct 458 ms 62748 KB Output is correct
24 Correct 486 ms 62812 KB Output is correct
25 Correct 469 ms 62736 KB Output is correct
26 Correct 178 ms 53660 KB Output is correct
27 Correct 183 ms 53680 KB Output is correct
28 Correct 145 ms 53640 KB Output is correct
29 Correct 157 ms 53748 KB Output is correct
30 Correct 170 ms 53804 KB Output is correct
31 Correct 13 ms 25856 KB Output is correct
32 Correct 13 ms 25768 KB Output is correct
33 Correct 13 ms 25708 KB Output is correct
34 Correct 14 ms 25812 KB Output is correct
35 Correct 17 ms 25680 KB Output is correct
36 Correct 15 ms 25812 KB Output is correct
37 Correct 15 ms 25760 KB Output is correct
38 Correct 13 ms 25684 KB Output is correct
39 Correct 14 ms 25712 KB Output is correct
40 Correct 14 ms 25812 KB Output is correct
41 Correct 206 ms 52548 KB Output is correct
42 Correct 410 ms 59268 KB Output is correct
43 Correct 382 ms 59264 KB Output is correct
44 Correct 151 ms 53608 KB Output is correct
45 Correct 406 ms 59380 KB Output is correct
46 Correct 463 ms 59336 KB Output is correct
47 Correct 441 ms 59240 KB Output is correct
48 Correct 411 ms 59296 KB Output is correct
49 Correct 412 ms 59248 KB Output is correct
50 Correct 388 ms 59192 KB Output is correct
51 Correct 417 ms 59240 KB Output is correct
52 Correct 386 ms 59372 KB Output is correct
53 Correct 407 ms 59372 KB Output is correct
54 Correct 387 ms 59268 KB Output is correct
55 Correct 401 ms 59296 KB Output is correct
56 Correct 361 ms 59260 KB Output is correct
57 Correct 412 ms 59252 KB Output is correct
58 Correct 360 ms 59356 KB Output is correct
59 Correct 149 ms 55632 KB Output is correct
60 Correct 406 ms 59236 KB Output is correct
61 Correct 355 ms 59504 KB Output is correct
62 Correct 114 ms 51016 KB Output is correct
63 Correct 133 ms 50908 KB Output is correct
64 Correct 116 ms 50944 KB Output is correct
65 Correct 110 ms 50892 KB Output is correct
66 Correct 153 ms 51408 KB Output is correct
67 Correct 159 ms 55440 KB Output is correct
68 Correct 116 ms 50840 KB Output is correct
69 Correct 147 ms 54476 KB Output is correct
70 Correct 109 ms 50952 KB Output is correct
71 Correct 147 ms 54512 KB Output is correct
72 Correct 369 ms 55564 KB Output is correct
73 Correct 437 ms 62228 KB Output is correct
74 Correct 445 ms 62220 KB Output is correct
75 Correct 435 ms 62292 KB Output is correct
76 Correct 430 ms 62212 KB Output is correct
77 Correct 473 ms 62208 KB Output is correct
78 Correct 503 ms 62212 KB Output is correct
79 Correct 449 ms 62168 KB Output is correct
80 Correct 466 ms 62036 KB Output is correct
81 Correct 420 ms 62092 KB Output is correct
82 Correct 503 ms 61912 KB Output is correct
83 Correct 427 ms 61976 KB Output is correct
84 Correct 449 ms 62000 KB Output is correct
85 Correct 428 ms 61780 KB Output is correct
86 Correct 431 ms 61644 KB Output is correct
87 Correct 568 ms 61520 KB Output is correct
88 Correct 454 ms 61396 KB Output is correct
89 Correct 259 ms 57068 KB Output is correct
90 Correct 441 ms 61332 KB Output is correct
91 Correct 420 ms 61112 KB Output is correct
92 Correct 171 ms 53284 KB Output is correct
93 Correct 250 ms 53524 KB Output is correct
94 Correct 156 ms 53116 KB Output is correct
95 Correct 159 ms 53152 KB Output is correct
96 Correct 217 ms 52728 KB Output is correct
97 Correct 278 ms 55792 KB Output is correct
98 Correct 164 ms 53116 KB Output is correct
99 Correct 252 ms 57436 KB Output is correct
100 Correct 201 ms 53100 KB Output is correct