oj.uz

Submission #951164

# Submission time Handle Problem Language Result Execution time Memory
951164 2024-03-21T09:33:05 Z LOLOLO Evacuation plan (IZhO18_plan) C++14
100 / 100
 774 ms 94396 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 5e5 + 100;
vector <pair <int, int>> ed[N];
int f[N], used[N], sz[N], p[N], cnt[N], ans[N];
vector <pair <int, int>> edge;
vector < vector <int>> save;
stack <pair <int, int>> st;

int get(int a) {
    return p[a] ? get(p[a]) : a;
}

void unite(int a, int b) {
    a = get(a), b = get(b);
    if (a == b)
        return;

    if (sz[a] < sz[b])
        swap(a, b);

    st.push({a, b});
    sz[a] += sz[b];
    p[b] = a;
} 

bool same(int a, int b) {
    return get(a) == get(b);
}

void rollback(int tt) {
    while (sz(st) > tt) {
        pair <int, int> t = st.top();
        st.pop();
        sz[t.f] -= sz[t.s];
        p[t.s] = 0;
    }
}

int cur = -1;
void move(int l) {
    while (cur < l) {
        cur++;
        unite(save[cur][1], save[cur][2]);
        cnt[cur] = sz(st);
    }

    while (cur > l) {
        cur = l;
        rollback(cnt[l]);
    }
}

void bin(int l, int r, vector < vector <int>> &ask) {
    if (l > r || ask.empty())
        return;

    int m = (l + r)  / 2;
    move(m);
    vector < vector <int>> win, lose;
    for (auto x : ask) {
        if (same(x[0], x[1])) {
            ans[x[2]] = save[m][0];
            win.pb(x);
        } else {
            lose.pb(x);
        }
    }

    ask.clear();
    bin(l, m - 1, win);
    bin(m + 1, r, lose);
}

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

    mem(f, 0x3f);

    int n, m;
    cin >> n >> m;

    fill(sz + 1, sz + 1 + n, 1);

    for (int i = 1; i <= m; i++) {
        int a, b, w;
        cin >> a >> b >> w;
        ed[a].pb({b, w});
        ed[b].pb({a, w});
        edge.pb({a, b});
    }

    priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> pq;

    int k;
    cin >> k;

    for (int i = 0; i < k; i++) {
        int x;
        cin >> x;
        f[x] = 0;
        pq.push({0, x});
    }

    while (sz(pq)) {
        auto t = pq.top();
        pq.pop();
        if (f[t.s] < t.f)
            continue;

        for (auto x : ed[t.s]) {
            if (f[x.f] > x.s + t.f) {
                f[x.f] = x.s + t.f;
                pq.push({f[x.f], x.f});
            }
        }
    }

    for (auto x : edge) {
        save.pb({min(f[x.f], f[x.s]), x.f, x.s});
    }

    sort(all(save), greater < vector <int>>());
    
    int q;
    cin >> q;

    vector < vector <int>> ask;
    for (int i = 0; i < q; i++) {
        int s, t;
        cin >> s >> t;
        ask.pb({s, t, i});
    }

    bin(0, m - 1, ask);
    for (int i = 0; i < q; i++)
        cout << ans[i] << '\n';

    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

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19548 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 6 ms 19804 KB Output is correct
4 Correct 4 ms 19684 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19800 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 4 ms 19544 KB Output is correct
9 Correct 6 ms 19804 KB Output is correct
10 Correct 6 ms 19800 KB Output is correct
11 Correct 7 ms 19928 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 7 ms 19928 KB Output is correct
14 Correct 6 ms 19804 KB Output is correct
15 Correct 5 ms 19804 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19548 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 6 ms 19804 KB Output is correct
4 Correct 4 ms 19684 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19800 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 4 ms 19544 KB Output is correct
9 Correct 6 ms 19804 KB Output is correct
10 Correct 6 ms 19800 KB Output is correct
11 Correct 7 ms 19928 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 7 ms 19928 KB Output is correct
14 Correct 6 ms 19804 KB Output is correct
15 Correct 5 ms 19804 KB Output is correct
16 Correct 266 ms 43396 KB Output is correct
17 Correct 693 ms 80120 KB Output is correct
18 Correct 43 ms 25664 KB Output is correct
19 Correct 248 ms 47348 KB Output is correct
20 Correct 713 ms 90112 KB Output is correct
21 Correct 379 ms 61132 KB Output is correct
22 Correct 221 ms 46768 KB Output is correct
23 Correct 694 ms 89692 KB Output is correct
24 Correct 678 ms 90276 KB Output is correct
25 Correct 703 ms 90616 KB Output is correct
26 Correct 234 ms 47272 KB Output is correct
27 Correct 225 ms 47396 KB Output is correct
28 Correct 228 ms 47272 KB Output is correct
29 Correct 230 ms 47436 KB Output is correct
30 Correct 225 ms 47296 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 40236 KB Output is correct
2 Correct 427 ms 67028 KB Output is correct
3 Correct 420 ms 74212 KB Output is correct
4 Correct 56 ms 31932 KB Output is correct
5 Correct 434 ms 75544 KB Output is correct
6 Correct 425 ms 74264 KB Output is correct
7 Correct 409 ms 74340 KB Output is correct
8 Correct 423 ms 74408 KB Output is correct
9 Correct 426 ms 74256 KB Output is correct
10 Correct 439 ms 74772 KB Output is correct
11 Correct 438 ms 75976 KB Output is correct
12 Correct 422 ms 75540 KB Output is correct
13 Correct 427 ms 75212 KB Output is correct
14 Correct 406 ms 74188 KB Output is correct
15 Correct 441 ms 75532 KB Output is correct
16 Correct 423 ms 74916 KB Output is correct
17 Correct 422 ms 74256 KB Output is correct
18 Correct 432 ms 74152 KB Output is correct
19 Correct 53 ms 31864 KB Output is correct
20 Correct 415 ms 74264 KB Output is correct
21 Correct 429 ms 74680 KB Output is correct
22 Correct 66 ms 33068 KB Output is correct
23 Correct 59 ms 32460 KB Output is correct
24 Correct 64 ms 33192 KB Output is correct
25 Correct 75 ms 33960 KB Output is correct
26 Correct 64 ms 32440 KB Output is correct
27 Correct 54 ms 32000 KB Output is correct
28 Correct 69 ms 33412 KB Output is correct
29 Correct 59 ms 31780 KB Output is correct
30 Correct 68 ms 32784 KB Output is correct
31 Correct 55 ms 31936 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19548 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 6 ms 19804 KB Output is correct
4 Correct 4 ms 19684 KB Output is correct
5 Correct 6 ms 19804 KB Output is correct
6 Correct 5 ms 19800 KB Output is correct
7 Correct 4 ms 19548 KB Output is correct
8 Correct 4 ms 19544 KB Output is correct
9 Correct 6 ms 19804 KB Output is correct
10 Correct 6 ms 19800 KB Output is correct
11 Correct 7 ms 19928 KB Output is correct
12 Correct 5 ms 19804 KB Output is correct
13 Correct 7 ms 19928 KB Output is correct
14 Correct 6 ms 19804 KB Output is correct
15 Correct 5 ms 19804 KB Output is correct
16 Correct 266 ms 43396 KB Output is correct
17 Correct 693 ms 80120 KB Output is correct
18 Correct 43 ms 25664 KB Output is correct
19 Correct 248 ms 47348 KB Output is correct
20 Correct 713 ms 90112 KB Output is correct
21 Correct 379 ms 61132 KB Output is correct
22 Correct 221 ms 46768 KB Output is correct
23 Correct 694 ms 89692 KB Output is correct
24 Correct 678 ms 90276 KB Output is correct
25 Correct 703 ms 90616 KB Output is correct
26 Correct 234 ms 47272 KB Output is correct
27 Correct 225 ms 47396 KB Output is correct
28 Correct 228 ms 47272 KB Output is correct
29 Correct 230 ms 47436 KB Output is correct
30 Correct 225 ms 47296 KB Output is correct
31 Correct 4 ms 19548 KB Output is correct
32 Correct 4 ms 19548 KB Output is correct
33 Correct 4 ms 19544 KB Output is correct
34 Correct 4 ms 19636 KB Output is correct
35 Correct 5 ms 19548 KB Output is correct
36 Correct 4 ms 19548 KB Output is correct
37 Correct 4 ms 19548 KB Output is correct
38 Correct 4 ms 19548 KB Output is correct
39 Correct 4 ms 19548 KB Output is correct
40 Correct 5 ms 19548 KB Output is correct
41 Correct 137 ms 40236 KB Output is correct
42 Correct 427 ms 67028 KB Output is correct
43 Correct 420 ms 74212 KB Output is correct
44 Correct 56 ms 31932 KB Output is correct
45 Correct 434 ms 75544 KB Output is correct
46 Correct 425 ms 74264 KB Output is correct
47 Correct 409 ms 74340 KB Output is correct
48 Correct 423 ms 74408 KB Output is correct
49 Correct 426 ms 74256 KB Output is correct
50 Correct 439 ms 74772 KB Output is correct
51 Correct 438 ms 75976 KB Output is correct
52 Correct 422 ms 75540 KB Output is correct
53 Correct 427 ms 75212 KB Output is correct
54 Correct 406 ms 74188 KB Output is correct
55 Correct 441 ms 75532 KB Output is correct
56 Correct 423 ms 74916 KB Output is correct
57 Correct 422 ms 74256 KB Output is correct
58 Correct 432 ms 74152 KB Output is correct
59 Correct 53 ms 31864 KB Output is correct
60 Correct 415 ms 74264 KB Output is correct
61 Correct 429 ms 74680 KB Output is correct
62 Correct 66 ms 33068 KB Output is correct
63 Correct 59 ms 32460 KB Output is correct
64 Correct 64 ms 33192 KB Output is correct
65 Correct 75 ms 33960 KB Output is correct
66 Correct 64 ms 32440 KB Output is correct
67 Correct 54 ms 32000 KB Output is correct
68 Correct 69 ms 33412 KB Output is correct
69 Correct 59 ms 31780 KB Output is correct
70 Correct 68 ms 32784 KB Output is correct
71 Correct 55 ms 31936 KB Output is correct
72 Correct 379 ms 57780 KB Output is correct
73 Correct 734 ms 89448 KB Output is correct
74 Correct 774 ms 90480 KB Output is correct
75 Correct 741 ms 90304 KB Output is correct
76 Correct 739 ms 89848 KB Output is correct
77 Correct 718 ms 89768 KB Output is correct
78 Correct 706 ms 90000 KB Output is correct
79 Correct 713 ms 90184 KB Output is correct
80 Correct 683 ms 89956 KB Output is correct
81 Correct 691 ms 89528 KB Output is correct
82 Correct 717 ms 89988 KB Output is correct
83 Correct 717 ms 89676 KB Output is correct
84 Correct 703 ms 89976 KB Output is correct
85 Correct 710 ms 90412 KB Output is correct
86 Correct 695 ms 89952 KB Output is correct
87 Correct 696 ms 89512 KB Output is correct
88 Correct 705 ms 89512 KB Output is correct
89 Correct 221 ms 47652 KB Output is correct
90 Correct 687 ms 89696 KB Output is correct
91 Correct 665 ms 94396 KB Output is correct
92 Correct 260 ms 48816 KB Output is correct
93 Correct 318 ms 52688 KB Output is correct
94 Correct 248 ms 48712 KB Output is correct
95 Correct 237 ms 48808 KB Output is correct
96 Correct 315 ms 78188 KB Output is correct
97 Correct 229 ms 67004 KB Output is correct
98 Correct 233 ms 48812 KB Output is correct
99 Correct 236 ms 67520 KB Output is correct
100 Correct 234 ms 49440 KB Output is correct