oj.uz

Submission #492360

# Submission time Handle Problem Language Result Execution time Memory
492360 2021-12-07T02:56:50 Z Mike4235 Evacuation plan (IZhO18_plan) C++17
100 / 100
 580 ms 57012 KB 
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")*/
 
#include <bits/stdc++.h>
  
#define for1(i,a,b) for (int i = a; i <= b; i++)
#define for2(i,a,b) for (int i = a; i >= b; i--)
#define int long long

#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pb push_back
 
/*
__builtin_popcountll(x) : Number of 1-bit
__builtin_ctzll(x) : Number of trailing 0
*/
 
const long double PI = 3.1415926535897932384626433832795;
const int INF = 1000000000000000000;
const int MOD = 1000000007;
const int MOD2 = 1000000009;
const long double EPS = 1e-6;

using namespace std;

int n, m, k, q;
int d[100005], par[100005], sz[100005], res[100005];
set<int> se[100005];
priority_queue<pii, vector<pii>, greater<pii>> pq;
vector<pii> v;
vector<pii> g[100005];

int find_set(int v) {
    return (v == par[v] ? v : par[v] = find_set(par[v]));
}

void join_sets(int a, int b, int w) {
    a = find_set(a);
    b = find_set(b);

    if (a == b) return;

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

    if (sz(se[a]) < sz(se[b])) swap(se[a], se[b]);
    for (auto x : se[b]) {
        if (se[a].find(x) != se[a].end()) {
            res[x] = w;
            se[a].erase(x);
        }
        else se[a].insert(x);
    }
}

signed main() {
    
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    // freopen("cf.inp", "r", stdin);
    // freopen("cf.out", "w", stdout);

    cin >> n >> m;
    for1(i,1,m) {
        int a, b, w;
        cin >> a >> b >> w;
        g[a].push_back({b, w});
        g[b].push_back({a, w});
    }

    for1(i,1,n) {
        par[i] = i;
        sz[i] = 1;
        d[i] = INF;
    }

    cin >> k;
    while (k--) {
        int a;
        cin >> a;
        d[a] = 0;
        pq.push({0, a});
    }

    while (!pq.empty()) {
        int u = pq.top().second, d_u = pq.top().first;
        pq.pop();

        if (d[u] != d_u) continue;

        for (auto e : g[u]) {
            int v = e.first, w = e.second;
            if (d[u] + w < d[v]) {
                d[v] = d[u] + w;
                pq.push({d[v], v});
            }
        }
    }

    for1(i,1,n) v.push_back({d[i], i});
    sort(v.begin(), v.end(), greater<pii>());

    cin >> q;
    for1(i,1,q) {
        int s, t;
        cin >> s >> t;
        se[s].insert(i);
        se[t].insert(i);
    }

    for (auto p : v) {
        int u = p.second, w = p.first;
        for (auto e : g[u]) {
            int v = e.first;
            if (d[v] >= w) join_sets(u, v, w);
        }
    }

    for1(i,1,q) cout << res[i] << "\n";
    
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 5 ms 7504 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 5 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7372 KB Output is correct
9 Correct 5 ms 7500 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 4 ms 7492 KB Output is correct
12 Correct 4 ms 7500 KB Output is correct
13 Correct 6 ms 7576 KB Output is correct
14 Correct 4 ms 7500 KB Output is correct
15 Correct 5 ms 7584 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 5 ms 7504 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 5 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7372 KB Output is correct
9 Correct 5 ms 7500 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 4 ms 7492 KB Output is correct
12 Correct 4 ms 7500 KB Output is correct
13 Correct 6 ms 7576 KB Output is correct
14 Correct 4 ms 7500 KB Output is correct
15 Correct 5 ms 7584 KB Output is correct
16 Correct 231 ms 27284 KB Output is correct
17 Correct 530 ms 49816 KB Output is correct
18 Correct 32 ms 11340 KB Output is correct
19 Correct 199 ms 27988 KB Output is correct
20 Correct 511 ms 49940 KB Output is correct
21 Correct 334 ms 36188 KB Output is correct
22 Correct 145 ms 27008 KB Output is correct
23 Correct 552 ms 49892 KB Output is correct
24 Correct 512 ms 49900 KB Output is correct
25 Correct 533 ms 49920 KB Output is correct
26 Correct 195 ms 27872 KB Output is correct
27 Correct 212 ms 27940 KB Output is correct
28 Correct 212 ms 27828 KB Output is correct
29 Correct 192 ms 27908 KB Output is correct
30 Correct 212 ms 28164 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 23636 KB Output is correct
2 Correct 331 ms 40756 KB Output is correct
3 Correct 351 ms 40944 KB Output is correct
4 Correct 100 ms 16568 KB Output is correct
5 Correct 360 ms 40696 KB Output is correct
6 Correct 409 ms 40784 KB Output is correct
7 Correct 346 ms 40756 KB Output is correct
8 Correct 350 ms 40916 KB Output is correct
9 Correct 325 ms 40740 KB Output is correct
10 Correct 347 ms 40696 KB Output is correct
11 Correct 332 ms 40756 KB Output is correct
12 Correct 342 ms 40828 KB Output is correct
13 Correct 385 ms 40792 KB Output is correct
14 Correct 374 ms 40796 KB Output is correct
15 Correct 341 ms 41452 KB Output is correct
16 Correct 347 ms 40716 KB Output is correct
17 Correct 355 ms 40740 KB Output is correct
18 Correct 418 ms 40756 KB Output is correct
19 Correct 61 ms 16568 KB Output is correct
20 Correct 376 ms 40828 KB Output is correct
21 Correct 306 ms 40220 KB Output is correct
22 Correct 78 ms 18992 KB Output is correct
23 Correct 79 ms 16928 KB Output is correct
24 Correct 83 ms 19052 KB Output is correct
25 Correct 79 ms 18996 KB Output is correct
26 Correct 83 ms 17068 KB Output is correct
27 Correct 64 ms 16488 KB Output is correct
28 Correct 79 ms 18940 KB Output is correct
29 Correct 60 ms 16508 KB Output is correct
30 Correct 83 ms 19060 KB Output is correct
31 Correct 62 ms 16488 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 5 ms 7504 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 5 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 3 ms 7372 KB Output is correct
9 Correct 5 ms 7500 KB Output is correct
10 Correct 4 ms 7500 KB Output is correct
11 Correct 4 ms 7492 KB Output is correct
12 Correct 4 ms 7500 KB Output is correct
13 Correct 6 ms 7576 KB Output is correct
14 Correct 4 ms 7500 KB Output is correct
15 Correct 5 ms 7584 KB Output is correct
16 Correct 231 ms 27284 KB Output is correct
17 Correct 530 ms 49816 KB Output is correct
18 Correct 32 ms 11340 KB Output is correct
19 Correct 199 ms 27988 KB Output is correct
20 Correct 511 ms 49940 KB Output is correct
21 Correct 334 ms 36188 KB Output is correct
22 Correct 145 ms 27008 KB Output is correct
23 Correct 552 ms 49892 KB Output is correct
24 Correct 512 ms 49900 KB Output is correct
25 Correct 533 ms 49920 KB Output is correct
26 Correct 195 ms 27872 KB Output is correct
27 Correct 212 ms 27940 KB Output is correct
28 Correct 212 ms 27828 KB Output is correct
29 Correct 192 ms 27908 KB Output is correct
30 Correct 212 ms 28164 KB Output is correct
31 Correct 4 ms 7356 KB Output is correct
32 Correct 4 ms 7372 KB Output is correct
33 Correct 5 ms 7372 KB Output is correct
34 Correct 3 ms 7372 KB Output is correct
35 Correct 4 ms 7372 KB Output is correct
36 Correct 4 ms 7372 KB Output is correct
37 Correct 4 ms 7372 KB Output is correct
38 Correct 4 ms 7372 KB Output is correct
39 Correct 4 ms 7320 KB Output is correct
40 Correct 4 ms 7372 KB Output is correct
41 Correct 193 ms 23636 KB Output is correct
42 Correct 331 ms 40756 KB Output is correct
43 Correct 351 ms 40944 KB Output is correct
44 Correct 100 ms 16568 KB Output is correct
45 Correct 360 ms 40696 KB Output is correct
46 Correct 409 ms 40784 KB Output is correct
47 Correct 346 ms 40756 KB Output is correct
48 Correct 350 ms 40916 KB Output is correct
49 Correct 325 ms 40740 KB Output is correct
50 Correct 347 ms 40696 KB Output is correct
51 Correct 332 ms 40756 KB Output is correct
52 Correct 342 ms 40828 KB Output is correct
53 Correct 385 ms 40792 KB Output is correct
54 Correct 374 ms 40796 KB Output is correct
55 Correct 341 ms 41452 KB Output is correct
56 Correct 347 ms 40716 KB Output is correct
57 Correct 355 ms 40740 KB Output is correct
58 Correct 418 ms 40756 KB Output is correct
59 Correct 61 ms 16568 KB Output is correct
60 Correct 376 ms 40828 KB Output is correct
61 Correct 306 ms 40220 KB Output is correct
62 Correct 78 ms 18992 KB Output is correct
63 Correct 79 ms 16928 KB Output is correct
64 Correct 83 ms 19052 KB Output is correct
65 Correct 79 ms 18996 KB Output is correct
66 Correct 83 ms 17068 KB Output is correct
67 Correct 64 ms 16488 KB Output is correct
68 Correct 79 ms 18940 KB Output is correct
69 Correct 60 ms 16508 KB Output is correct
70 Correct 83 ms 19060 KB Output is correct
71 Correct 62 ms 16488 KB Output is correct
72 Correct 377 ms 38376 KB Output is correct
73 Correct 557 ms 50752 KB Output is correct
74 Correct 532 ms 50716 KB Output is correct
75 Correct 576 ms 50744 KB Output is correct
76 Correct 531 ms 50724 KB Output is correct
77 Correct 531 ms 50700 KB Output is correct
78 Correct 513 ms 50696 KB Output is correct
79 Correct 543 ms 50752 KB Output is correct
80 Correct 528 ms 50748 KB Output is correct
81 Correct 576 ms 50656 KB Output is correct
82 Correct 518 ms 50736 KB Output is correct
83 Correct 580 ms 50704 KB Output is correct
84 Correct 536 ms 50600 KB Output is correct
85 Correct 513 ms 50712 KB Output is correct
86 Correct 520 ms 50744 KB Output is correct
87 Correct 508 ms 50616 KB Output is correct
88 Correct 526 ms 50628 KB Output is correct
89 Correct 220 ms 29312 KB Output is correct
90 Correct 544 ms 50880 KB Output is correct
91 Correct 516 ms 50480 KB Output is correct
92 Correct 239 ms 30336 KB Output is correct
93 Correct 311 ms 53220 KB Output is correct
94 Correct 257 ms 30252 KB Output is correct
95 Correct 232 ms 30316 KB Output is correct
96 Correct 351 ms 57012 KB Output is correct
97 Correct 245 ms 31256 KB Output is correct
98 Correct 233 ms 30164 KB Output is correct
99 Correct 248 ms 31424 KB Output is correct
100 Correct 254 ms 30252 KB Output is correct