oj.uz

Submission #173856

# Submission time Handle Problem Language Result Execution time Memory
173856 2020-01-05T15:04:26 Z VEGAnn Evacuation plan (IZhO18_plan) C++14
100 / 100
 1802 ms 40908 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int, int>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
using namespace std;
const int oo = 2e9;
const int N = 100100;
vector<pii> g[N];
vector<int> qr[N];
set<pii> st;
int n, m, U[N], V[N], L[N], R[N], mid[N], pr[N], nm[N], dst[N], k, q;
bool mrk[N];

bool cmp(int x, int y){
    return dst[x] > dst[y];
}

int get(int x) { return (pr[x] == x ? x : pr[x] = get(pr[x])); }

void link(int x, int y){
    x = get(x); y = get(y);
    if (x != y)
        pr[x] = y;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for (int i = 0; i < m; i++){
        int x, y, w; cin >> x >> y >> w;
        x--; y--;
        g[x].PB(MP(y, w));
        g[y].PB(MP(x, w));
    }

    fill(dst, dst + n, oo);

    cin >> k;
    for (int i = 0; i < k; i++){
        int x; cin >> x;
        x--;
        dst[x] = 0;
        st.insert(MP(0, x));
    }

    while (sz(st)){
        int v = (*st.begin()).sd;
        st.erase(st.begin());

        for (pii u : g[v])
            if (dst[u.ft] > dst[v] + u.sd){
                st.erase(MP(dst[u.ft], u.ft));
                dst[u.ft] = dst[v] + u.sd;
                st.insert(MP(dst[u.ft], u.ft));
            }
    }

    for (int i = 0; i < n; i++)
        nm[i] = i;
    sort(nm, nm + n, cmp);

    cin >> q;
    for (int i = 0; i < q; i++){
        cin >> U[i] >> V[i];
        U[i]--; V[i]--;
        L[i] = 0; R[i] = n - 1;
    }

    for (bool was = 1; was;){
        was = 0;
        for (int i = 0; i < q; i++)
            if (L[i] < R[i]){
                mid[i] = (L[i] + R[i]) >> 1;
                qr[mid[i]].PB(i);
                was = 1;
            }

        for (int i = 0; i < n; i++){
            mrk[i] = 0;
            pr[i] = i;
        }

        for (int it = 0; it < n; it++){
            int v = nm[it];
            mrk[v] = 1;

            for (pii u : g[v])
                if (mrk[u.ft])
                    link(v, u.ft);

            if (sz(qr[it])){
                for (int nm : qr[it])
                    if (get(U[nm]) == get(V[nm]))
                        R[nm] = mid[nm];
                    else L[nm] = mid[nm] + 1;

                qr[it].clear();
            }
        }
    }

    for (int i = 0; i < q; i++)
        cout << dst[nm[L[i]]] << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5240 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5212 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 8 ms 5252 KB Output is correct
12 Correct 8 ms 5240 KB Output is correct
13 Correct 10 ms 5240 KB Output is correct
14 Correct 8 ms 5240 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5240 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5212 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 8 ms 5252 KB Output is correct
12 Correct 8 ms 5240 KB Output is correct
13 Correct 10 ms 5240 KB Output is correct
14 Correct 8 ms 5240 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 670 ms 24464 KB Output is correct
17 Correct 1802 ms 38608 KB Output is correct
18 Correct 80 ms 8364 KB Output is correct
19 Correct 281 ms 23764 KB Output is correct
20 Correct 1682 ms 36360 KB Output is correct
21 Correct 964 ms 28336 KB Output is correct
22 Correct 483 ms 25324 KB Output is correct
23 Correct 1662 ms 36644 KB Output is correct
24 Correct 1684 ms 36744 KB Output is correct
25 Correct 1638 ms 38248 KB Output is correct
26 Correct 279 ms 23656 KB Output is correct
27 Correct 268 ms 24088 KB Output is correct
28 Correct 291 ms 24128 KB Output is correct
29 Correct 267 ms 23480 KB Output is correct
30 Correct 262 ms 23704 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 8 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 7 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 799 ms 17936 KB Output is correct
2 Correct 1343 ms 30592 KB Output is correct
3 Correct 1495 ms 30556 KB Output is correct
4 Correct 286 ms 11228 KB Output is correct
5 Correct 1409 ms 30600 KB Output is correct
6 Correct 1343 ms 30456 KB Output is correct
7 Correct 1365 ms 30408 KB Output is correct
8 Correct 1326 ms 30576 KB Output is correct
9 Correct 1388 ms 30608 KB Output is correct
10 Correct 1404 ms 30640 KB Output is correct
11 Correct 1376 ms 30584 KB Output is correct
12 Correct 1378 ms 30712 KB Output is correct
13 Correct 1384 ms 25192 KB Output is correct
14 Correct 1501 ms 25144 KB Output is correct
15 Correct 1333 ms 25208 KB Output is correct
16 Correct 1352 ms 25352 KB Output is correct
17 Correct 1389 ms 25208 KB Output is correct
18 Correct 1400 ms 25244 KB Output is correct
19 Correct 282 ms 11256 KB Output is correct
20 Correct 1356 ms 25228 KB Output is correct
21 Correct 1176 ms 25784 KB Output is correct
22 Correct 194 ms 18152 KB Output is correct
23 Correct 229 ms 11640 KB Output is correct
24 Correct 201 ms 17256 KB Output is correct
25 Correct 205 ms 17992 KB Output is correct
26 Correct 276 ms 12024 KB Output is correct
27 Correct 453 ms 11148 KB Output is correct
28 Correct 198 ms 17340 KB Output is correct
29 Correct 302 ms 11176 KB Output is correct
30 Correct 186 ms 17256 KB Output is correct
31 Correct 309 ms 11144 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 8 ms 5240 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 8 ms 5240 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 8 ms 5212 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 8 ms 5252 KB Output is correct
12 Correct 8 ms 5240 KB Output is correct
13 Correct 10 ms 5240 KB Output is correct
14 Correct 8 ms 5240 KB Output is correct
15 Correct 8 ms 5240 KB Output is correct
16 Correct 670 ms 24464 KB Output is correct
17 Correct 1802 ms 38608 KB Output is correct
18 Correct 80 ms 8364 KB Output is correct
19 Correct 281 ms 23764 KB Output is correct
20 Correct 1682 ms 36360 KB Output is correct
21 Correct 964 ms 28336 KB Output is correct
22 Correct 483 ms 25324 KB Output is correct
23 Correct 1662 ms 36644 KB Output is correct
24 Correct 1684 ms 36744 KB Output is correct
25 Correct 1638 ms 38248 KB Output is correct
26 Correct 279 ms 23656 KB Output is correct
27 Correct 268 ms 24088 KB Output is correct
28 Correct 291 ms 24128 KB Output is correct
29 Correct 267 ms 23480 KB Output is correct
30 Correct 262 ms 23704 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 5116 KB Output is correct
35 Correct 6 ms 5112 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 8 ms 5112 KB Output is correct
38 Correct 6 ms 5112 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 6 ms 5112 KB Output is correct
41 Correct 799 ms 17936 KB Output is correct
42 Correct 1343 ms 30592 KB Output is correct
43 Correct 1495 ms 30556 KB Output is correct
44 Correct 286 ms 11228 KB Output is correct
45 Correct 1409 ms 30600 KB Output is correct
46 Correct 1343 ms 30456 KB Output is correct
47 Correct 1365 ms 30408 KB Output is correct
48 Correct 1326 ms 30576 KB Output is correct
49 Correct 1388 ms 30608 KB Output is correct
50 Correct 1404 ms 30640 KB Output is correct
51 Correct 1376 ms 30584 KB Output is correct
52 Correct 1378 ms 30712 KB Output is correct
53 Correct 1384 ms 25192 KB Output is correct
54 Correct 1501 ms 25144 KB Output is correct
55 Correct 1333 ms 25208 KB Output is correct
56 Correct 1352 ms 25352 KB Output is correct
57 Correct 1389 ms 25208 KB Output is correct
58 Correct 1400 ms 25244 KB Output is correct
59 Correct 282 ms 11256 KB Output is correct
60 Correct 1356 ms 25228 KB Output is correct
61 Correct 1176 ms 25784 KB Output is correct
62 Correct 194 ms 18152 KB Output is correct
63 Correct 229 ms 11640 KB Output is correct
64 Correct 201 ms 17256 KB Output is correct
65 Correct 205 ms 17992 KB Output is correct
66 Correct 276 ms 12024 KB Output is correct
67 Correct 453 ms 11148 KB Output is correct
68 Correct 198 ms 17340 KB Output is correct
69 Correct 302 ms 11176 KB Output is correct
70 Correct 186 ms 17256 KB Output is correct
71 Correct 309 ms 11144 KB Output is correct
72 Correct 1121 ms 27324 KB Output is correct
73 Correct 1710 ms 33940 KB Output is correct
74 Correct 1629 ms 34092 KB Output is correct
75 Correct 1632 ms 33716 KB Output is correct
76 Correct 1680 ms 33840 KB Output is correct
77 Correct 1676 ms 33824 KB Output is correct
78 Correct 1678 ms 33884 KB Output is correct
79 Correct 1678 ms 33716 KB Output is correct
80 Correct 1706 ms 33972 KB Output is correct
81 Correct 1667 ms 33720 KB Output is correct
82 Correct 1648 ms 33780 KB Output is correct
83 Correct 1648 ms 33992 KB Output is correct
84 Correct 1629 ms 33816 KB Output is correct
85 Correct 1642 ms 34380 KB Output is correct
86 Correct 1643 ms 36548 KB Output is correct
87 Correct 1634 ms 39084 KB Output is correct
88 Correct 1643 ms 40056 KB Output is correct
89 Correct 440 ms 25456 KB Output is correct
90 Correct 1629 ms 40784 KB Output is correct
91 Correct 1393 ms 40908 KB Output is correct
92 Correct 273 ms 23932 KB Output is correct
93 Correct 450 ms 24004 KB Output is correct
94 Correct 296 ms 23916 KB Output is correct
95 Correct 284 ms 23812 KB Output is correct
96 Correct 446 ms 22148 KB Output is correct
97 Correct 466 ms 24020 KB Output is correct
98 Correct 369 ms 24392 KB Output is correct
99 Correct 501 ms 24048 KB Output is correct
100 Correct 319 ms 23708 KB Output is correct