oj.uz

Submission #940727

# Submission time Handle Problem Language Result Execution time Memory
940727 2024-03-07T14:21:25 Z KK_1729 Evacuation plan (IZhO18_plan) C++17
100 / 100
 1020 ms 141584 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}

int N = 0;
vector<vector<pair<int, int>>> graph;
vector<int> distance(vector<int> source){
    // return ;
    using T = pair<long long, int>;
	priority_queue<T, vector<T>, greater<T>> pq; // stores dist, node
 
    vector<int> dist(N+1, 1e16);
    
 
    for (auto x: source){
        pq.push({0, x});
        dist[x] = 0;
    }
 
    while (!pq.empty()){
        auto [cdist, node] = pq.top();
 
        pq.pop();
        if (cdist != dist[node]) continue;
        for (auto x: graph[node]){
            if (cdist + x.second < dist[x.first]){
                pq.push({dist[x.first] = cdist + x.second, x.first});
            }
        }
    }
    return dist;
}


struct UFDS {
    vector<int> link, siz;
    UFDS(int n) : link(n), siz(n, 1) { iota(link.begin(), link.end(), 0); } //each element as its own subset, with size 1
    int findRoot(int x) {
        return x == link[x]  ? x : link[x]  =  findRoot(link[x]);  
    }
    bool same(int x, int y) { return findRoot(x) == findRoot(y); }
    bool unite(int x, int y) {
        x = findRoot(x);
        y = findRoot(y);
        if (x == y)
            return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        link[y] = x;
        return true;
    }
    int size(int x) { return siz[findRoot(x)]; }
};
int min(int x, int y){
    if (x < y) return x;
    else return y;
}
vector<vector<pair<int, int>>> maxtree;
vector<int> up(N+1);
int L = 0;
vector<vector<int>> bin;
vector<vector<int>> mbin;
vector<int> depth;

int lca(int a, int b){
    if (depth[a] < depth[b]) swap(a, b);
    int k = depth[a]-depth[b];
    for (int j = L-1; j >= 0; j--){
        if (k & (1 << j)) a = bin[a][j];
    }
    if (a == b) return a;
    for (int j = L-1; j >= 0; j--){
        if (bin[a][j] != bin[b][j]){
            a = bin[a][j];
            b = bin[b][j];
        }
    }
    return bin[a][0];
}
void solve(){
    int n, m; cin >> n >> m;
    N = n;
    graph.resize(n+1);

    FOR(i,0,m){
        int a, b, w; cin >> a >> b >> w;
        graph[a].pb({b, w});
        graph[b].pb({a, w});
    }

    int k; cin >> k;
    vector<int> np(k);
    FOR(i,0,k) cin >> np[i];

    vector<int> d = distance(np);

    vector<vector<int>> new_graph(n+1);
    vector<vector<int>> edges;
    FOR(i,1,n+1){
        for (auto x: graph[i]){
            edges.pb({min(d[x.first], d[i]), i, x.first});
        }
    }

    UFDS ds(n+1);
    sort(all(edges));
    reverse(all(edges));
    


    maxtree.resize(n+1);
    for (auto edge: edges){
        // printVector(edge);
        if (!ds.same(edge[1], edge[2])){
            // cout << edge[1] << " " << edge[2] << " " << edge[0] << endl;
            ds.unite(edge[1], edge[2]);
            maxtree[edge[1]].pb({edge[2], edge[0]});
            maxtree[edge[2]].pb({edge[1], edge[0]});
        }
    }
    // FOR(i,1,n+1){
    //     for (auto x: maxtree[i]) cout << x.first << x.second << endl;
    //     cout << endl;
    // }
    L = log2(n)+1;
    bin.resize(n+1, vector<int>(L+1));
    mbin.resize(n+1, vector<int>(L+1));
    depth.resize(n+1);
    stack<int> s;
    s.push(1);
    vector<int> vis(n+1);
    bin[1][0] = 1;
    depth[1] = 1;
    while (!s.empty()){
        int current = s.top();
        s.pop();
        if (vis[current]) continue;
        for (auto x: maxtree[current]){
            if (vis[x.first]) continue;
            bin[x.first][0] = current;
            mbin[x.first][0] = x.second;
            depth[x.first] = depth[current]+1;
            s.push(x.first);
        }
        vis[current] = 1;
    }
    for (int i = 1; i <= L; ++i){
        for (int j = 1; j <= n; ++j){
            bin[j][i] = bin[ bin[j][i-1] ][i-1];
            mbin[j][i] = min(mbin[j][i-1], mbin[ bin[j][i-1] ][i-1]);
        }
    }
    int q; cin >> q;
    while (q--){

        int a, b; cin >> a >> b;
        int l = lca(a, b);
        int k = depth[a]-depth[l];
        int ans = 1e16;
        for (int i = L; i >= 0; i--){
            if (k & (1 << i)){
                ans = min(ans, mbin[a][i]);
                a = bin[a][i];
            }
        }
        k = depth[b]-depth[l];
        for (int i = L; i >= 0; i--){
            if (k & (1 << i)){
                ans = min(ans, mbin[b][i]);
                b = bin[b][i];
            }
        }
        cout << ans << endl;
    }
}
int32_t main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int t = 1; // cin >> t;
    while (t--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 1040 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 984 KB Output is correct
14 Correct 2 ms 1020 KB Output is correct
15 Correct 2 ms 1044 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 1040 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 984 KB Output is correct
14 Correct 2 ms 1020 KB Output is correct
15 Correct 2 ms 1044 KB Output is correct
16 Correct 247 ms 61280 KB Output is correct
17 Correct 956 ms 141316 KB Output is correct
18 Correct 43 ms 13196 KB Output is correct
19 Correct 220 ms 72848 KB Output is correct
20 Correct 993 ms 140544 KB Output is correct
21 Correct 412 ms 90212 KB Output is correct
22 Correct 293 ms 72240 KB Output is correct
23 Correct 982 ms 140436 KB Output is correct
24 Correct 1020 ms 140408 KB Output is correct
25 Correct 991 ms 140456 KB Output is correct
26 Correct 236 ms 71720 KB Output is correct
27 Correct 224 ms 72404 KB Output is correct
28 Correct 237 ms 72216 KB Output is correct
29 Correct 231 ms 71704 KB Output is correct
30 Correct 234 ms 73332 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 88636 KB Output is correct
2 Correct 934 ms 138788 KB Output is correct
3 Correct 904 ms 139004 KB Output is correct
4 Correct 204 ms 69632 KB Output is correct
5 Correct 911 ms 138632 KB Output is correct
6 Correct 868 ms 139816 KB Output is correct
7 Correct 860 ms 138792 KB Output is correct
8 Correct 872 ms 138596 KB Output is correct
9 Correct 903 ms 138748 KB Output is correct
10 Correct 929 ms 138752 KB Output is correct
11 Correct 895 ms 138672 KB Output is correct
12 Correct 880 ms 138796 KB Output is correct
13 Correct 884 ms 139516 KB Output is correct
14 Correct 857 ms 139756 KB Output is correct
15 Correct 835 ms 138844 KB Output is correct
16 Correct 850 ms 138736 KB Output is correct
17 Correct 877 ms 139256 KB Output is correct
18 Correct 865 ms 139364 KB Output is correct
19 Correct 224 ms 69368 KB Output is correct
20 Correct 867 ms 139272 KB Output is correct
21 Correct 544 ms 139832 KB Output is correct
22 Correct 166 ms 71192 KB Output is correct
23 Correct 217 ms 70836 KB Output is correct
24 Correct 158 ms 70444 KB Output is correct
25 Correct 155 ms 71420 KB Output is correct
26 Correct 209 ms 70060 KB Output is correct
27 Correct 211 ms 69344 KB Output is correct
28 Correct 159 ms 70956 KB Output is correct
29 Correct 215 ms 70132 KB Output is correct
30 Correct 162 ms 70144 KB Output is correct
31 Correct 214 ms 69188 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 1040 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 984 KB Output is correct
14 Correct 2 ms 1020 KB Output is correct
15 Correct 2 ms 1044 KB Output is correct
16 Correct 247 ms 61280 KB Output is correct
17 Correct 956 ms 141316 KB Output is correct
18 Correct 43 ms 13196 KB Output is correct
19 Correct 220 ms 72848 KB Output is correct
20 Correct 993 ms 140544 KB Output is correct
21 Correct 412 ms 90212 KB Output is correct
22 Correct 293 ms 72240 KB Output is correct
23 Correct 982 ms 140436 KB Output is correct
24 Correct 1020 ms 140408 KB Output is correct
25 Correct 991 ms 140456 KB Output is correct
26 Correct 236 ms 71720 KB Output is correct
27 Correct 224 ms 72404 KB Output is correct
28 Correct 237 ms 72216 KB Output is correct
29 Correct 231 ms 71704 KB Output is correct
30 Correct 234 ms 73332 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 412 ms 88636 KB Output is correct
42 Correct 934 ms 138788 KB Output is correct
43 Correct 904 ms 139004 KB Output is correct
44 Correct 204 ms 69632 KB Output is correct
45 Correct 911 ms 138632 KB Output is correct
46 Correct 868 ms 139816 KB Output is correct
47 Correct 860 ms 138792 KB Output is correct
48 Correct 872 ms 138596 KB Output is correct
49 Correct 903 ms 138748 KB Output is correct
50 Correct 929 ms 138752 KB Output is correct
51 Correct 895 ms 138672 KB Output is correct
52 Correct 880 ms 138796 KB Output is correct
53 Correct 884 ms 139516 KB Output is correct
54 Correct 857 ms 139756 KB Output is correct
55 Correct 835 ms 138844 KB Output is correct
56 Correct 850 ms 138736 KB Output is correct
57 Correct 877 ms 139256 KB Output is correct
58 Correct 865 ms 139364 KB Output is correct
59 Correct 224 ms 69368 KB Output is correct
60 Correct 867 ms 139272 KB Output is correct
61 Correct 544 ms 139832 KB Output is correct
62 Correct 166 ms 71192 KB Output is correct
63 Correct 217 ms 70836 KB Output is correct
64 Correct 158 ms 70444 KB Output is correct
65 Correct 155 ms 71420 KB Output is correct
66 Correct 209 ms 70060 KB Output is correct
67 Correct 211 ms 69344 KB Output is correct
68 Correct 159 ms 70956 KB Output is correct
69 Correct 215 ms 70132 KB Output is correct
70 Correct 162 ms 70144 KB Output is correct
71 Correct 214 ms 69188 KB Output is correct
72 Correct 506 ms 89772 KB Output is correct
73 Correct 981 ms 140604 KB Output is correct
74 Correct 943 ms 140284 KB Output is correct
75 Correct 929 ms 141104 KB Output is correct
76 Correct 946 ms 140728 KB Output is correct
77 Correct 951 ms 140708 KB Output is correct
78 Correct 917 ms 140292 KB Output is correct
79 Correct 941 ms 140604 KB Output is correct
80 Correct 924 ms 141392 KB Output is correct
81 Correct 910 ms 141328 KB Output is correct
82 Correct 937 ms 140308 KB Output is correct
83 Correct 941 ms 141584 KB Output is correct
84 Correct 924 ms 140244 KB Output is correct
85 Correct 903 ms 140320 KB Output is correct
86 Correct 931 ms 140728 KB Output is correct
87 Correct 907 ms 140416 KB Output is correct
88 Correct 924 ms 141472 KB Output is correct
89 Correct 355 ms 71928 KB Output is correct
90 Correct 912 ms 140544 KB Output is correct
91 Correct 640 ms 141444 KB Output is correct
92 Correct 234 ms 72728 KB Output is correct
93 Correct 315 ms 72064 KB Output is correct
94 Correct 235 ms 72492 KB Output is correct
95 Correct 234 ms 73004 KB Output is correct
96 Correct 307 ms 72368 KB Output is correct
97 Correct 360 ms 71116 KB Output is correct
98 Correct 232 ms 72600 KB Output is correct
99 Correct 347 ms 72436 KB Output is correct
100 Correct 250 ms 72024 KB Output is correct