oj.uz

답안 #141685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141685 2019-08-08T21:45:37 Z silxikys Evacuation plan (IZhO18_plan) C++14
100 / 100
 1804 ms 54220 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1e5+5;
int n, m, k;
struct Edge
{
    int from, to, wt;
};

vector<Edge> adj[maxn];

int d[maxn]; //min distance from black nodes

int parent[maxn]; //memset to -1
int Find(int x) {
    return parent[x] < 0 ? x : parent[x] = Find(parent[x]);
}

void Union(int x, int y) {
    x = Find(x);
    y = Find(y);
    if (x == y) return;
    if (parent[x] > parent[y]) swap(x,y);
    parent[x] += parent[y];
    parent[y] = x;
}

vector<Edge> mst[maxn];

const int maxk = 18;
int depth[maxn];
int par[maxk][maxn];
int mn[maxk][maxn];
void root(int i, int p) {
    for (Edge& e: mst[i]) {
        if (e.to == p) continue;
        depth[e.to] = depth[i] + 1;
        par[0][e.to] = i;
        mn[0][e.to] = e.wt;
        for (int k = 1; k < maxk; k++) {
            par[k][e.to] = par[k-1][par[k-1][e.to]];
            mn[k][e.to] = min(mn[k-1][e.to],mn[k-1][par[k-1][e.to]]);
        }
        root(e.to,i);
    }
}

int lca(int a, int b) {
    if (depth[a] > depth[b]) swap(a,b);
    for (int k = maxk - 1; k >= 0; k--) {
        int bb = par[k][b];
        if (bb != 0 && depth[bb] >= depth[a])
            b = bb;
    }
    if (a == b) return a;
    for (int k = maxk - 1; k >= 0; k--) {
        int aa = par[k][a];
        int bb = par[k][b];
        if (aa != bb) {
            a = aa;
            b = bb;
        }
    }
    return par[0][a];
}

int walk(int a, int lc) { //returns min on path a -> lc
    int res = 2e9+9;
    for (int k = maxk - 1; k >= 0; k--) {
        int aa = par[k][a];
        if (depth[aa] >= depth[lc]) {
            res = min(res,mn[k][a]);
            a = aa;
        }
    }
    return res;
}

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(NULL);
    memset(parent,-1,sizeof parent);
    cin >> n >> m;
    for (int k = 0; k < maxk; k++) {
        for (int i = 0; i <= n; i++) {
            mn[k][i] = 2e9+9;
        }
    }
    vector<Edge> edges;
    for (int i = 0; i < m; i++) {
        int a, b, w; cin >> a >> b >> w;
        adj[a].push_back({a,b,w});
        adj[b].push_back({b,a,w});
        edges.push_back({a,b,w});
    }
    cin >> k;
    queue<int> bad;
    for (int i = 1; i <= n; i++) {
        d[i] = 2e9+9;
    }
    for (int i = 0; i < k; i++) {
        int ai; cin >> ai;
        bad.push(ai);
        d[ai] = 0;
    }
    while (!bad.empty()) {
        int f = bad.front(); bad.pop();
        //cout << f << ": " << d[f] << '\n';
        for (Edge& e: adj[f]) {
            if (d[e.to] > d[f] + e.wt) {
                d[e.to] = d[f] + e.wt;
                bad.push(e.to);
            }
        }
    }
    for (Edge& e: edges) {
        e.wt = min(d[e.from],d[e.to]);
        //printf("%d -> %d: %d\n",e.from,e.to,e.wt);
    }
    sort(edges.begin(),edges.end(),[](auto a, auto b) {
            return a.wt > b.wt;
            });
    for (Edge& e: edges) {
        if (Find(e.from) == Find(e.to)) {
            continue;
        }
        else {
            Union(e.from,e.to);
            mst[e.from].push_back({e.from,e.to,e.wt});
            mst[e.to].push_back({e.to,e.from,e.wt});
            //printf("%d -> %d: %d\n",e.from,e.to,e.wt);
        }
    }
    root(1,1);
    int Q; cin >> Q;
    while (Q--) {
        int a, b; cin >> a >> b;
        int lc = lca(a,b);
        int ans = min(walk(a,lc),walk(b,lc));
        assert(ans < 2e9);
        //printf("lca = %d, w1 = %d, w2 = %d\n", lc,walk(a,lc),walk(b,lc));
        cout << ans << '\n';
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5624 KB Output is correct
2 Correct 13 ms 5752 KB Output is correct
3 Correct 12 ms 5756 KB Output is correct
4 Correct 6 ms 5624 KB Output is correct
5 Correct 12 ms 5800 KB Output is correct
6 Correct 12 ms 5752 KB Output is correct
7 Correct 7 ms 5624 KB Output is correct
8 Correct 7 ms 5624 KB Output is correct
9 Correct 12 ms 5880 KB Output is correct
10 Correct 13 ms 5796 KB Output is correct
11 Correct 12 ms 5880 KB Output is correct
12 Correct 12 ms 5880 KB Output is correct
13 Correct 12 ms 5752 KB Output is correct
14 Correct 12 ms 5880 KB Output is correct
15 Correct 12 ms 5880 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5624 KB Output is correct
2 Correct 13 ms 5752 KB Output is correct
3 Correct 12 ms 5756 KB Output is correct
4 Correct 6 ms 5624 KB Output is correct
5 Correct 12 ms 5800 KB Output is correct
6 Correct 12 ms 5752 KB Output is correct
7 Correct 7 ms 5624 KB Output is correct
8 Correct 7 ms 5624 KB Output is correct
9 Correct 12 ms 5880 KB Output is correct
10 Correct 13 ms 5796 KB Output is correct
11 Correct 12 ms 5880 KB Output is correct
12 Correct 12 ms 5880 KB Output is correct
13 Correct 12 ms 5752 KB Output is correct
14 Correct 12 ms 5880 KB Output is correct
15 Correct 12 ms 5880 KB Output is correct
16 Correct 766 ms 28736 KB Output is correct
17 Correct 1731 ms 53316 KB Output is correct
18 Correct 126 ms 10672 KB Output is correct
19 Correct 690 ms 32252 KB Output is correct
20 Correct 1696 ms 53996 KB Output is correct
21 Correct 1018 ms 37704 KB Output is correct
22 Correct 853 ms 34932 KB Output is correct
23 Correct 1804 ms 53900 KB Output is correct
24 Correct 1674 ms 53612 KB Output is correct
25 Correct 1654 ms 53168 KB Output is correct
26 Correct 696 ms 31988 KB Output is correct
27 Correct 676 ms 32172 KB Output is correct
28 Correct 666 ms 32004 KB Output is correct
29 Correct 674 ms 32076 KB Output is correct
30 Correct 681 ms 32220 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5628 KB Output is correct
2 Correct 7 ms 5624 KB Output is correct
3 Correct 7 ms 5624 KB Output is correct
4 Correct 6 ms 5624 KB Output is correct
5 Correct 7 ms 5624 KB Output is correct
6 Correct 7 ms 5624 KB Output is correct
7 Correct 7 ms 5568 KB Output is correct
8 Correct 7 ms 5624 KB Output is correct
9 Correct 7 ms 5624 KB Output is correct
10 Correct 7 ms 5624 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 34164 KB Output is correct
2 Correct 1198 ms 48360 KB Output is correct
3 Correct 1195 ms 48340 KB Output is correct
4 Correct 304 ms 30640 KB Output is correct
5 Correct 1182 ms 48400 KB Output is correct
6 Correct 1159 ms 48444 KB Output is correct
7 Correct 1155 ms 48308 KB Output is correct
8 Correct 1149 ms 48488 KB Output is correct
9 Correct 1160 ms 48340 KB Output is correct
10 Correct 1174 ms 48384 KB Output is correct
11 Correct 1177 ms 48360 KB Output is correct
12 Correct 1157 ms 48500 KB Output is correct
13 Correct 1146 ms 48352 KB Output is correct
14 Correct 1159 ms 48476 KB Output is correct
15 Correct 1132 ms 48332 KB Output is correct
16 Correct 1132 ms 48264 KB Output is correct
17 Correct 1154 ms 48372 KB Output is correct
18 Correct 1183 ms 48292 KB Output is correct
19 Correct 292 ms 32212 KB Output is correct
20 Correct 1187 ms 48512 KB Output is correct
21 Correct 1179 ms 48320 KB Output is correct
22 Correct 260 ms 30140 KB Output is correct
23 Correct 290 ms 29996 KB Output is correct
24 Correct 263 ms 30044 KB Output is correct
25 Correct 257 ms 30100 KB Output is correct
26 Correct 305 ms 30088 KB Output is correct
27 Correct 313 ms 31916 KB Output is correct
28 Correct 267 ms 30140 KB Output is correct
29 Correct 302 ms 31272 KB Output is correct
30 Correct 260 ms 30256 KB Output is correct
31 Correct 303 ms 31276 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5624 KB Output is correct
2 Correct 13 ms 5752 KB Output is correct
3 Correct 12 ms 5756 KB Output is correct
4 Correct 6 ms 5624 KB Output is correct
5 Correct 12 ms 5800 KB Output is correct
6 Correct 12 ms 5752 KB Output is correct
7 Correct 7 ms 5624 KB Output is correct
8 Correct 7 ms 5624 KB Output is correct
9 Correct 12 ms 5880 KB Output is correct
10 Correct 13 ms 5796 KB Output is correct
11 Correct 12 ms 5880 KB Output is correct
12 Correct 12 ms 5880 KB Output is correct
13 Correct 12 ms 5752 KB Output is correct
14 Correct 12 ms 5880 KB Output is correct
15 Correct 12 ms 5880 KB Output is correct
16 Correct 766 ms 28736 KB Output is correct
17 Correct 1731 ms 53316 KB Output is correct
18 Correct 126 ms 10672 KB Output is correct
19 Correct 690 ms 32252 KB Output is correct
20 Correct 1696 ms 53996 KB Output is correct
21 Correct 1018 ms 37704 KB Output is correct
22 Correct 853 ms 34932 KB Output is correct
23 Correct 1804 ms 53900 KB Output is correct
24 Correct 1674 ms 53612 KB Output is correct
25 Correct 1654 ms 53168 KB Output is correct
26 Correct 696 ms 31988 KB Output is correct
27 Correct 676 ms 32172 KB Output is correct
28 Correct 666 ms 32004 KB Output is correct
29 Correct 674 ms 32076 KB Output is correct
30 Correct 681 ms 32220 KB Output is correct
31 Correct 7 ms 5628 KB Output is correct
32 Correct 7 ms 5624 KB Output is correct
33 Correct 7 ms 5624 KB Output is correct
34 Correct 6 ms 5624 KB Output is correct
35 Correct 7 ms 5624 KB Output is correct
36 Correct 7 ms 5624 KB Output is correct
37 Correct 7 ms 5568 KB Output is correct
38 Correct 7 ms 5624 KB Output is correct
39 Correct 7 ms 5624 KB Output is correct
40 Correct 7 ms 5624 KB Output is correct
41 Correct 525 ms 34164 KB Output is correct
42 Correct 1198 ms 48360 KB Output is correct
43 Correct 1195 ms 48340 KB Output is correct
44 Correct 304 ms 30640 KB Output is correct
45 Correct 1182 ms 48400 KB Output is correct
46 Correct 1159 ms 48444 KB Output is correct
47 Correct 1155 ms 48308 KB Output is correct
48 Correct 1149 ms 48488 KB Output is correct
49 Correct 1160 ms 48340 KB Output is correct
50 Correct 1174 ms 48384 KB Output is correct
51 Correct 1177 ms 48360 KB Output is correct
52 Correct 1157 ms 48500 KB Output is correct
53 Correct 1146 ms 48352 KB Output is correct
54 Correct 1159 ms 48476 KB Output is correct
55 Correct 1132 ms 48332 KB Output is correct
56 Correct 1132 ms 48264 KB Output is correct
57 Correct 1154 ms 48372 KB Output is correct
58 Correct 1183 ms 48292 KB Output is correct
59 Correct 292 ms 32212 KB Output is correct
60 Correct 1187 ms 48512 KB Output is correct
61 Correct 1179 ms 48320 KB Output is correct
62 Correct 260 ms 30140 KB Output is correct
63 Correct 290 ms 29996 KB Output is correct
64 Correct 263 ms 30044 KB Output is correct
65 Correct 257 ms 30100 KB Output is correct
66 Correct 305 ms 30088 KB Output is correct
67 Correct 313 ms 31916 KB Output is correct
68 Correct 267 ms 30140 KB Output is correct
69 Correct 302 ms 31272 KB Output is correct
70 Correct 260 ms 30256 KB Output is correct
71 Correct 303 ms 31276 KB Output is correct
72 Correct 1059 ms 38316 KB Output is correct
73 Correct 1718 ms 54220 KB Output is correct
74 Correct 1733 ms 48800 KB Output is correct
75 Correct 1710 ms 48768 KB Output is correct
76 Correct 1704 ms 48668 KB Output is correct
77 Correct 1675 ms 48824 KB Output is correct
78 Correct 1686 ms 48780 KB Output is correct
79 Correct 1712 ms 48808 KB Output is correct
80 Correct 1710 ms 48848 KB Output is correct
81 Correct 1674 ms 48732 KB Output is correct
82 Correct 1681 ms 48784 KB Output is correct
83 Correct 1698 ms 48748 KB Output is correct
84 Correct 1712 ms 48712 KB Output is correct
85 Correct 1643 ms 48744 KB Output is correct
86 Correct 1659 ms 48800 KB Output is correct
87 Correct 1652 ms 48836 KB Output is correct
88 Correct 1714 ms 48820 KB Output is correct
89 Correct 900 ms 32244 KB Output is correct
90 Correct 1682 ms 48736 KB Output is correct
91 Correct 1655 ms 48548 KB Output is correct
92 Correct 689 ms 30556 KB Output is correct
93 Correct 843 ms 30980 KB Output is correct
94 Correct 698 ms 30276 KB Output is correct
95 Correct 694 ms 30632 KB Output is correct
96 Correct 840 ms 30792 KB Output is correct
97 Correct 925 ms 31280 KB Output is correct
98 Correct 734 ms 30328 KB Output is correct
99 Correct 972 ms 32548 KB Output is correct
100 Correct 700 ms 30444 KB Output is correct