oj.uz

Submission #671579

# Submission time Handle Problem Language Result Execution time Memory
671579 2022-12-13T08:44:09 Z Alihan_8 Evacuation plan (IZhO18_plan) C++17
100 / 100
 541 ms 79868 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
const int N = 1e5+1;
vector <pair<int,int>> g[N];
vector <int> G[N];
int lift[N][20], Mn[N][20], val[N], depth[N];
void dfs(int n, int p){
    lift[n][0] = p;
    Mn[n][0] = val[n];
    depth[n] = depth[p]+1;
    for ( int i = 1; i < 20; i++ ){
        lift[n][i] = lift[lift[n][i-1]][i-1];
        Mn[n][i] = min(Mn[n][i-1], Mn[lift[n][i-1]][i-1]);
    }
    for ( auto to: G[n] ){
        if ( to == p ) continue;
        dfs(to, n);
    }
}
int _lca(int l, int r){
    if ( depth[l] < depth[r] ) swap(l, r);
    int dif = depth[l]-depth[r], res = numeric_limits <int>::max();
    for ( int i = 19; i >= 0; i-- ){
        if ( dif >> i & 1 ){
            res = min(res, Mn[l][i]);
            l = lift[l][i];
        }
    }
    if ( l == r ) return min(res, val[l]);
    for ( int i = 19; i >= 0; i-- ){
        if ( lift[l][i] == lift[r][i] ) continue;
        res = min({res, Mn[l][i], Mn[r][i]});
        l = lift[l][i], r = lift[r][i];
    }
    res = min({res, Mn[l][1], Mn[r][1]});
    return res;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    for ( int i = 1; i <= m; i++ ){
        int x, y, w; cin >> x >> y >> w;
        g[x].pb({y, w});
        g[y].pb({x, w});
    }
    int k; cin >> k;
    priority_queue <pair<int,int>> q;
    const int inf = 1e12+1;
    vector <int> dis(n+1, inf);
    for ( int i = 1; i <= k; i++ ){
        int x; cin >> x;
        q.push({0, x});
        dis[x] = 0;
    }
    while ( !q.empty() ){
        int cur = q.top().second; q.pop();
        for ( auto [to, w]: g[cur] ){
            int new_dis = dis[cur]+w;
            if ( new_dis < dis[to] ){
                dis[to] = new_dis;
                q.push({-dis[to], to});
            }
        }
    }
    vector <int> pos(n+1), par(n+1);
    iota(all(pos), 0); iota(all(par), 0);
    sort(pos.begin()+1, pos.end(), [&](int &l, int &r){
         return dis[l] > dis[r];
    });
    for ( int i = 1; i <= n; i++ ) val[i] = dis[i];
    function <int(int)> find = [&](int x){
        return par[x] == x ? x : par[x] = find(par[x]);
    };
    auto merge = [&](int x, int y){
        x = find(x), y = find(y);
        if ( x == y ) return false;
        par[y] = x;
        return true;
    };
    vector <int> used(n+1);
    for ( auto i: pos ){
        if ( !i ) continue;
        for ( auto [to, w]: g[i] ){
            if ( !used[to] ) continue;
            if ( merge(to, i) ){
                G[to].pb(i), G[i].pb(to);
            }
        }
        used[i] = 1;
    }
    dfs(1, 0);
    int Q; cin >> Q;
    while ( Q-- ){
        int x, y; cin >> x >> y;
        cout << _lca(x, y) << ln;
    }

    cout << '\n';
}

Compilation message

plan.cpp: In function 'void IO(std::string)':
plan.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5460 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5460 KB Output is correct
6 Correct 3 ms 5500 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5460 KB Output is correct
10 Correct 4 ms 5460 KB Output is correct
11 Correct 3 ms 5396 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5436 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5460 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5460 KB Output is correct
6 Correct 3 ms 5500 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5460 KB Output is correct
10 Correct 4 ms 5460 KB Output is correct
11 Correct 3 ms 5396 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5436 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 179 ms 41620 KB Output is correct
17 Correct 521 ms 70188 KB Output is correct
18 Correct 31 ms 12104 KB Output is correct
19 Correct 145 ms 51580 KB Output is correct
20 Correct 491 ms 70212 KB Output is correct
21 Correct 296 ms 55552 KB Output is correct
22 Correct 197 ms 54288 KB Output is correct
23 Correct 497 ms 70192 KB Output is correct
24 Correct 501 ms 70236 KB Output is correct
25 Correct 519 ms 70200 KB Output is correct
26 Correct 153 ms 51388 KB Output is correct
27 Correct 147 ms 51380 KB Output is correct
28 Correct 146 ms 51404 KB Output is correct
29 Correct 147 ms 51496 KB Output is correct
30 Correct 150 ms 51500 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 54992 KB Output is correct
2 Correct 450 ms 69948 KB Output is correct
3 Correct 445 ms 69812 KB Output is correct
4 Correct 147 ms 51676 KB Output is correct
5 Correct 479 ms 69816 KB Output is correct
6 Correct 429 ms 69832 KB Output is correct
7 Correct 444 ms 69844 KB Output is correct
8 Correct 470 ms 69832 KB Output is correct
9 Correct 433 ms 69828 KB Output is correct
10 Correct 443 ms 69944 KB Output is correct
11 Correct 452 ms 69736 KB Output is correct
12 Correct 491 ms 69864 KB Output is correct
13 Correct 445 ms 69804 KB Output is correct
14 Correct 462 ms 69788 KB Output is correct
15 Correct 489 ms 69944 KB Output is correct
16 Correct 485 ms 69828 KB Output is correct
17 Correct 483 ms 69848 KB Output is correct
18 Correct 536 ms 69744 KB Output is correct
19 Correct 185 ms 53224 KB Output is correct
20 Correct 450 ms 69816 KB Output is correct
21 Correct 406 ms 69296 KB Output is correct
22 Correct 114 ms 51208 KB Output is correct
23 Correct 136 ms 50200 KB Output is correct
24 Correct 113 ms 51176 KB Output is correct
25 Correct 114 ms 51208 KB Output is correct
26 Correct 161 ms 50636 KB Output is correct
27 Correct 149 ms 53004 KB Output is correct
28 Correct 124 ms 51220 KB Output is correct
29 Correct 151 ms 52412 KB Output is correct
30 Correct 112 ms 51084 KB Output is correct
31 Correct 163 ms 52416 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5460 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5460 KB Output is correct
6 Correct 3 ms 5500 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5460 KB Output is correct
10 Correct 4 ms 5460 KB Output is correct
11 Correct 3 ms 5396 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5436 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 179 ms 41620 KB Output is correct
17 Correct 521 ms 70188 KB Output is correct
18 Correct 31 ms 12104 KB Output is correct
19 Correct 145 ms 51580 KB Output is correct
20 Correct 491 ms 70212 KB Output is correct
21 Correct 296 ms 55552 KB Output is correct
22 Correct 197 ms 54288 KB Output is correct
23 Correct 497 ms 70192 KB Output is correct
24 Correct 501 ms 70236 KB Output is correct
25 Correct 519 ms 70200 KB Output is correct
26 Correct 153 ms 51388 KB Output is correct
27 Correct 147 ms 51380 KB Output is correct
28 Correct 146 ms 51404 KB Output is correct
29 Correct 147 ms 51496 KB Output is correct
30 Correct 150 ms 51500 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 5036 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 4 ms 5056 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 255 ms 54992 KB Output is correct
42 Correct 450 ms 69948 KB Output is correct
43 Correct 445 ms 69812 KB Output is correct
44 Correct 147 ms 51676 KB Output is correct
45 Correct 479 ms 69816 KB Output is correct
46 Correct 429 ms 69832 KB Output is correct
47 Correct 444 ms 69844 KB Output is correct
48 Correct 470 ms 69832 KB Output is correct
49 Correct 433 ms 69828 KB Output is correct
50 Correct 443 ms 69944 KB Output is correct
51 Correct 452 ms 69736 KB Output is correct
52 Correct 491 ms 69864 KB Output is correct
53 Correct 445 ms 69804 KB Output is correct
54 Correct 462 ms 69788 KB Output is correct
55 Correct 489 ms 69944 KB Output is correct
56 Correct 485 ms 69828 KB Output is correct
57 Correct 483 ms 69848 KB Output is correct
58 Correct 536 ms 69744 KB Output is correct
59 Correct 185 ms 53224 KB Output is correct
60 Correct 450 ms 69816 KB Output is correct
61 Correct 406 ms 69296 KB Output is correct
62 Correct 114 ms 51208 KB Output is correct
63 Correct 136 ms 50200 KB Output is correct
64 Correct 113 ms 51176 KB Output is correct
65 Correct 114 ms 51208 KB Output is correct
66 Correct 161 ms 50636 KB Output is correct
67 Correct 149 ms 53004 KB Output is correct
68 Correct 124 ms 51220 KB Output is correct
69 Correct 151 ms 52412 KB Output is correct
70 Correct 112 ms 51084 KB Output is correct
71 Correct 163 ms 52416 KB Output is correct
72 Correct 317 ms 56612 KB Output is correct
73 Correct 511 ms 79648 KB Output is correct
74 Correct 535 ms 79868 KB Output is correct
75 Correct 516 ms 79696 KB Output is correct
76 Correct 508 ms 79596 KB Output is correct
77 Correct 525 ms 79692 KB Output is correct
78 Correct 522 ms 79608 KB Output is correct
79 Correct 503 ms 79632 KB Output is correct
80 Correct 529 ms 79636 KB Output is correct
81 Correct 517 ms 79552 KB Output is correct
82 Correct 523 ms 79616 KB Output is correct
83 Correct 528 ms 79696 KB Output is correct
84 Correct 541 ms 79588 KB Output is correct
85 Correct 518 ms 79688 KB Output is correct
86 Correct 531 ms 79612 KB Output is correct
87 Correct 517 ms 79604 KB Output is correct
88 Correct 519 ms 79592 KB Output is correct
89 Correct 285 ms 56352 KB Output is correct
90 Correct 500 ms 79552 KB Output is correct
91 Correct 500 ms 79340 KB Output is correct
92 Correct 168 ms 54300 KB Output is correct
93 Correct 216 ms 54044 KB Output is correct
94 Correct 168 ms 54168 KB Output is correct
95 Correct 165 ms 54328 KB Output is correct
96 Correct 236 ms 53588 KB Output is correct
97 Correct 268 ms 55196 KB Output is correct
98 Correct 168 ms 54256 KB Output is correct
99 Correct 270 ms 56476 KB Output is correct
100 Correct 178 ms 54332 KB Output is correct