oj.uz

Submission #881058

# Submission time Handle Problem Language Result Execution time Memory
881058 2023-11-30T13:04:50 Z anha3k25cvp Evacuation plan (IZhO18_plan) C++14
100 / 100
 545 ms 36644 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const int inf = 7 + 1e9;

struct Edge {
    int u, v, w;
    bool operator <(const Edge &O) const {
        return w > O.w;
    }
};

struct Query {
    int u, v, id, lo, hi, mid;
    bool operator <(const Query &O) const {
        return mid > O.mid;
    }
};

struct Dsu {
    int n;
    vector <int> root;
    Dsu (int _n = 0) : n(_n) {
        root.assign(n + 1, 0);
        for (int i = 1; i <= n; i ++)
            root[i] = i;
    }
    int getroot(int u) {
        return u == root[u] ? u : root[u] = getroot(root[u]);
    }
    void unite(int u, int v) {
        u = getroot(u); v = getroot(v);
        if (u == v)
            return;
        root[v] = u;
    }
};

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n, m;
    cin >> n >> m;
    vector <vector <II>> adj(n + 1);
    vector <Edge> E(m + 1);
    for (int i = 1; i <= m; i ++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
        E[i] = {u, v, 0};
    }
    vector <int> f(n + 1, inf);
    priority_queue <II> q;
    int k;
    cin >> k;
    while (k --) {
        int u;
        cin >> u;
        q.push({-(f[u] = 0), u});
    }
    while (!q.empty()) {
        int du = -q.top().st, u = q.top().nd;
        q.pop();
        if (f[u] < du)
            continue;
        for (auto z : adj[u]) {
            int v = z.st, w = z.nd;
            if (du + w < f[v])
                q.push({-(f[v] = du + w), v});
        }
    }
    for (int i = 1; i <= m; i ++)
        E[i].w = min(f[E[i].u], f[E[i].v]);
    sort(E.begin() + 1, E.end());
    int t;
    cin >> t;
    vector <Query> e(t + 1);
    for (int i = 1; i <= t; i ++) {
        cin >> e[i].u >> e[i].v;
        e[i].id = i;
        e[i].lo = 0;
        e[i].hi = inf;
    }
    while (1) {
        int check = 0;
        for (int i = 1; i <= t; i ++)
            if (e[i].lo < e[i].hi) {
                e[i].mid = (e[i].lo + e[i].hi + 1) / 2;
                check = 1;
            }
        if (!check)
            break;
        sort(e.begin() + 1, e.end());
        Dsu D(n);
        int pos = 1;
        for (int i = 1; i <= t; i ++) {
            while (pos <= m && E[pos].w >= e[i].mid) {
                D.unite(E[pos].u, E[pos].v);
                pos ++;
            }
            if (D.getroot(e[i].u) == D.getroot(e[i].v))
                e[i].lo = e[i].mid;
            else
                e[i].hi = e[i].mid - 1;
        }
    }
    vector <int> ans(t + 1, 0);
    for (int i = 1; i <= t; i ++)
        ans[e[i].id] = e[i].lo;
    for (int i = 1; i <= t; i ++)
        cout << ans[i] << '\n';
    return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:52:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen (TASKNAME".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:53:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen (TASKNAME".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 604 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 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 604 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 212 ms 13340 KB Output is correct
17 Correct 509 ms 36428 KB Output is correct
18 Correct 37 ms 3672 KB Output is correct
19 Correct 132 ms 14948 KB Output is correct
20 Correct 477 ms 36428 KB Output is correct
21 Correct 196 ms 20060 KB Output is correct
22 Correct 158 ms 13888 KB Output is correct
23 Correct 468 ms 36552 KB Output is correct
24 Correct 467 ms 36556 KB Output is correct
25 Correct 419 ms 36556 KB Output is correct
26 Correct 150 ms 14820 KB Output is correct
27 Correct 153 ms 14916 KB Output is correct
28 Correct 137 ms 14664 KB Output is correct
29 Correct 135 ms 14920 KB Output is correct
30 Correct 141 ms 15012 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 16132 KB Output is correct
2 Correct 290 ms 32460 KB Output is correct
3 Correct 334 ms 32688 KB Output is correct
4 Correct 57 ms 9928 KB Output is correct
5 Correct 353 ms 32500 KB Output is correct
6 Correct 269 ms 32716 KB Output is correct
7 Correct 293 ms 32596 KB Output is correct
8 Correct 269 ms 32716 KB Output is correct
9 Correct 291 ms 32548 KB Output is correct
10 Correct 389 ms 32416 KB Output is correct
11 Correct 402 ms 32568 KB Output is correct
12 Correct 331 ms 32588 KB Output is correct
13 Correct 348 ms 32212 KB Output is correct
14 Correct 277 ms 32420 KB Output is correct
15 Correct 316 ms 33416 KB Output is correct
16 Correct 345 ms 32800 KB Output is correct
17 Correct 255 ms 32576 KB Output is correct
18 Correct 273 ms 32464 KB Output is correct
19 Correct 32 ms 9416 KB Output is correct
20 Correct 333 ms 32344 KB Output is correct
21 Correct 238 ms 32704 KB Output is correct
22 Correct 43 ms 11472 KB Output is correct
23 Correct 60 ms 10112 KB Output is correct
24 Correct 48 ms 11424 KB Output is correct
25 Correct 46 ms 11296 KB Output is correct
26 Correct 54 ms 10064 KB Output is correct
27 Correct 59 ms 9928 KB Output is correct
28 Correct 42 ms 11460 KB Output is correct
29 Correct 62 ms 10092 KB Output is correct
30 Correct 46 ms 11472 KB Output is correct
31 Correct 57 ms 10036 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 604 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 212 ms 13340 KB Output is correct
17 Correct 509 ms 36428 KB Output is correct
18 Correct 37 ms 3672 KB Output is correct
19 Correct 132 ms 14948 KB Output is correct
20 Correct 477 ms 36428 KB Output is correct
21 Correct 196 ms 20060 KB Output is correct
22 Correct 158 ms 13888 KB Output is correct
23 Correct 468 ms 36552 KB Output is correct
24 Correct 467 ms 36556 KB Output is correct
25 Correct 419 ms 36556 KB Output is correct
26 Correct 150 ms 14820 KB Output is correct
27 Correct 153 ms 14916 KB Output is correct
28 Correct 137 ms 14664 KB Output is correct
29 Correct 135 ms 14920 KB Output is correct
30 Correct 141 ms 15012 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 452 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 139 ms 16132 KB Output is correct
42 Correct 290 ms 32460 KB Output is correct
43 Correct 334 ms 32688 KB Output is correct
44 Correct 57 ms 9928 KB Output is correct
45 Correct 353 ms 32500 KB Output is correct
46 Correct 269 ms 32716 KB Output is correct
47 Correct 293 ms 32596 KB Output is correct
48 Correct 269 ms 32716 KB Output is correct
49 Correct 291 ms 32548 KB Output is correct
50 Correct 389 ms 32416 KB Output is correct
51 Correct 402 ms 32568 KB Output is correct
52 Correct 331 ms 32588 KB Output is correct
53 Correct 348 ms 32212 KB Output is correct
54 Correct 277 ms 32420 KB Output is correct
55 Correct 316 ms 33416 KB Output is correct
56 Correct 345 ms 32800 KB Output is correct
57 Correct 255 ms 32576 KB Output is correct
58 Correct 273 ms 32464 KB Output is correct
59 Correct 32 ms 9416 KB Output is correct
60 Correct 333 ms 32344 KB Output is correct
61 Correct 238 ms 32704 KB Output is correct
62 Correct 43 ms 11472 KB Output is correct
63 Correct 60 ms 10112 KB Output is correct
64 Correct 48 ms 11424 KB Output is correct
65 Correct 46 ms 11296 KB Output is correct
66 Correct 54 ms 10064 KB Output is correct
67 Correct 59 ms 9928 KB Output is correct
68 Correct 42 ms 11460 KB Output is correct
69 Correct 62 ms 10092 KB Output is correct
70 Correct 46 ms 11472 KB Output is correct
71 Correct 57 ms 10036 KB Output is correct
72 Correct 297 ms 19996 KB Output is correct
73 Correct 490 ms 36420 KB Output is correct
74 Correct 545 ms 36348 KB Output is correct
75 Correct 480 ms 36612 KB Output is correct
76 Correct 469 ms 36464 KB Output is correct
77 Correct 463 ms 36560 KB Output is correct
78 Correct 498 ms 36296 KB Output is correct
79 Correct 488 ms 36360 KB Output is correct
80 Correct 484 ms 36556 KB Output is correct
81 Correct 477 ms 36552 KB Output is correct
82 Correct 470 ms 36512 KB Output is correct
83 Correct 482 ms 36644 KB Output is correct
84 Correct 428 ms 36544 KB Output is correct
85 Correct 438 ms 36556 KB Output is correct
86 Correct 497 ms 36620 KB Output is correct
87 Correct 458 ms 36412 KB Output is correct
88 Correct 503 ms 36628 KB Output is correct
89 Correct 153 ms 13768 KB Output is correct
90 Correct 474 ms 36612 KB Output is correct
91 Correct 337 ms 36484 KB Output is correct
92 Correct 146 ms 15172 KB Output is correct
93 Correct 187 ms 14280 KB Output is correct
94 Correct 132 ms 14796 KB Output is correct
95 Correct 140 ms 14816 KB Output is correct
96 Correct 168 ms 13780 KB Output is correct
97 Correct 184 ms 13780 KB Output is correct
98 Correct 132 ms 14664 KB Output is correct
99 Correct 187 ms 13920 KB Output is correct
100 Correct 131 ms 14824 KB Output is correct