oj.uz

Submission #162896

# Submission time Handle Problem Language Result Execution time Memory
162896 2019-11-10T08:42:50 Z mrboorger Evacuation plan (IZhO18_plan) C++14
100 / 100
 688 ms 30384 KB 
//#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define sqr(x) (x) * (x)

using namespace std;
using namespace __gnu_pbds;

const int maxn = 1e5 + 2;
const int inf = 1e9 + 33333;
const int rt = 1e9;

struct DSU
{
    int boss[maxn];
    int rnk[maxn];
    DSU()
    {
        for(int i = 0; i < maxn; ++i)
        {
            boss[i] = i;
            rnk[i] = 1;
        }
    }
    void clear()
    {
        for(int i = 0; i < maxn; ++i)
        {
            boss[i] = i;
            rnk[i] = 1;
        }
        return;
    }
    int get(int x)
    {
        if (boss[x] == x) return x;
        return boss[x] = get(boss[x]);
    }
    void unite(int x, int y)
    {
        x = get(x);
        y = get(y);
        if (x == y) return;
        if (boss[y] > boss[x]) swap(x, y);
        rnk[x] += rnk[y];
        boss[y] = boss[x];
        return;
    }
};

struct zapros
{
    int num, x, y;
    zapros(int a, int b, int c)
    {
        num = a;
        x = b;
        y = c;
    }
};

vector <pair <int, int>> g[maxn];
vector <pair <int, pair <int, int>>> e;
int d[maxn];
int mid;
DSU snm;
int otv[maxn * 5];

int main()
{
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; ++i)
    {
        int x, y, z;
        cin >> x >> y >> z;
        --x;
        --y;
        e.pb({z, {x, y}});
        g[x].pb({y, z});
        g[y].pb({x, z});
    }
    fill(d, d + n, inf);
    priority_queue <pair <int, int>, vector <pair <int, int>>, greater<pair <int, int>>> q;
    int k;
    cin >> k;
    for(int i = 0; i < k; ++i)
    {
        int x;
        cin >> x;
        --x;
        d[x] = 0;
        q.push({0, x});
    }
    while(!q.empty())
    {
        int val = q.top().F;
        int v = q.top().S;
        q.pop();
        if (val > d[v]) continue;
        for(pair <int, int> to : g[v])
        {
            if (d[to.F] > val + to.S)
            {
                d[to.F] = val + to.S;
                q.push({val + to.S, to.F});
            }
        }
    }

    for(int i = 0; i < m; ++i)
        e[i].F = min(d[e[i].S.F], d[e[i].S.S]);
    sort(e.rbegin(), e.rend());

    int Q;
    cin >> Q;
    queue <pair <int, int>> ql;
    queue <vector <zapros>> qv;
    vector <zapros> cl;
    ql.push({0, rt});
    qv.push(cl);
    for(int ii = 0; ii < Q; ++ii)
    {
        int x, y;
        cin >> x >> y;
        --x;
        --y;
        qv.front().pb(zapros(ii, x, y));
    }


    int R = rt;
    int uk = 0;
    while(!ql.empty())
    {
        if (qv.front().size() == 0)
        {
            ql.pop();
            qv.pop();
            continue;
        }
        int l = ql.front().F, r = ql.front().S;
        mid = (l + r) / 2;
        if (mid > R)
        {
            uk = 0;
            snm.clear();
        }

        while(uk < m && e[uk].F >= mid)
        {
            snm.unite(e[uk].S.F, e[uk].S.S);
            ++uk;
        }
        vector <zapros> lft;
        vector <zapros> rht;

        for(int i = 0; i < int(qv.front().size()); ++i)
        {
            int x = qv.front()[i].x;
            int y = qv.front()[i].y;
            int num = qv.front()[i].num;
            if (snm.get(x) == snm.get(y))
            {
                otv[num] = max(otv[num], mid);
                rht.pb(qv.front()[i]);
            }
            else
            {
                lft.pb(qv.front()[i]);
            }
        }

        ql.pop();
        qv.pop();
        R = mid;
        if (l < r)
        {
            ql.push({mid + 1, r});
            qv.push(rht);
            ql.push({l, mid - 1});
            qv.push(lft);
        }
    }


    for(int i = 0; i < Q; ++i)
        cout << otv[i] << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3448 KB Output is correct
2 Correct 8 ms 3576 KB Output is correct
3 Correct 7 ms 3572 KB Output is correct
4 Correct 6 ms 3448 KB Output is correct
5 Correct 6 ms 3576 KB Output is correct
6 Correct 6 ms 3588 KB Output is correct
7 Correct 6 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3572 KB Output is correct
10 Correct 8 ms 3576 KB Output is correct
11 Correct 9 ms 3576 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 9 ms 3580 KB Output is correct
14 Correct 10 ms 3576 KB Output is correct
15 Correct 9 ms 3576 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3448 KB Output is correct
2 Correct 8 ms 3576 KB Output is correct
3 Correct 7 ms 3572 KB Output is correct
4 Correct 6 ms 3448 KB Output is correct
5 Correct 6 ms 3576 KB Output is correct
6 Correct 6 ms 3588 KB Output is correct
7 Correct 6 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3572 KB Output is correct
10 Correct 8 ms 3576 KB Output is correct
11 Correct 9 ms 3576 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 9 ms 3580 KB Output is correct
14 Correct 10 ms 3576 KB Output is correct
15 Correct 9 ms 3576 KB Output is correct
16 Correct 256 ms 13180 KB Output is correct
17 Correct 668 ms 30192 KB Output is correct
18 Correct 52 ms 5968 KB Output is correct
19 Correct 217 ms 14404 KB Output is correct
20 Correct 674 ms 30228 KB Output is correct
21 Correct 314 ms 18236 KB Output is correct
22 Correct 441 ms 19336 KB Output is correct
23 Correct 680 ms 30104 KB Output is correct
24 Correct 665 ms 30144 KB Output is correct
25 Correct 649 ms 29992 KB Output is correct
26 Correct 210 ms 14000 KB Output is correct
27 Correct 214 ms 14412 KB Output is correct
28 Correct 209 ms 14064 KB Output is correct
29 Correct 215 ms 14152 KB Output is correct
30 Correct 219 ms 14408 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 13640 KB Output is correct
2 Correct 524 ms 25928 KB Output is correct
3 Correct 506 ms 26052 KB Output is correct
4 Correct 88 ms 8104 KB Output is correct
5 Correct 523 ms 25836 KB Output is correct
6 Correct 498 ms 25752 KB Output is correct
7 Correct 540 ms 25884 KB Output is correct
8 Correct 519 ms 25752 KB Output is correct
9 Correct 550 ms 25832 KB Output is correct
10 Correct 525 ms 25752 KB Output is correct
11 Correct 534 ms 25756 KB Output is correct
12 Correct 538 ms 25780 KB Output is correct
13 Correct 540 ms 25788 KB Output is correct
14 Correct 500 ms 25852 KB Output is correct
15 Correct 519 ms 26892 KB Output is correct
16 Correct 516 ms 25752 KB Output is correct
17 Correct 513 ms 25860 KB Output is correct
18 Correct 524 ms 25752 KB Output is correct
19 Correct 69 ms 8108 KB Output is correct
20 Correct 529 ms 25796 KB Output is correct
21 Correct 481 ms 25456 KB Output is correct
22 Correct 102 ms 10784 KB Output is correct
23 Correct 125 ms 8760 KB Output is correct
24 Correct 102 ms 10848 KB Output is correct
25 Correct 106 ms 10712 KB Output is correct
26 Correct 103 ms 8876 KB Output is correct
27 Correct 87 ms 8108 KB Output is correct
28 Correct 103 ms 10784 KB Output is correct
29 Correct 91 ms 8224 KB Output is correct
30 Correct 104 ms 10780 KB Output is correct
31 Correct 91 ms 8236 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3448 KB Output is correct
2 Correct 8 ms 3576 KB Output is correct
3 Correct 7 ms 3572 KB Output is correct
4 Correct 6 ms 3448 KB Output is correct
5 Correct 6 ms 3576 KB Output is correct
6 Correct 6 ms 3588 KB Output is correct
7 Correct 6 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3572 KB Output is correct
10 Correct 8 ms 3576 KB Output is correct
11 Correct 9 ms 3576 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 9 ms 3580 KB Output is correct
14 Correct 10 ms 3576 KB Output is correct
15 Correct 9 ms 3576 KB Output is correct
16 Correct 256 ms 13180 KB Output is correct
17 Correct 668 ms 30192 KB Output is correct
18 Correct 52 ms 5968 KB Output is correct
19 Correct 217 ms 14404 KB Output is correct
20 Correct 674 ms 30228 KB Output is correct
21 Correct 314 ms 18236 KB Output is correct
22 Correct 441 ms 19336 KB Output is correct
23 Correct 680 ms 30104 KB Output is correct
24 Correct 665 ms 30144 KB Output is correct
25 Correct 649 ms 29992 KB Output is correct
26 Correct 210 ms 14000 KB Output is correct
27 Correct 214 ms 14412 KB Output is correct
28 Correct 209 ms 14064 KB Output is correct
29 Correct 215 ms 14152 KB Output is correct
30 Correct 219 ms 14408 KB Output is correct
31 Correct 7 ms 3448 KB Output is correct
32 Correct 6 ms 3448 KB Output is correct
33 Correct 7 ms 3448 KB Output is correct
34 Correct 6 ms 3448 KB Output is correct
35 Correct 6 ms 3528 KB Output is correct
36 Correct 6 ms 3448 KB Output is correct
37 Correct 6 ms 3448 KB Output is correct
38 Correct 5 ms 3448 KB Output is correct
39 Correct 5 ms 3448 KB Output is correct
40 Correct 6 ms 3448 KB Output is correct
41 Correct 235 ms 13640 KB Output is correct
42 Correct 524 ms 25928 KB Output is correct
43 Correct 506 ms 26052 KB Output is correct
44 Correct 88 ms 8104 KB Output is correct
45 Correct 523 ms 25836 KB Output is correct
46 Correct 498 ms 25752 KB Output is correct
47 Correct 540 ms 25884 KB Output is correct
48 Correct 519 ms 25752 KB Output is correct
49 Correct 550 ms 25832 KB Output is correct
50 Correct 525 ms 25752 KB Output is correct
51 Correct 534 ms 25756 KB Output is correct
52 Correct 538 ms 25780 KB Output is correct
53 Correct 540 ms 25788 KB Output is correct
54 Correct 500 ms 25852 KB Output is correct
55 Correct 519 ms 26892 KB Output is correct
56 Correct 516 ms 25752 KB Output is correct
57 Correct 513 ms 25860 KB Output is correct
58 Correct 524 ms 25752 KB Output is correct
59 Correct 69 ms 8108 KB Output is correct
60 Correct 529 ms 25796 KB Output is correct
61 Correct 481 ms 25456 KB Output is correct
62 Correct 102 ms 10784 KB Output is correct
63 Correct 125 ms 8760 KB Output is correct
64 Correct 102 ms 10848 KB Output is correct
65 Correct 106 ms 10712 KB Output is correct
66 Correct 103 ms 8876 KB Output is correct
67 Correct 87 ms 8108 KB Output is correct
68 Correct 103 ms 10784 KB Output is correct
69 Correct 91 ms 8224 KB Output is correct
70 Correct 104 ms 10780 KB Output is correct
71 Correct 91 ms 8236 KB Output is correct
72 Correct 374 ms 18164 KB Output is correct
73 Correct 665 ms 30132 KB Output is correct
74 Correct 678 ms 30084 KB Output is correct
75 Correct 636 ms 30224 KB Output is correct
76 Correct 672 ms 30132 KB Output is correct
77 Correct 658 ms 30092 KB Output is correct
78 Correct 651 ms 30224 KB Output is correct
79 Correct 666 ms 30024 KB Output is correct
80 Correct 688 ms 30084 KB Output is correct
81 Correct 669 ms 30120 KB Output is correct
82 Correct 651 ms 30132 KB Output is correct
83 Correct 634 ms 30108 KB Output is correct
84 Correct 640 ms 30104 KB Output is correct
85 Correct 656 ms 30384 KB Output is correct
86 Correct 638 ms 30120 KB Output is correct
87 Correct 675 ms 30056 KB Output is correct
88 Correct 662 ms 30208 KB Output is correct
89 Correct 434 ms 15652 KB Output is correct
90 Correct 643 ms 30160 KB Output is correct
91 Correct 547 ms 29656 KB Output is correct
92 Correct 219 ms 14068 KB Output is correct
93 Correct 343 ms 13108 KB Output is correct
94 Correct 209 ms 14036 KB Output is correct
95 Correct 217 ms 14176 KB Output is correct
96 Correct 312 ms 13140 KB Output is correct
97 Correct 367 ms 14792 KB Output is correct
98 Correct 210 ms 14028 KB Output is correct
99 Correct 350 ms 14824 KB Output is correct
100 Correct 224 ms 14064 KB Output is correct