oj.uz

Submission #917159

# Submission time Handle Problem Language Result Execution time Memory
917159 2024-01-27T10:43:36 Z dilanyan Evacuation plan (IZhO18_plan) C++17
100 / 100
 461 ms 50376 KB 
//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------KarginDefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
 
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1000000007;
const ll inf = 1e9 + 15;
 
//-------------------KarginCode------------------------\\ 
 
const int N = 100005;

int n;

vector<pair<int, int>> g[N];
int dist[N];
bool vis[N];

bool cmp(int u,int v) {
    return dist[u] > dist[v];
}

int p[N], s[N];
vector<int> t[N];

void setdsu() {
    for (int i = 1;i <= n;i++) p[i] = i, s[i] = 1;
}

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

bool merge(int u, int v) {
    int pu = get(u), pv = get(v);
    if (pu == pv) return false;
    if (s[pu] < s[pv]) swap(u, v), swap(pu, pv);
    s[pu] += s[pv];
    p[pv] = pu;
    t[u].pb(v), t[v].pb(u);
    return (s[pu] == n);
}

int tin[N], tout[N], tim = 0;
int up[N][20], mn[N][20], d[N];

void dfs(int u, int p) {
    tin[u] = tim++;
    for (int v : t[u]) {
        if (p == v) continue;
        up[v][0] = u;
        mn[v][0] = min(dist[u], dist[v]);
        d[v] = d[u] + 1;
        dfs(v, u);
    }
    tout[u] = tim;
}

bool anc(int u, int v) {
    return (tin[u] <= tin[v] && tout[u] >= tout[v]);
}

int lca(int u, int v) {
    if (anc(u, v)) return u;
    if (anc(v, u)) return v;
    for (int i = 19;i >= 0;i--) {
        if (!anc(up[u][i], v)) u = up[u][i];
    }
    return up[u][0];
}

void KarginSolve() {
    int m;
    cin >> n >> m;
    for (int i = 0;i < m;i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].pb({ v,w }), g[v].pb({ u,w });
    }
    int k; cin >> k;
    fill(dist + 1, dist + n + 1, inf);
    pqueue<pair<int, int>> pq;
    for (int i = 0; i < k;i++) {
        int u; cin >> u;
        pq.push({ 0,u }), dist[u] = 0;
    }
    while (!pq.empty()) {
        int u = pq.top().second; pq.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (auto it : g[u]) {
            int v = it.first, w = it.second;
            if (dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                pq.push({ -dist[v],v });
            }
        }
    }
    vector<int> a;
    for (int i = 1;i <= n;i++) a.pb(i);
    sort(all(a), cmp);
    setdsu();
    for (int u : a) {
        for (auto it : g[u]) {
            int v = it.first;
            if(dist[u] > dist[v]) continue;
            if (merge(u, v)) break;
        }
    }
    // for (int i = 1;i <= n;i++) {
    //     cout << i << " : " << dist[i] << "-> ";
    //     for (int v : t[i]) cout << v << ' ';
    //     cout << '\n';

    // }
    dfs(1, 0);
    up[1][0] = 1, mn[1][0] = dist[1];
    for (int j = 1;j < 20;j++) {
        for (int i = 1;i <= n;i++) {
            up[i][j] = up[up[i][j - 1]][j - 1];
            mn[i][j] = min(mn[i][j - 1], mn[up[i][j - 1]][j - 1]);
        }
    }
    int q; cin >> q;
    while (q--) {
        int u, v;
        cin >>  u>> v;
        int l = lca(u, v);
        int ans = inf;
        int du = d[u] - d[l], dv = d[v] - d[l];
        for (int i = 0;i < 20;i++) {
            if (du & (1 << i)) ans = min(ans, mn[u][i]), u = up[u][i];
            if (dv & (1 << i)) ans = min(ans, mn[v][i]), v = up[v][i];
        }
        cout << ans << '\n';
    }
}
 
int main() {
    //Usaco
    Kargin;
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message

plan.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
plan.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------KarginDefines--------------------\\
      | ^
plan.cpp:22:1: warning: multi-line comment [-Wcomment]
   22 | //-------------------KarginConstants------------------\\
      | ^
plan.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginCode------------------------\\
      | ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 3 ms 10736 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 3 ms 10844 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 3 ms 10908 KB Output is correct
11 Correct 5 ms 10844 KB Output is correct
12 Correct 3 ms 10852 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 3 ms 10736 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 3 ms 10844 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 3 ms 10908 KB Output is correct
11 Correct 5 ms 10844 KB Output is correct
12 Correct 3 ms 10852 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 124 ms 31204 KB Output is correct
17 Correct 380 ms 50188 KB Output is correct
18 Correct 23 ms 15184 KB Output is correct
19 Correct 123 ms 35172 KB Output is correct
20 Correct 333 ms 50120 KB Output is correct
21 Correct 197 ms 38112 KB Output is correct
22 Correct 189 ms 41420 KB Output is correct
23 Correct 367 ms 50280 KB Output is correct
24 Correct 398 ms 50124 KB Output is correct
25 Correct 418 ms 50096 KB Output is correct
26 Correct 120 ms 34796 KB Output is correct
27 Correct 114 ms 34948 KB Output is correct
28 Correct 148 ms 34988 KB Output is correct
29 Correct 133 ms 34892 KB Output is correct
30 Correct 138 ms 35028 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 36180 KB Output is correct
2 Correct 334 ms 48440 KB Output is correct
3 Correct 325 ms 48300 KB Output is correct
4 Correct 123 ms 36240 KB Output is correct
5 Correct 388 ms 48584 KB Output is correct
6 Correct 298 ms 48340 KB Output is correct
7 Correct 322 ms 48324 KB Output is correct
8 Correct 288 ms 48328 KB Output is correct
9 Correct 277 ms 48480 KB Output is correct
10 Correct 308 ms 48520 KB Output is correct
11 Correct 351 ms 48436 KB Output is correct
12 Correct 371 ms 48368 KB Output is correct
13 Correct 315 ms 48312 KB Output is correct
14 Correct 341 ms 48440 KB Output is correct
15 Correct 332 ms 48840 KB Output is correct
16 Correct 298 ms 48332 KB Output is correct
17 Correct 361 ms 48404 KB Output is correct
18 Correct 302 ms 48452 KB Output is correct
19 Correct 112 ms 38836 KB Output is correct
20 Correct 337 ms 48636 KB Output is correct
21 Correct 306 ms 48704 KB Output is correct
22 Correct 93 ms 33356 KB Output is correct
23 Correct 103 ms 32732 KB Output is correct
24 Correct 91 ms 33352 KB Output is correct
25 Correct 98 ms 33352 KB Output is correct
26 Correct 101 ms 33484 KB Output is correct
27 Correct 104 ms 38756 KB Output is correct
28 Correct 88 ms 33352 KB Output is correct
29 Correct 108 ms 37412 KB Output is correct
30 Correct 82 ms 33360 KB Output is correct
31 Correct 129 ms 37536 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 3 ms 10736 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 4 ms 10844 KB Output is correct
6 Correct 3 ms 10844 KB Output is correct
7 Correct 3 ms 10588 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 3 ms 10908 KB Output is correct
11 Correct 5 ms 10844 KB Output is correct
12 Correct 3 ms 10852 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 124 ms 31204 KB Output is correct
17 Correct 380 ms 50188 KB Output is correct
18 Correct 23 ms 15184 KB Output is correct
19 Correct 123 ms 35172 KB Output is correct
20 Correct 333 ms 50120 KB Output is correct
21 Correct 197 ms 38112 KB Output is correct
22 Correct 189 ms 41420 KB Output is correct
23 Correct 367 ms 50280 KB Output is correct
24 Correct 398 ms 50124 KB Output is correct
25 Correct 418 ms 50096 KB Output is correct
26 Correct 120 ms 34796 KB Output is correct
27 Correct 114 ms 34948 KB Output is correct
28 Correct 148 ms 34988 KB Output is correct
29 Correct 133 ms 34892 KB Output is correct
30 Correct 138 ms 35028 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10588 KB Output is correct
34 Correct 3 ms 10588 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 3 ms 10588 KB Output is correct
39 Correct 2 ms 10588 KB Output is correct
40 Correct 2 ms 10588 KB Output is correct
41 Correct 204 ms 36180 KB Output is correct
42 Correct 334 ms 48440 KB Output is correct
43 Correct 325 ms 48300 KB Output is correct
44 Correct 123 ms 36240 KB Output is correct
45 Correct 388 ms 48584 KB Output is correct
46 Correct 298 ms 48340 KB Output is correct
47 Correct 322 ms 48324 KB Output is correct
48 Correct 288 ms 48328 KB Output is correct
49 Correct 277 ms 48480 KB Output is correct
50 Correct 308 ms 48520 KB Output is correct
51 Correct 351 ms 48436 KB Output is correct
52 Correct 371 ms 48368 KB Output is correct
53 Correct 315 ms 48312 KB Output is correct
54 Correct 341 ms 48440 KB Output is correct
55 Correct 332 ms 48840 KB Output is correct
56 Correct 298 ms 48332 KB Output is correct
57 Correct 361 ms 48404 KB Output is correct
58 Correct 302 ms 48452 KB Output is correct
59 Correct 112 ms 38836 KB Output is correct
60 Correct 337 ms 48636 KB Output is correct
61 Correct 306 ms 48704 KB Output is correct
62 Correct 93 ms 33356 KB Output is correct
63 Correct 103 ms 32732 KB Output is correct
64 Correct 91 ms 33352 KB Output is correct
65 Correct 98 ms 33352 KB Output is correct
66 Correct 101 ms 33484 KB Output is correct
67 Correct 104 ms 38756 KB Output is correct
68 Correct 88 ms 33352 KB Output is correct
69 Correct 108 ms 37412 KB Output is correct
70 Correct 82 ms 33360 KB Output is correct
71 Correct 129 ms 37536 KB Output is correct
72 Correct 209 ms 37972 KB Output is correct
73 Correct 379 ms 49988 KB Output is correct
74 Correct 367 ms 50124 KB Output is correct
75 Correct 461 ms 50120 KB Output is correct
76 Correct 348 ms 50124 KB Output is correct
77 Correct 367 ms 50128 KB Output is correct
78 Correct 440 ms 50020 KB Output is correct
79 Correct 352 ms 50172 KB Output is correct
80 Correct 358 ms 50152 KB Output is correct
81 Correct 406 ms 50124 KB Output is correct
82 Correct 361 ms 50376 KB Output is correct
83 Correct 367 ms 50120 KB Output is correct
84 Correct 407 ms 50000 KB Output is correct
85 Correct 460 ms 50108 KB Output is correct
86 Correct 393 ms 50128 KB Output is correct
87 Correct 389 ms 50124 KB Output is correct
88 Correct 366 ms 50376 KB Output is correct
89 Correct 181 ms 39576 KB Output is correct
90 Correct 372 ms 50020 KB Output is correct
91 Correct 340 ms 50124 KB Output is correct
92 Correct 157 ms 35144 KB Output is correct
93 Correct 176 ms 35028 KB Output is correct
94 Correct 149 ms 34892 KB Output is correct
95 Correct 150 ms 35264 KB Output is correct
96 Correct 187 ms 34508 KB Output is correct
97 Correct 165 ms 38348 KB Output is correct
98 Correct 167 ms 35168 KB Output is correct
99 Correct 163 ms 40396 KB Output is correct
100 Correct 135 ms 35048 KB Output is correct