oj.uz

Submission #90273

# Submission time Handle Problem Language Result Execution time Memory
90273 2018-12-21T04:00:45 Z HardNut Evacuation plan (IZhO18_plan) C++17
100 / 100
 1184 ms 53544 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;
const long long INF = 1e9 + 5;
const int MAXN = 1e6;
const int base = 317;

typedef long long ll;

const ll bs = 1e5 + 1;
const ll mod = 998244353;

int n, m, up[21][N], res[21][N];
int dep[N], d[N], p[N], u[N], v[N];
vector <pair<int, int>> g[N];
vector <pair<int, pair<int, int>>> gr;
vector <int> gg[N];

void dfs(int v, int p = 0) {
    up[0][v] = p;
    res[0][v] = min(d[v], d[p]);
    for (int i = 1; i <= 20; i++) {
        up[i][v] = up[i - 1][up[i - 1][v]];
        res[i][v] = min(res[i - 1][v], res[i - 1][up[i - 1][v]]);
    }
    dep[v] = dep[p] + 1;
    for (auto to : gg[v]) {
        if (to != p)
            dfs(to, v);
    }
}

int ans(int u, int v) {
    if (dep[u] > dep[v])
        swap(u, v);
    int rs = INF;
    for (int i = 20; i >= 0; i--) {
        if (dep[u] <= dep[up[i][v]]) {
            rs = min(rs, res[i][v]);
            v = up[i][v];
        }
    }
    if (v == u)
        return rs;
    for (int i = 20; i >= 0; i--) {
        if (up[i][v] != up[i][u]) {
            rs = min(rs, res[i][v]);
            rs = min(rs, res[i][u]);
            v = up[i][v];
            u = up[i][u];
        }
    }
    return min(rs, min(res[0][v], res[0][u]));
}

int get(int v) {
    if (v == p[v])
        return v;
    return p[v] = get(p[v]);
}

void unite(int u, int v) {
    u = get(u);
    v = get(v);
    p[u] = v;
}

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int w;
        cin >> u[i] >> v[i] >> w;
        g[u[i]].push_back({v[i], w});
        g[v[i]].push_back({u[i], w});
    }
    int k;
    cin >> k;
    set <pair<int, int>> st;
    for (int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    for (int i = 1; i <= k; i++) {
        int v;
        cin >> v;
        st.insert({0, v});
        d[v] = 0;
    }
    while (!st.empty()) {
        int v = (*st.begin()).second;
        st.erase(st.begin());
        for (auto it : g[v]) {
            int to = it.first, w = it.second;
            if (d[to] > d[v] + w) {
                st.erase({d[to], to});
                d[to] = d[v] + w;
                st.insert({d[to], to});
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        p[i] = i;
    }
    for (int i = 1; i <= n; i++) {
        p[i] = i;
        for (int j = 0; j < g[i].size(); j++) {
            gr.push_back({min(d[g[i][j].first], d[i]), {i, g[i][j].first}});
        }
    }
    sort(gr.rbegin(), gr.rend());
    for (int i = 0; i < gr.size(); i++) {
        int v = gr[i].second.first, u = gr[i].second.second;
        if (get(v) != get(u)) {
            gg[u].push_back(v);
            gg[v].push_back(u);
            unite(v, u);
        }
    }
    for (int i = 0; i <= 20; i++) {
        for (int j = 0; j <= n; j++)
            res[i][j] = INF;
    }
    d[0] = INF;
    dfs(1);
    int q;
    cin >> q;
    while (q--) {
        int a, b;
        cin >> a >> b;
        cout << ans(a, b) << "\n";
    }
    return 0;
}
/*

*/

Compilation message

plan.cpp:70:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
plan.cpp: In function 'int main()':
plan.cpp:109:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < g[i].size(); j++) {
                         ~~^~~~~~~~~~~~~
plan.cpp:114:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < gr.size(); i++) {
                     ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5244 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 6 ms 5240 KB Output is correct
5 Correct 7 ms 5496 KB Output is correct
6 Correct 7 ms 5624 KB Output is correct
7 Correct 7 ms 5368 KB Output is correct
8 Correct 6 ms 5240 KB Output is correct
9 Correct 8 ms 5624 KB Output is correct
10 Correct 5 ms 5624 KB Output is correct
11 Correct 8 ms 5496 KB Output is correct
12 Correct 8 ms 5496 KB Output is correct
13 Correct 8 ms 5496 KB Output is correct
14 Correct 8 ms 5496 KB Output is correct
15 Correct 8 ms 5496 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5244 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 6 ms 5240 KB Output is correct
5 Correct 7 ms 5496 KB Output is correct
6 Correct 7 ms 5624 KB Output is correct
7 Correct 7 ms 5368 KB Output is correct
8 Correct 6 ms 5240 KB Output is correct
9 Correct 8 ms 5624 KB Output is correct
10 Correct 5 ms 5624 KB Output is correct
11 Correct 8 ms 5496 KB Output is correct
12 Correct 8 ms 5496 KB Output is correct
13 Correct 8 ms 5496 KB Output is correct
14 Correct 8 ms 5496 KB Output is correct
15 Correct 8 ms 5496 KB Output is correct
16 Correct 360 ms 28380 KB Output is correct
17 Correct 1058 ms 51500 KB Output is correct
18 Correct 69 ms 10268 KB Output is correct
19 Correct 244 ms 34392 KB Output is correct
20 Correct 1178 ms 51808 KB Output is correct
21 Correct 578 ms 37284 KB Output is correct
22 Correct 363 ms 37656 KB Output is correct
23 Correct 1184 ms 51604 KB Output is correct
24 Correct 1079 ms 51448 KB Output is correct
25 Correct 1100 ms 51444 KB Output is correct
26 Correct 244 ms 34492 KB Output is correct
27 Correct 232 ms 34488 KB Output is correct
28 Correct 246 ms 33808 KB Output is correct
29 Correct 246 ms 34436 KB Output is correct
30 Correct 239 ms 34464 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5240 KB Output is correct
3 Correct 6 ms 5244 KB Output is correct
4 Correct 6 ms 5240 KB Output is correct
5 Correct 6 ms 5212 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 5240 KB Output is correct
9 Correct 6 ms 5240 KB Output is correct
10 Correct 6 ms 5268 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 37128 KB Output is correct
2 Correct 965 ms 51092 KB Output is correct
3 Correct 987 ms 52836 KB Output is correct
4 Correct 318 ms 36092 KB Output is correct
5 Correct 1002 ms 52848 KB Output is correct
6 Correct 950 ms 52560 KB Output is correct
7 Correct 937 ms 52372 KB Output is correct
8 Correct 1002 ms 52528 KB Output is correct
9 Correct 945 ms 52492 KB Output is correct
10 Correct 1014 ms 52524 KB Output is correct
11 Correct 981 ms 52168 KB Output is correct
12 Correct 997 ms 52576 KB Output is correct
13 Correct 991 ms 52784 KB Output is correct
14 Correct 977 ms 52788 KB Output is correct
15 Correct 946 ms 52568 KB Output is correct
16 Correct 916 ms 52672 KB Output is correct
17 Correct 887 ms 52660 KB Output is correct
18 Correct 910 ms 52592 KB Output is correct
19 Correct 283 ms 37364 KB Output is correct
20 Correct 1038 ms 52968 KB Output is correct
21 Correct 890 ms 52788 KB Output is correct
22 Correct 189 ms 34696 KB Output is correct
23 Correct 344 ms 34160 KB Output is correct
24 Correct 191 ms 35060 KB Output is correct
25 Correct 186 ms 34320 KB Output is correct
26 Correct 319 ms 34248 KB Output is correct
27 Correct 295 ms 37188 KB Output is correct
28 Correct 189 ms 35124 KB Output is correct
29 Correct 303 ms 36572 KB Output is correct
30 Correct 195 ms 36024 KB Output is correct
31 Correct 296 ms 36684 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5244 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 6 ms 5240 KB Output is correct
5 Correct 7 ms 5496 KB Output is correct
6 Correct 7 ms 5624 KB Output is correct
7 Correct 7 ms 5368 KB Output is correct
8 Correct 6 ms 5240 KB Output is correct
9 Correct 8 ms 5624 KB Output is correct
10 Correct 5 ms 5624 KB Output is correct
11 Correct 8 ms 5496 KB Output is correct
12 Correct 8 ms 5496 KB Output is correct
13 Correct 8 ms 5496 KB Output is correct
14 Correct 8 ms 5496 KB Output is correct
15 Correct 8 ms 5496 KB Output is correct
16 Correct 360 ms 28380 KB Output is correct
17 Correct 1058 ms 51500 KB Output is correct
18 Correct 69 ms 10268 KB Output is correct
19 Correct 244 ms 34392 KB Output is correct
20 Correct 1178 ms 51808 KB Output is correct
21 Correct 578 ms 37284 KB Output is correct
22 Correct 363 ms 37656 KB Output is correct
23 Correct 1184 ms 51604 KB Output is correct
24 Correct 1079 ms 51448 KB Output is correct
25 Correct 1100 ms 51444 KB Output is correct
26 Correct 244 ms 34492 KB Output is correct
27 Correct 232 ms 34488 KB Output is correct
28 Correct 246 ms 33808 KB Output is correct
29 Correct 246 ms 34436 KB Output is correct
30 Correct 239 ms 34464 KB Output is correct
31 Correct 6 ms 5240 KB Output is correct
32 Correct 6 ms 5240 KB Output is correct
33 Correct 6 ms 5244 KB Output is correct
34 Correct 6 ms 5240 KB Output is correct
35 Correct 6 ms 5212 KB Output is correct
36 Correct 6 ms 5240 KB Output is correct
37 Correct 6 ms 5240 KB Output is correct
38 Correct 6 ms 5240 KB Output is correct
39 Correct 6 ms 5240 KB Output is correct
40 Correct 6 ms 5268 KB Output is correct
41 Correct 484 ms 37128 KB Output is correct
42 Correct 965 ms 51092 KB Output is correct
43 Correct 987 ms 52836 KB Output is correct
44 Correct 318 ms 36092 KB Output is correct
45 Correct 1002 ms 52848 KB Output is correct
46 Correct 950 ms 52560 KB Output is correct
47 Correct 937 ms 52372 KB Output is correct
48 Correct 1002 ms 52528 KB Output is correct
49 Correct 945 ms 52492 KB Output is correct
50 Correct 1014 ms 52524 KB Output is correct
51 Correct 981 ms 52168 KB Output is correct
52 Correct 997 ms 52576 KB Output is correct
53 Correct 991 ms 52784 KB Output is correct
54 Correct 977 ms 52788 KB Output is correct
55 Correct 946 ms 52568 KB Output is correct
56 Correct 916 ms 52672 KB Output is correct
57 Correct 887 ms 52660 KB Output is correct
58 Correct 910 ms 52592 KB Output is correct
59 Correct 283 ms 37364 KB Output is correct
60 Correct 1038 ms 52968 KB Output is correct
61 Correct 890 ms 52788 KB Output is correct
62 Correct 189 ms 34696 KB Output is correct
63 Correct 344 ms 34160 KB Output is correct
64 Correct 191 ms 35060 KB Output is correct
65 Correct 186 ms 34320 KB Output is correct
66 Correct 319 ms 34248 KB Output is correct
67 Correct 295 ms 37188 KB Output is correct
68 Correct 189 ms 35124 KB Output is correct
69 Correct 303 ms 36572 KB Output is correct
70 Correct 195 ms 36024 KB Output is correct
71 Correct 296 ms 36684 KB Output is correct
72 Correct 614 ms 39184 KB Output is correct
73 Correct 1008 ms 53544 KB Output is correct
74 Correct 1042 ms 53260 KB Output is correct
75 Correct 1092 ms 52232 KB Output is correct
76 Correct 1130 ms 51812 KB Output is correct
77 Correct 1123 ms 52140 KB Output is correct
78 Correct 1091 ms 52272 KB Output is correct
79 Correct 1104 ms 51912 KB Output is correct
80 Correct 1089 ms 52128 KB Output is correct
81 Correct 1087 ms 52260 KB Output is correct
82 Correct 1110 ms 52332 KB Output is correct
83 Correct 1155 ms 52112 KB Output is correct
84 Correct 1056 ms 52104 KB Output is correct
85 Correct 1080 ms 52444 KB Output is correct
86 Correct 1059 ms 52432 KB Output is correct
87 Correct 1091 ms 52140 KB Output is correct
88 Correct 1033 ms 52288 KB Output is correct
89 Correct 411 ms 37220 KB Output is correct
90 Correct 1066 ms 51808 KB Output is correct
91 Correct 962 ms 51380 KB Output is correct
92 Correct 253 ms 33876 KB Output is correct
93 Correct 408 ms 34160 KB Output is correct
94 Correct 255 ms 34900 KB Output is correct
95 Correct 246 ms 34164 KB Output is correct
96 Correct 417 ms 33988 KB Output is correct
97 Correct 451 ms 35828 KB Output is correct
98 Correct 249 ms 34708 KB Output is correct
99 Correct 425 ms 37108 KB Output is correct
100 Correct 244 ms 34612 KB Output is correct