oj.uz

Submission #982812

# Submission time Handle Problem Language Result Execution time Memory
982812 2024-05-14T18:28:56 Z steveonalex Evacuation plan (IZhO18_plan) C++17
100 / 100
 365 ms 53336 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)

// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct P{
    int i, w; 
    P(){}
    P(int _i, int _w){i = _i, w = _w;}
};

struct compare{
    bool operator () (P a, P b){return a.w > b.w;}
};

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 1; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }
};

const int N  = 1e5 + 69, INF = 1e9 + 69, LOG_N = 17;

int n, m; 
vector<P> graph[N];
vector<pair<int, int>> tree[N];
int dis[N];


int h[N], parent[N][LOG_N], min_w[N][LOG_N];
void dfs(int u, int p){
    h[u] = h[p] + 1;
    for(int j = 1; MASK(j) < h[u]; ++j){
        int prev = parent[u][j-1];
        parent[u][j] = parent[prev][j-1];
        min_w[u][j] = min(min_w[u][j-1], min_w[prev][j-1]);
    }
    for(pair<int, int> v: tree[u]) if (v.first != p){
        parent[v.first][0] = u;
        min_w[v.first][0] = v.second;
        dfs(v.first, u);
    }
}

int LCA(int u, int v){
    if (h[u] < h[v]) swap(u, v);
    int ans = INF;
    int diff = h[u] - h[v];
    for(int j = 0; j< LOG_N; ++j) if (GETBIT(diff, j)) {
        minimize(ans, min_w[u][j]);
        u = parent[u][j];
    }
    if (u == v) return ans;
    for(int j= LOG_N - 1; j>=0; --j) if (parent[u][j] != parent[v][j]){
        minimize(ans, min(min_w[u][j], min_w[v][j]));
        u = parent[u][j], v = parent[v][j];
    }
    minimize(ans, min(min_w[u][0], min_w[v][0]));
    return ans;
}

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

    cin >> n >> m;
    for(int i =0; i<m; ++i){
        int u, v, w; cin >> u >> v >> w;
        graph[u].push_back(P(v, w));
        graph[v].push_back(P(u, w));
    }

    int k; cin >> k;
    vector<int> npp(k);
    for(int i= 0; i<k; ++i)
        cin >> npp[i];

    remove_dup(npp);

    k = npp.size();

    priority_queue<P, vector<P>, compare> pq;
    for(int i = 1; i<=n; ++i) dis[i] = INF;
    for(int i: npp) {
        dis[i] = 0;
        pq.push(P(i, 0));
    }
    while(pq.size()){
        P u = pq.top(); pq.pop();
        for(P v: graph[u.i]) 
            if (minimize(dis[v.i], dis[u.i] + v.w))
                pq.push(P(v.i, dis[v.i]));
    }

    vector<array<int, 3>> edging;
    for(int i = 1; i<=n; ++i) for(P j: graph[i]) if (i < j.i){
        edging.push_back({{i, j.i, min(dis[i], dis[j.i])}});
    }
    sort(ALL(edging), [](array<int, 3> x, array<int, 3> y){return x[2] > y[2];});

    DSU mst(n);
    for(auto i: edging) if (mst.join_set(i[0], i[1])){
        int u = i[0], v = i[1], w = i[2];
        tree[u].push_back({v, w});
        tree[v].push_back({u, w});
    }

    dfs(1, 1);

    int q; cin >> q;
    while(q--){
        int u, v; cin >> u >> v;
        int ans = LCA(u, v);
        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8840 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8856 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8792 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 2 ms 8792 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8840 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8856 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8792 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 2 ms 8792 KB Output is correct
16 Correct 97 ms 28744 KB Output is correct
17 Correct 349 ms 52644 KB Output is correct
18 Correct 22 ms 14036 KB Output is correct
19 Correct 84 ms 33108 KB Output is correct
20 Correct 324 ms 52696 KB Output is correct
21 Correct 161 ms 38012 KB Output is correct
22 Correct 116 ms 37340 KB Output is correct
23 Correct 310 ms 52684 KB Output is correct
24 Correct 298 ms 52744 KB Output is correct
25 Correct 308 ms 52864 KB Output is correct
26 Correct 81 ms 32836 KB Output is correct
27 Correct 80 ms 32828 KB Output is correct
28 Correct 89 ms 32716 KB Output is correct
29 Correct 82 ms 32924 KB Output is correct
30 Correct 82 ms 33032 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 8828 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8832 KB Output is correct
8 Correct 2 ms 9048 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 32244 KB Output is correct
2 Correct 271 ms 51304 KB Output is correct
3 Correct 271 ms 51132 KB Output is correct
4 Correct 81 ms 32968 KB Output is correct
5 Correct 291 ms 51040 KB Output is correct
6 Correct 259 ms 51020 KB Output is correct
7 Correct 267 ms 51080 KB Output is correct
8 Correct 264 ms 51132 KB Output is correct
9 Correct 300 ms 51116 KB Output is correct
10 Correct 275 ms 51072 KB Output is correct
11 Correct 264 ms 51112 KB Output is correct
12 Correct 271 ms 51268 KB Output is correct
13 Correct 293 ms 51004 KB Output is correct
14 Correct 315 ms 51056 KB Output is correct
15 Correct 284 ms 51164 KB Output is correct
16 Correct 276 ms 51136 KB Output is correct
17 Correct 256 ms 51028 KB Output is correct
18 Correct 263 ms 51016 KB Output is correct
19 Correct 85 ms 34940 KB Output is correct
20 Correct 295 ms 51168 KB Output is correct
21 Correct 245 ms 51716 KB Output is correct
22 Correct 51 ms 31384 KB Output is correct
23 Correct 80 ms 30624 KB Output is correct
24 Correct 51 ms 31296 KB Output is correct
25 Correct 58 ms 31476 KB Output is correct
26 Correct 88 ms 30816 KB Output is correct
27 Correct 90 ms 34760 KB Output is correct
28 Correct 69 ms 31300 KB Output is correct
29 Correct 87 ms 33828 KB Output is correct
30 Correct 49 ms 31300 KB Output is correct
31 Correct 80 ms 33728 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8840 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8792 KB Output is correct
7 Correct 2 ms 8856 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 3 ms 8796 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8792 KB Output is correct
13 Correct 2 ms 8792 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 2 ms 8792 KB Output is correct
16 Correct 97 ms 28744 KB Output is correct
17 Correct 349 ms 52644 KB Output is correct
18 Correct 22 ms 14036 KB Output is correct
19 Correct 84 ms 33108 KB Output is correct
20 Correct 324 ms 52696 KB Output is correct
21 Correct 161 ms 38012 KB Output is correct
22 Correct 116 ms 37340 KB Output is correct
23 Correct 310 ms 52684 KB Output is correct
24 Correct 298 ms 52744 KB Output is correct
25 Correct 308 ms 52864 KB Output is correct
26 Correct 81 ms 32836 KB Output is correct
27 Correct 80 ms 32828 KB Output is correct
28 Correct 89 ms 32716 KB Output is correct
29 Correct 82 ms 32924 KB Output is correct
30 Correct 82 ms 33032 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 2 ms 8828 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 8796 KB Output is correct
36 Correct 2 ms 8796 KB Output is correct
37 Correct 2 ms 8832 KB Output is correct
38 Correct 2 ms 9048 KB Output is correct
39 Correct 2 ms 8796 KB Output is correct
40 Correct 2 ms 8796 KB Output is correct
41 Correct 124 ms 32244 KB Output is correct
42 Correct 271 ms 51304 KB Output is correct
43 Correct 271 ms 51132 KB Output is correct
44 Correct 81 ms 32968 KB Output is correct
45 Correct 291 ms 51040 KB Output is correct
46 Correct 259 ms 51020 KB Output is correct
47 Correct 267 ms 51080 KB Output is correct
48 Correct 264 ms 51132 KB Output is correct
49 Correct 300 ms 51116 KB Output is correct
50 Correct 275 ms 51072 KB Output is correct
51 Correct 264 ms 51112 KB Output is correct
52 Correct 271 ms 51268 KB Output is correct
53 Correct 293 ms 51004 KB Output is correct
54 Correct 315 ms 51056 KB Output is correct
55 Correct 284 ms 51164 KB Output is correct
56 Correct 276 ms 51136 KB Output is correct
57 Correct 256 ms 51028 KB Output is correct
58 Correct 263 ms 51016 KB Output is correct
59 Correct 85 ms 34940 KB Output is correct
60 Correct 295 ms 51168 KB Output is correct
61 Correct 245 ms 51716 KB Output is correct
62 Correct 51 ms 31384 KB Output is correct
63 Correct 80 ms 30624 KB Output is correct
64 Correct 51 ms 31296 KB Output is correct
65 Correct 58 ms 31476 KB Output is correct
66 Correct 88 ms 30816 KB Output is correct
67 Correct 90 ms 34760 KB Output is correct
68 Correct 69 ms 31300 KB Output is correct
69 Correct 87 ms 33828 KB Output is correct
70 Correct 49 ms 31300 KB Output is correct
71 Correct 80 ms 33728 KB Output is correct
72 Correct 172 ms 37192 KB Output is correct
73 Correct 312 ms 52820 KB Output is correct
74 Correct 365 ms 52816 KB Output is correct
75 Correct 312 ms 52840 KB Output is correct
76 Correct 330 ms 52760 KB Output is correct
77 Correct 339 ms 52680 KB Output is correct
78 Correct 324 ms 52876 KB Output is correct
79 Correct 328 ms 52764 KB Output is correct
80 Correct 335 ms 53012 KB Output is correct
81 Correct 329 ms 52848 KB Output is correct
82 Correct 322 ms 52664 KB Output is correct
83 Correct 302 ms 52764 KB Output is correct
84 Correct 304 ms 52648 KB Output is correct
85 Correct 318 ms 52724 KB Output is correct
86 Correct 310 ms 52760 KB Output is correct
87 Correct 295 ms 52612 KB Output is correct
88 Correct 313 ms 52664 KB Output is correct
89 Correct 144 ms 36040 KB Output is correct
90 Correct 326 ms 52816 KB Output is correct
91 Correct 287 ms 53336 KB Output is correct
92 Correct 93 ms 32980 KB Output is correct
93 Correct 133 ms 32708 KB Output is correct
94 Correct 83 ms 32900 KB Output is correct
95 Correct 98 ms 33004 KB Output is correct
96 Correct 130 ms 32200 KB Output is correct
97 Correct 150 ms 34760 KB Output is correct
98 Correct 105 ms 32912 KB Output is correct
99 Correct 139 ms 36348 KB Output is correct
100 Correct 84 ms 32824 KB Output is correct