oj.uz

Submission #378620

# Submission time Handle Problem Language Result Execution time Memory
378620 2021-03-17T02:25:30 Z 2qbingxuan Evacuation plan (IZhO18_plan) C++14
100 / 100
 886 ms 33620 KB 
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)

using namespace std;
using ll = int64_t;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
const int maxn = 100025, inf = 1e9;
const ll INF = 1e18;

int dis[maxn];
vector<pair<int,int>> g[maxn];

namespace dsu {

int pa[maxn];
set<int> st[maxn];
int ans[maxn];
void init(int n) { for (int i = 0; i < n; i++) pa[i] = i; }
int anc(int x) { return x==pa[x] ? x : pa[x]=anc(pa[x]); }
void join(int x, int y, int d) {
    if ((x=anc(x)) == (y=anc(y))) return;
    if (st[x].size() < st[y].size()) swap(x, y);
    for (int qid: st[y]) {
        if (st[x].count(qid)) {
            st[x].erase(qid);
            ans[qid] = d;
            debug(qid, d);
        } else {
            st[x].insert(qid);
        }
    }
    pa[y] = x;
    st[y].clear();
}

}

bool alive[maxn];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b, w;
        cin >> a >> b >> w;
        --a, --b;
        g[a].emplace_back(b, w);
        g[b].emplace_back(a, w);
    }
    fill(dis, dis+n, inf);
    min_heap<pair<int,int>> pq;
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
        int g;
        cin >> g;
        --g;
        pq.emplace(dis[g] = 0, g);
    }
    while (!pq.empty()) {
        auto [d, i] = pq.top(); pq.pop();
        if (dis[i] != d) continue;
        for (auto [j, w]: g[i]) {
            if (dis[j] > dis[i] + w)
                pq.emplace(dis[j] = dis[i] + w, j);
        }
    }

    dsu::init(n);
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        int s, t;
        cin >> s >> t;
        --s, --t;
        dsu::st[s].insert(i);
        dsu::st[t].insert(i);
    }

    vector<int> id(n);
    iota(all(id), 0);
    sort(all(id), [](int a, int b){ return dis[a] > dis[b]; });
    for (int i: id) {
        alive[i] = true;
        for (auto [j, w]: g[i]) {
            if (alive[j])
                dsu::join(i, j, dis[i]);
        }
    }
    for (int i = 0; i < q; i++)
        cout << dsu::ans[i] << '\n';
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
 */

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:72:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   72 |         auto [d, i] = pq.top(); pq.pop();
      |              ^
plan.cpp:74:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   74 |         for (auto [j, w]: g[i]) {
      |                   ^
plan.cpp:96:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   96 |         for (auto [j, w]: g[i]) {
      |                   ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 8 ms 7536 KB Output is correct
3 Correct 9 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 7 ms 7404 KB Output is correct
8 Correct 8 ms 7404 KB Output is correct
9 Correct 8 ms 7532 KB Output is correct
10 Correct 7 ms 7568 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 9 ms 7532 KB Output is correct
13 Correct 9 ms 7532 KB Output is correct
14 Correct 7 ms 7532 KB Output is correct
15 Correct 9 ms 7532 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 8 ms 7536 KB Output is correct
3 Correct 9 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 7 ms 7404 KB Output is correct
8 Correct 8 ms 7404 KB Output is correct
9 Correct 8 ms 7532 KB Output is correct
10 Correct 7 ms 7568 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 9 ms 7532 KB Output is correct
13 Correct 9 ms 7532 KB Output is correct
14 Correct 7 ms 7532 KB Output is correct
15 Correct 9 ms 7532 KB Output is correct
16 Correct 322 ms 22444 KB Output is correct
17 Correct 764 ms 33576 KB Output is correct
18 Correct 51 ms 10092 KB Output is correct
19 Correct 268 ms 24496 KB Output is correct
20 Correct 832 ms 33516 KB Output is correct
21 Correct 485 ms 26268 KB Output is correct
22 Correct 177 ms 23360 KB Output is correct
23 Correct 761 ms 33540 KB Output is correct
24 Correct 783 ms 33540 KB Output is correct
25 Correct 886 ms 33588 KB Output is correct
26 Correct 329 ms 24160 KB Output is correct
27 Correct 274 ms 24256 KB Output is correct
28 Correct 267 ms 24232 KB Output is correct
29 Correct 260 ms 24288 KB Output is correct
30 Correct 258 ms 24288 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 15724 KB Output is correct
2 Correct 476 ms 23724 KB Output is correct
3 Correct 480 ms 23776 KB Output is correct
4 Correct 85 ms 11756 KB Output is correct
5 Correct 474 ms 23648 KB Output is correct
6 Correct 497 ms 23780 KB Output is correct
7 Correct 463 ms 23904 KB Output is correct
8 Correct 480 ms 23648 KB Output is correct
9 Correct 482 ms 23608 KB Output is correct
10 Correct 449 ms 23916 KB Output is correct
11 Correct 475 ms 23888 KB Output is correct
12 Correct 446 ms 23648 KB Output is correct
13 Correct 457 ms 23616 KB Output is correct
14 Correct 467 ms 23780 KB Output is correct
15 Correct 480 ms 24164 KB Output is correct
16 Correct 461 ms 23776 KB Output is correct
17 Correct 472 ms 23776 KB Output is correct
18 Correct 529 ms 23648 KB Output is correct
19 Correct 89 ms 11756 KB Output is correct
20 Correct 479 ms 23776 KB Output is correct
21 Correct 461 ms 23392 KB Output is correct
22 Correct 107 ms 13408 KB Output is correct
23 Correct 99 ms 12328 KB Output is correct
24 Correct 124 ms 13408 KB Output is correct
25 Correct 109 ms 13408 KB Output is correct
26 Correct 110 ms 12524 KB Output is correct
27 Correct 88 ms 11756 KB Output is correct
28 Correct 119 ms 13408 KB Output is correct
29 Correct 92 ms 11756 KB Output is correct
30 Correct 108 ms 13408 KB Output is correct
31 Correct 95 ms 11756 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 8 ms 7536 KB Output is correct
3 Correct 9 ms 7532 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 7 ms 7404 KB Output is correct
8 Correct 8 ms 7404 KB Output is correct
9 Correct 8 ms 7532 KB Output is correct
10 Correct 7 ms 7568 KB Output is correct
11 Correct 7 ms 7532 KB Output is correct
12 Correct 9 ms 7532 KB Output is correct
13 Correct 9 ms 7532 KB Output is correct
14 Correct 7 ms 7532 KB Output is correct
15 Correct 9 ms 7532 KB Output is correct
16 Correct 322 ms 22444 KB Output is correct
17 Correct 764 ms 33576 KB Output is correct
18 Correct 51 ms 10092 KB Output is correct
19 Correct 268 ms 24496 KB Output is correct
20 Correct 832 ms 33516 KB Output is correct
21 Correct 485 ms 26268 KB Output is correct
22 Correct 177 ms 23360 KB Output is correct
23 Correct 761 ms 33540 KB Output is correct
24 Correct 783 ms 33540 KB Output is correct
25 Correct 886 ms 33588 KB Output is correct
26 Correct 329 ms 24160 KB Output is correct
27 Correct 274 ms 24256 KB Output is correct
28 Correct 267 ms 24232 KB Output is correct
29 Correct 260 ms 24288 KB Output is correct
30 Correct 258 ms 24288 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 5 ms 7404 KB Output is correct
33 Correct 6 ms 7404 KB Output is correct
34 Correct 6 ms 7404 KB Output is correct
35 Correct 6 ms 7404 KB Output is correct
36 Correct 5 ms 7404 KB Output is correct
37 Correct 6 ms 7404 KB Output is correct
38 Correct 5 ms 7404 KB Output is correct
39 Correct 6 ms 7404 KB Output is correct
40 Correct 6 ms 7404 KB Output is correct
41 Correct 219 ms 15724 KB Output is correct
42 Correct 476 ms 23724 KB Output is correct
43 Correct 480 ms 23776 KB Output is correct
44 Correct 85 ms 11756 KB Output is correct
45 Correct 474 ms 23648 KB Output is correct
46 Correct 497 ms 23780 KB Output is correct
47 Correct 463 ms 23904 KB Output is correct
48 Correct 480 ms 23648 KB Output is correct
49 Correct 482 ms 23608 KB Output is correct
50 Correct 449 ms 23916 KB Output is correct
51 Correct 475 ms 23888 KB Output is correct
52 Correct 446 ms 23648 KB Output is correct
53 Correct 457 ms 23616 KB Output is correct
54 Correct 467 ms 23780 KB Output is correct
55 Correct 480 ms 24164 KB Output is correct
56 Correct 461 ms 23776 KB Output is correct
57 Correct 472 ms 23776 KB Output is correct
58 Correct 529 ms 23648 KB Output is correct
59 Correct 89 ms 11756 KB Output is correct
60 Correct 479 ms 23776 KB Output is correct
61 Correct 461 ms 23392 KB Output is correct
62 Correct 107 ms 13408 KB Output is correct
63 Correct 99 ms 12328 KB Output is correct
64 Correct 124 ms 13408 KB Output is correct
65 Correct 109 ms 13408 KB Output is correct
66 Correct 110 ms 12524 KB Output is correct
67 Correct 88 ms 11756 KB Output is correct
68 Correct 119 ms 13408 KB Output is correct
69 Correct 92 ms 11756 KB Output is correct
70 Correct 108 ms 13408 KB Output is correct
71 Correct 95 ms 11756 KB Output is correct
72 Correct 532 ms 26416 KB Output is correct
73 Correct 827 ms 33388 KB Output is correct
74 Correct 787 ms 33560 KB Output is correct
75 Correct 819 ms 33376 KB Output is correct
76 Correct 797 ms 33368 KB Output is correct
77 Correct 810 ms 33424 KB Output is correct
78 Correct 775 ms 33504 KB Output is correct
79 Correct 799 ms 33356 KB Output is correct
80 Correct 797 ms 33508 KB Output is correct
81 Correct 775 ms 33504 KB Output is correct
82 Correct 770 ms 33620 KB Output is correct
83 Correct 760 ms 33424 KB Output is correct
84 Correct 800 ms 33400 KB Output is correct
85 Correct 790 ms 33368 KB Output is correct
86 Correct 759 ms 33604 KB Output is correct
87 Correct 788 ms 33380 KB Output is correct
88 Correct 783 ms 33536 KB Output is correct
89 Correct 366 ms 23276 KB Output is correct
90 Correct 758 ms 33380 KB Output is correct
91 Correct 722 ms 32852 KB Output is correct
92 Correct 392 ms 24288 KB Output is correct
93 Correct 488 ms 24044 KB Output is correct
94 Correct 365 ms 24032 KB Output is correct
95 Correct 377 ms 24160 KB Output is correct
96 Correct 553 ms 23276 KB Output is correct
97 Correct 383 ms 22764 KB Output is correct
98 Correct 375 ms 24032 KB Output is correct
99 Correct 398 ms 22892 KB Output is correct
100 Correct 372 ms 24240 KB Output is correct