oj.uz

Submission #972755

# Submission time Handle Problem Language Result Execution time Memory
972755 2024-05-01T06:04:35 Z blackslex Evacuation plan (IZhO18_plan) C++17
100 / 100
 753 ms 43284 KB 
#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;
using tp = tuple<int, int, int>;

int n, m, k, q;

int main() {
    scanf("%d %d", &n, &m);
    vector<tp> u(m);
    vector<vector<pii>> v(n + 5, vector<pii>());
    for (auto &[z, x, y]: u) scanf("%d %d %d", &x, &y, &z), v[x].emplace_back(y, z), v[y].emplace_back(x, z);
    scanf("%d", &k);
    vector<int> g(k), d(n + 5, 1e9);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for (auto &e: g) scanf("%d", &e), pq.emplace(d[e] = 0, e);
    while (!pq.empty()) {
        auto [nd, nn] = pq.top(); pq.pop();
        for (auto &[tn, td]: v[nn]) if (d[tn] > d[nn] + td) pq.emplace(d[tn] = d[nn] + td, tn);
    }
    set<int> s;
    map<int, int> mp;
    vector<int> pos(n + 5);
    for (int i = 1; i <= n; i++) s.emplace(d[i]);
    int idx = 0;
    for (auto e: s) mp[e] = ++idx, pos[idx] = e;
    vector<vector<pii>> cu(idx + 5);
    for (auto &[z, x, y]: u) cu[mp[min(d[x], d[y])]].emplace_back(x, y);
    scanf("%d", &q);
    vector<pii> cq(q);
    for (auto &[x, y]: cq) scanf("%d %d", &x, &y);
    vector<int> l(q, 1), r(q, idx), mid(q);
    while (1) {
        vector<vector<int>> t(idx + 5, vector<int>());
        bool ck = 1;
        for (int i = 0; i < q; i++) if (l[i] <= r[i]) mid[i] = (l[i] + r[i]) >> 1, t[mid[i]].emplace_back(i), ck = 0;
        if (ck) break;
        vector<int> par(n + 5); iota(par.begin(), par.end(), 0);
        function<int(int)> fset = [&] (int x) {return (par[x] == x ? x : par[x] = fset(par[x]));};
        for (int i = idx; i >= 1; i--) {
            for (auto &[x, y]: cu[i]) par[fset(x)] = fset(y);
            for (auto &e: t[i]) {
                if (fset(cq[e].first) != fset(cq[e].second)) r[e] = mid[e] - 1;
                else l[e] = mid[e] + 1;
            }
        }
    }
    for (auto &e: r) printf("%d\n", pos[e]);
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
plan.cpp:13:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (auto &[z, x, y]: u) scanf("%d %d %d", &x, &y, &z), v[x].emplace_back(y, z), v[y].emplace_back(x, z);
      |                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
plan.cpp:17:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     for (auto &e: g) scanf("%d", &e), pq.emplace(d[e] = 0, e);
      |                      ~~~~~^~~~~~~~~~
plan.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
plan.cpp:32:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     for (auto &[x, y]: cq) scanf("%d %d", &x, &y);
      |                            ~~~~~^~~~~~~~~~~~~~~~~

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 552 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 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 668 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 568 KB Output is correct
15 Correct 2 ms 604 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 552 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 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 668 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 568 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 217 ms 15712 KB Output is correct
17 Correct 685 ms 42996 KB Output is correct
18 Correct 54 ms 4316 KB Output is correct
19 Correct 126 ms 18044 KB Output is correct
20 Correct 658 ms 43068 KB Output is correct
21 Correct 289 ms 23096 KB Output is correct
22 Correct 218 ms 33152 KB Output is correct
23 Correct 657 ms 42744 KB Output is correct
24 Correct 703 ms 42516 KB Output is correct
25 Correct 631 ms 42772 KB Output is correct
26 Correct 117 ms 18440 KB Output is correct
27 Correct 117 ms 21128 KB Output is correct
28 Correct 113 ms 19228 KB Output is correct
29 Correct 109 ms 17580 KB Output is correct
30 Correct 115 ms 18048 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 440 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 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 300 ms 19512 KB Output is correct
2 Correct 638 ms 38756 KB Output is correct
3 Correct 555 ms 38344 KB Output is correct
4 Correct 141 ms 29440 KB Output is correct
5 Correct 610 ms 38748 KB Output is correct
6 Correct 610 ms 38932 KB Output is correct
7 Correct 561 ms 39024 KB Output is correct
8 Correct 574 ms 38892 KB Output is correct
9 Correct 581 ms 38660 KB Output is correct
10 Correct 577 ms 38944 KB Output is correct
11 Correct 599 ms 39112 KB Output is correct
12 Correct 574 ms 38912 KB Output is correct
13 Correct 600 ms 38856 KB Output is correct
14 Correct 580 ms 38804 KB Output is correct
15 Correct 562 ms 38848 KB Output is correct
16 Correct 552 ms 39136 KB Output is correct
17 Correct 589 ms 38856 KB Output is correct
18 Correct 611 ms 39172 KB Output is correct
19 Correct 116 ms 29344 KB Output is correct
20 Correct 589 ms 38856 KB Output is correct
21 Correct 421 ms 37368 KB Output is correct
22 Correct 73 ms 16928 KB Output is correct
23 Correct 140 ms 21460 KB Output is correct
24 Correct 74 ms 14664 KB Output is correct
25 Correct 73 ms 16324 KB Output is correct
26 Correct 127 ms 16124 KB Output is correct
27 Correct 134 ms 29204 KB Output is correct
28 Correct 68 ms 14548 KB Output is correct
29 Correct 135 ms 29424 KB Output is correct
30 Correct 68 ms 14544 KB Output is correct
31 Correct 130 ms 29416 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 552 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 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 668 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 568 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 217 ms 15712 KB Output is correct
17 Correct 685 ms 42996 KB Output is correct
18 Correct 54 ms 4316 KB Output is correct
19 Correct 126 ms 18044 KB Output is correct
20 Correct 658 ms 43068 KB Output is correct
21 Correct 289 ms 23096 KB Output is correct
22 Correct 218 ms 33152 KB Output is correct
23 Correct 657 ms 42744 KB Output is correct
24 Correct 703 ms 42516 KB Output is correct
25 Correct 631 ms 42772 KB Output is correct
26 Correct 117 ms 18440 KB Output is correct
27 Correct 117 ms 21128 KB Output is correct
28 Correct 113 ms 19228 KB Output is correct
29 Correct 109 ms 17580 KB Output is correct
30 Correct 115 ms 18048 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 440 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 348 KB Output is correct
37 Correct 0 ms 436 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 300 ms 19512 KB Output is correct
42 Correct 638 ms 38756 KB Output is correct
43 Correct 555 ms 38344 KB Output is correct
44 Correct 141 ms 29440 KB Output is correct
45 Correct 610 ms 38748 KB Output is correct
46 Correct 610 ms 38932 KB Output is correct
47 Correct 561 ms 39024 KB Output is correct
48 Correct 574 ms 38892 KB Output is correct
49 Correct 581 ms 38660 KB Output is correct
50 Correct 577 ms 38944 KB Output is correct
51 Correct 599 ms 39112 KB Output is correct
52 Correct 574 ms 38912 KB Output is correct
53 Correct 600 ms 38856 KB Output is correct
54 Correct 580 ms 38804 KB Output is correct
55 Correct 562 ms 38848 KB Output is correct
56 Correct 552 ms 39136 KB Output is correct
57 Correct 589 ms 38856 KB Output is correct
58 Correct 611 ms 39172 KB Output is correct
59 Correct 116 ms 29344 KB Output is correct
60 Correct 589 ms 38856 KB Output is correct
61 Correct 421 ms 37368 KB Output is correct
62 Correct 73 ms 16928 KB Output is correct
63 Correct 140 ms 21460 KB Output is correct
64 Correct 74 ms 14664 KB Output is correct
65 Correct 73 ms 16324 KB Output is correct
66 Correct 127 ms 16124 KB Output is correct
67 Correct 134 ms 29204 KB Output is correct
68 Correct 68 ms 14548 KB Output is correct
69 Correct 135 ms 29424 KB Output is correct
70 Correct 68 ms 14544 KB Output is correct
71 Correct 130 ms 29416 KB Output is correct
72 Correct 379 ms 23516 KB Output is correct
73 Correct 665 ms 42464 KB Output is correct
74 Correct 678 ms 43168 KB Output is correct
75 Correct 665 ms 43052 KB Output is correct
76 Correct 698 ms 42748 KB Output is correct
77 Correct 753 ms 43284 KB Output is correct
78 Correct 674 ms 42688 KB Output is correct
79 Correct 685 ms 42820 KB Output is correct
80 Correct 685 ms 42672 KB Output is correct
81 Correct 711 ms 43176 KB Output is correct
82 Correct 670 ms 42736 KB Output is correct
83 Correct 684 ms 42764 KB Output is correct
84 Correct 727 ms 42584 KB Output is correct
85 Correct 677 ms 43244 KB Output is correct
86 Correct 697 ms 43128 KB Output is correct
87 Correct 714 ms 42900 KB Output is correct
88 Correct 681 ms 42704 KB Output is correct
89 Correct 276 ms 34444 KB Output is correct
90 Correct 673 ms 42708 KB Output is correct
91 Correct 467 ms 41212 KB Output is correct
92 Correct 121 ms 18836 KB Output is correct
93 Correct 265 ms 26420 KB Output is correct
94 Correct 120 ms 19684 KB Output is correct
95 Correct 109 ms 18272 KB Output is correct
96 Correct 217 ms 20084 KB Output is correct
97 Correct 260 ms 33304 KB Output is correct
98 Correct 121 ms 19452 KB Output is correct
99 Correct 243 ms 33048 KB Output is correct
100 Correct 115 ms 18312 KB Output is correct