oj.uz

답안 #113235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113235 2019-05-24T11:42:09 Z FutymyClone Evacuation plan (IZhO18_plan) C++14
100 / 100
 656 ms 45500 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, dist[N], p, q, h[N], par[20][N], Min[20][N];
vector <pair <int, int> > g[N], tree[N];
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;

struct edge {
    int u, v, w;

    edge (int u = 0, int v = 0, int w = 0): u(u), v(v), w(w) {}

    bool operator < (const edge &rhs) const {
        return w > rhs.w;
    }
};

vector <edge> e;

struct disj {
    int par[N];
    void init (int n) {
        iota(par + 1, par + n + 1, 1);
    }

    int Find (int x) {
        return par[x] == x ? x : par[x] = Find(par[x]);
    }

    bool same (int x, int y) {
        return Find(x) == Find(y);
    }

    void join (int x, int y) {
        x = Find(x); y = Find(y);
        if (x == y) return;
        par[y] = x;
    }
} dsu;

void dijkstra(){
    memset(dist, 0x3f, sizeof(dist));
    cin >> p;
    for (int i = 1; i <= p; i++) {
        int x;
        cin >> x;
        dist[x] = 0;
        pq.push({dist[x], x});
    }

    while (!pq.empty()) {
        int d = pq.top().first, u = pq.top().second; pq.pop();
        if (d == dist[u]) {
            for (auto V: g[u]) {
                int w = V.first, v = V.second;
                if (dist[v] > dist[u] + w) {
                    dist[v] = dist[u] + w;
                    pq.push({dist[v], v});
                }
            }
        }
    }
}

void buildMST(){
    for (auto &i: e) i.w = min(dist[i.u], dist[i.v]);
    sort(e.begin(), e.end());
    for (auto i: e) {
        if (dsu.same(i.u, i.v)) continue;
        dsu.join(i.u, i.v);
        tree[i.u].push_back({i.w, i.v});
        tree[i.v].push_back({i.w, i.u});
    }

    memset(par, -1, sizeof(par)); memset(Min, 0x3f, sizeof(Min));
}

void dfs (int u, int p) {
    for (auto V: tree[u]) {
        int w = V.first, v = V.second;
        if (v == p) continue;
        h[v] = h[u] + 1;
        par[0][v] = u;
        Min[0][v] = w;
        dfs(v, u);
    }
}

void makeLCA(){
    for (int i = 1; i < 20; i++) {
        for (int j = 1; j <= n; j++) {
            if (par[i - 1][j] != -1) {
                par[i][j] = par[i - 1][par[i - 1][j]];
                Min[i][j] = min(Min[i - 1][j], Min[i - 1][par[i - 1][j]]);
            }
        }
    }
}

int LCA (int x, int y) {
    int ans = 1e9;
    if (h[x] > h[y]) swap(x, y);
    for (int i = 19; i >= 0; i--) {
        if (h[y] - (1 << i) >= h[x] && par[i][y] != -1) {
            ans = min(ans, Min[i][y]);
            y = par[i][y];
        }
    }

    if (x == y) return ans;
    for (int i = 19; i >= 0; i--) {
        if (par[i][x] != -1 && par[i][y] != -1 && par[i][x] != par[i][y]) {
            ans = min(ans, Min[i][x]);
            ans = min(ans, Min[i][y]);
            x = par[i][x];
            y = par[i][y];
        }
    }

    if (x == y) return ans;
    ans = min(ans, min(Min[0][x], Min[0][y]));
    return ans;
}

void answerQueries(){
    cin >> q;
    while (q--) {
        int u, v;
        cin >> u >> v;
        cout << LCA(u, v) << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m; dsu.init(n);
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({w, v});
        g[v].push_back({w, u});
        e.push_back(edge(u, v, w));
    }

    dijkstra();
    buildMST();
    dfs(1, 1);
    makeLCA();
    answerQueries();
    return 0;
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 21112 KB Output is correct
2 Correct 20 ms 21228 KB Output is correct
3 Correct 21 ms 21212 KB Output is correct
4 Correct 19 ms 21084 KB Output is correct
5 Correct 20 ms 21240 KB Output is correct
6 Correct 20 ms 21240 KB Output is correct
7 Correct 20 ms 21112 KB Output is correct
8 Correct 19 ms 21112 KB Output is correct
9 Correct 21 ms 21240 KB Output is correct
10 Correct 20 ms 21240 KB Output is correct
11 Correct 20 ms 21116 KB Output is correct
12 Correct 21 ms 21240 KB Output is correct
13 Correct 21 ms 21112 KB Output is correct
14 Correct 21 ms 21240 KB Output is correct
15 Correct 21 ms 21240 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 21112 KB Output is correct
2 Correct 20 ms 21228 KB Output is correct
3 Correct 21 ms 21212 KB Output is correct
4 Correct 19 ms 21084 KB Output is correct
5 Correct 20 ms 21240 KB Output is correct
6 Correct 20 ms 21240 KB Output is correct
7 Correct 20 ms 21112 KB Output is correct
8 Correct 19 ms 21112 KB Output is correct
9 Correct 21 ms 21240 KB Output is correct
10 Correct 20 ms 21240 KB Output is correct
11 Correct 20 ms 21116 KB Output is correct
12 Correct 21 ms 21240 KB Output is correct
13 Correct 21 ms 21112 KB Output is correct
14 Correct 21 ms 21240 KB Output is correct
15 Correct 21 ms 21240 KB Output is correct
16 Correct 205 ms 29688 KB Output is correct
17 Correct 635 ms 45472 KB Output is correct
18 Correct 59 ms 23344 KB Output is correct
19 Correct 165 ms 32132 KB Output is correct
20 Correct 644 ms 45500 KB Output is correct
21 Correct 328 ms 34520 KB Output is correct
22 Correct 192 ms 34988 KB Output is correct
23 Correct 618 ms 45292 KB Output is correct
24 Correct 622 ms 45452 KB Output is correct
25 Correct 640 ms 45232 KB Output is correct
26 Correct 168 ms 31908 KB Output is correct
27 Correct 158 ms 32028 KB Output is correct
28 Correct 201 ms 31812 KB Output is correct
29 Correct 172 ms 32000 KB Output is correct
30 Correct 161 ms 32096 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 21116 KB Output is correct
2 Correct 20 ms 21112 KB Output is correct
3 Correct 20 ms 21084 KB Output is correct
4 Correct 20 ms 21112 KB Output is correct
5 Correct 20 ms 21112 KB Output is correct
6 Correct 20 ms 21116 KB Output is correct
7 Correct 20 ms 21112 KB Output is correct
8 Correct 20 ms 21112 KB Output is correct
9 Correct 20 ms 21084 KB Output is correct
10 Correct 20 ms 21112 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 283 ms 34140 KB Output is correct
2 Correct 588 ms 44904 KB Output is correct
3 Correct 591 ms 44860 KB Output is correct
4 Correct 152 ms 32168 KB Output is correct
5 Correct 584 ms 44940 KB Output is correct
6 Correct 579 ms 44888 KB Output is correct
7 Correct 561 ms 44928 KB Output is correct
8 Correct 572 ms 45028 KB Output is correct
9 Correct 550 ms 44800 KB Output is correct
10 Correct 544 ms 44888 KB Output is correct
11 Correct 568 ms 44852 KB Output is correct
12 Correct 559 ms 44816 KB Output is correct
13 Correct 542 ms 44816 KB Output is correct
14 Correct 557 ms 44848 KB Output is correct
15 Correct 582 ms 44880 KB Output is correct
16 Correct 619 ms 44936 KB Output is correct
17 Correct 555 ms 44928 KB Output is correct
18 Correct 560 ms 44824 KB Output is correct
19 Correct 156 ms 33716 KB Output is correct
20 Correct 584 ms 44984 KB Output is correct
21 Correct 523 ms 44572 KB Output is correct
22 Correct 134 ms 31672 KB Output is correct
23 Correct 157 ms 30812 KB Output is correct
24 Correct 132 ms 31628 KB Output is correct
25 Correct 130 ms 31608 KB Output is correct
26 Correct 169 ms 30956 KB Output is correct
27 Correct 153 ms 33592 KB Output is correct
28 Correct 127 ms 31596 KB Output is correct
29 Correct 158 ms 32904 KB Output is correct
30 Correct 127 ms 31692 KB Output is correct
31 Correct 157 ms 32860 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 21112 KB Output is correct
2 Correct 20 ms 21228 KB Output is correct
3 Correct 21 ms 21212 KB Output is correct
4 Correct 19 ms 21084 KB Output is correct
5 Correct 20 ms 21240 KB Output is correct
6 Correct 20 ms 21240 KB Output is correct
7 Correct 20 ms 21112 KB Output is correct
8 Correct 19 ms 21112 KB Output is correct
9 Correct 21 ms 21240 KB Output is correct
10 Correct 20 ms 21240 KB Output is correct
11 Correct 20 ms 21116 KB Output is correct
12 Correct 21 ms 21240 KB Output is correct
13 Correct 21 ms 21112 KB Output is correct
14 Correct 21 ms 21240 KB Output is correct
15 Correct 21 ms 21240 KB Output is correct
16 Correct 205 ms 29688 KB Output is correct
17 Correct 635 ms 45472 KB Output is correct
18 Correct 59 ms 23344 KB Output is correct
19 Correct 165 ms 32132 KB Output is correct
20 Correct 644 ms 45500 KB Output is correct
21 Correct 328 ms 34520 KB Output is correct
22 Correct 192 ms 34988 KB Output is correct
23 Correct 618 ms 45292 KB Output is correct
24 Correct 622 ms 45452 KB Output is correct
25 Correct 640 ms 45232 KB Output is correct
26 Correct 168 ms 31908 KB Output is correct
27 Correct 158 ms 32028 KB Output is correct
28 Correct 201 ms 31812 KB Output is correct
29 Correct 172 ms 32000 KB Output is correct
30 Correct 161 ms 32096 KB Output is correct
31 Correct 19 ms 21116 KB Output is correct
32 Correct 20 ms 21112 KB Output is correct
33 Correct 20 ms 21084 KB Output is correct
34 Correct 20 ms 21112 KB Output is correct
35 Correct 20 ms 21112 KB Output is correct
36 Correct 20 ms 21116 KB Output is correct
37 Correct 20 ms 21112 KB Output is correct
38 Correct 20 ms 21112 KB Output is correct
39 Correct 20 ms 21084 KB Output is correct
40 Correct 20 ms 21112 KB Output is correct
41 Correct 283 ms 34140 KB Output is correct
42 Correct 588 ms 44904 KB Output is correct
43 Correct 591 ms 44860 KB Output is correct
44 Correct 152 ms 32168 KB Output is correct
45 Correct 584 ms 44940 KB Output is correct
46 Correct 579 ms 44888 KB Output is correct
47 Correct 561 ms 44928 KB Output is correct
48 Correct 572 ms 45028 KB Output is correct
49 Correct 550 ms 44800 KB Output is correct
50 Correct 544 ms 44888 KB Output is correct
51 Correct 568 ms 44852 KB Output is correct
52 Correct 559 ms 44816 KB Output is correct
53 Correct 542 ms 44816 KB Output is correct
54 Correct 557 ms 44848 KB Output is correct
55 Correct 582 ms 44880 KB Output is correct
56 Correct 619 ms 44936 KB Output is correct
57 Correct 555 ms 44928 KB Output is correct
58 Correct 560 ms 44824 KB Output is correct
59 Correct 156 ms 33716 KB Output is correct
60 Correct 584 ms 44984 KB Output is correct
61 Correct 523 ms 44572 KB Output is correct
62 Correct 134 ms 31672 KB Output is correct
63 Correct 157 ms 30812 KB Output is correct
64 Correct 132 ms 31628 KB Output is correct
65 Correct 130 ms 31608 KB Output is correct
66 Correct 169 ms 30956 KB Output is correct
67 Correct 153 ms 33592 KB Output is correct
68 Correct 127 ms 31596 KB Output is correct
69 Correct 158 ms 32904 KB Output is correct
70 Correct 127 ms 31692 KB Output is correct
71 Correct 157 ms 32860 KB Output is correct
72 Correct 363 ms 34632 KB Output is correct
73 Correct 631 ms 45452 KB Output is correct
74 Correct 640 ms 45336 KB Output is correct
75 Correct 636 ms 45276 KB Output is correct
76 Correct 634 ms 45436 KB Output is correct
77 Correct 648 ms 45256 KB Output is correct
78 Correct 652 ms 45268 KB Output is correct
79 Correct 643 ms 45320 KB Output is correct
80 Correct 643 ms 45268 KB Output is correct
81 Correct 639 ms 45316 KB Output is correct
82 Correct 634 ms 45468 KB Output is correct
83 Correct 653 ms 45312 KB Output is correct
84 Correct 645 ms 45312 KB Output is correct
85 Correct 628 ms 45312 KB Output is correct
86 Correct 611 ms 45232 KB Output is correct
87 Correct 624 ms 45372 KB Output is correct
88 Correct 624 ms 45300 KB Output is correct
89 Correct 270 ms 33964 KB Output is correct
90 Correct 656 ms 45304 KB Output is correct
91 Correct 630 ms 44908 KB Output is correct
92 Correct 183 ms 32028 KB Output is correct
93 Correct 266 ms 31612 KB Output is correct
94 Correct 189 ms 31900 KB Output is correct
95 Correct 178 ms 32100 KB Output is correct
96 Correct 274 ms 31516 KB Output is correct
97 Correct 267 ms 32936 KB Output is correct
98 Correct 203 ms 31888 KB Output is correct
99 Correct 380 ms 34132 KB Output is correct
100 Correct 191 ms 32040 KB Output is correct