oj.uz

답안 #137059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137059 2019-07-27T03:21:11 Z meatrow Evacuation plan (IZhO18_plan) C++17
100 / 100
 998 ms 52048 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const int N = 1e5 + 1;

int par[N];
set<int> lst[N];
int ans[N];
vector<pair<int, int>> g[N];

int get_root(int v) {
    return v == par[v] ? v : par[v] = get_root(par[v]);
}

void un(int v, int u, int kek) {
    v = get_root(v);
    u = get_root(u);
    if (lst[v].size() < lst[u].size()) {
        swap(v, u);
    }
    if (v != u) {
        par[u] = v;
        for (int x : lst[u]) {
            if (lst[v].count(x)) {
                ans[x] = kek;
                lst[v].erase(x);
            } else {
                lst[v].insert(x);
            }
        }
    }
}

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    iota(par, par + n + 1, 0);
    for (int i = 0; i < m; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        g[v].emplace_back(u, w);
        g[u].emplace_back(v, w);
    }
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
        int v;
        cin >> v;
        g[0].emplace_back(v, 0);
    }
    vector<int> dist(n + 1, INT32_MAX);
    dist[0] = 0;
    set<pair<int, int>> st;
    st.insert({ 0, 0 });
    while (!st.empty()) {
        auto p = *st.begin();
        st.erase(st.begin());
        int v = p.second;
        for (auto e : g[v]) {
            if (dist[v] + e.second < dist[e.first]) {
                st.erase({ dist[e.first], e.first });
                dist[e.first] = dist[v] + e.second;
                st.insert({ dist[e.first], e.first });
            }
        }
    }
    int Q;
    cin >> Q;
    for (int i = 0; i < Q; i++) {
        int s, t;
        cin >> s >> t;
        if (s != t) {
            lst[s].insert(i);
            lst[t].insert(i);
        } else {
            ans[i] = dist[s];
        }
    }
    vector<int> p(n);
    iota(p.begin(), p.end(), 1);
    sort(p.begin(), p.end(), [&](int a, int b) {
        return dist[a] > dist[b];
    });
    vector<int> used(n + 1);
    for (int i = 0; i < n; i++) {
        int v = p[i];
        used[v] = 1;
        for (auto e : g[v]) {
            if (used[e.first]) {
                un(v, e.first, dist[v]);
            }
        }
    }
    for (int i = 0; i < Q; i++) {
        cout << ans[i] << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7544 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7592 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7516 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 10 ms 7592 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct
15 Correct 9 ms 7592 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7544 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7592 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7516 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 10 ms 7592 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct
15 Correct 9 ms 7592 KB Output is correct
16 Correct 328 ms 23180 KB Output is correct
17 Correct 822 ms 34668 KB Output is correct
18 Correct 54 ms 9976 KB Output is correct
19 Correct 299 ms 23104 KB Output is correct
20 Correct 796 ms 34892 KB Output is correct
21 Correct 472 ms 28784 KB Output is correct
22 Correct 206 ms 22780 KB Output is correct
23 Correct 793 ms 34852 KB Output is correct
24 Correct 804 ms 34660 KB Output is correct
25 Correct 777 ms 34788 KB Output is correct
26 Correct 291 ms 22892 KB Output is correct
27 Correct 297 ms 22960 KB Output is correct
28 Correct 300 ms 22848 KB Output is correct
29 Correct 307 ms 22972 KB Output is correct
30 Correct 297 ms 23088 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7420 KB Output is correct
3 Correct 8 ms 7420 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 8 ms 7416 KB Output is correct
6 Correct 8 ms 7416 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 8 ms 7416 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 16412 KB Output is correct
2 Correct 604 ms 24188 KB Output is correct
3 Correct 637 ms 24228 KB Output is correct
4 Correct 101 ms 12024 KB Output is correct
5 Correct 644 ms 24300 KB Output is correct
6 Correct 597 ms 24248 KB Output is correct
7 Correct 620 ms 24312 KB Output is correct
8 Correct 625 ms 24228 KB Output is correct
9 Correct 599 ms 24312 KB Output is correct
10 Correct 594 ms 24108 KB Output is correct
11 Correct 596 ms 24132 KB Output is correct
12 Correct 600 ms 24336 KB Output is correct
13 Correct 583 ms 24220 KB Output is correct
14 Correct 619 ms 24220 KB Output is correct
15 Correct 609 ms 24404 KB Output is correct
16 Correct 633 ms 24340 KB Output is correct
17 Correct 617 ms 24180 KB Output is correct
18 Correct 611 ms 24568 KB Output is correct
19 Correct 103 ms 12024 KB Output is correct
20 Correct 625 ms 24228 KB Output is correct
21 Correct 517 ms 25704 KB Output is correct
22 Correct 138 ms 16908 KB Output is correct
23 Correct 109 ms 12712 KB Output is correct
24 Correct 130 ms 16748 KB Output is correct
25 Correct 128 ms 16748 KB Output is correct
26 Correct 121 ms 13048 KB Output is correct
27 Correct 96 ms 12024 KB Output is correct
28 Correct 138 ms 16744 KB Output is correct
29 Correct 98 ms 12024 KB Output is correct
30 Correct 135 ms 16748 KB Output is correct
31 Correct 92 ms 12024 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7544 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 9 ms 7544 KB Output is correct
6 Correct 9 ms 7592 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 9 ms 7516 KB Output is correct
10 Correct 9 ms 7544 KB Output is correct
11 Correct 10 ms 7592 KB Output is correct
12 Correct 9 ms 7544 KB Output is correct
13 Correct 9 ms 7544 KB Output is correct
14 Correct 9 ms 7544 KB Output is correct
15 Correct 9 ms 7592 KB Output is correct
16 Correct 328 ms 23180 KB Output is correct
17 Correct 822 ms 34668 KB Output is correct
18 Correct 54 ms 9976 KB Output is correct
19 Correct 299 ms 23104 KB Output is correct
20 Correct 796 ms 34892 KB Output is correct
21 Correct 472 ms 28784 KB Output is correct
22 Correct 206 ms 22780 KB Output is correct
23 Correct 793 ms 34852 KB Output is correct
24 Correct 804 ms 34660 KB Output is correct
25 Correct 777 ms 34788 KB Output is correct
26 Correct 291 ms 22892 KB Output is correct
27 Correct 297 ms 22960 KB Output is correct
28 Correct 300 ms 22848 KB Output is correct
29 Correct 307 ms 22972 KB Output is correct
30 Correct 297 ms 23088 KB Output is correct
31 Correct 8 ms 7416 KB Output is correct
32 Correct 8 ms 7420 KB Output is correct
33 Correct 8 ms 7420 KB Output is correct
34 Correct 8 ms 7416 KB Output is correct
35 Correct 8 ms 7416 KB Output is correct
36 Correct 8 ms 7416 KB Output is correct
37 Correct 8 ms 7416 KB Output is correct
38 Correct 8 ms 7416 KB Output is correct
39 Correct 8 ms 7416 KB Output is correct
40 Correct 8 ms 7416 KB Output is correct
41 Correct 272 ms 16412 KB Output is correct
42 Correct 604 ms 24188 KB Output is correct
43 Correct 637 ms 24228 KB Output is correct
44 Correct 101 ms 12024 KB Output is correct
45 Correct 644 ms 24300 KB Output is correct
46 Correct 597 ms 24248 KB Output is correct
47 Correct 620 ms 24312 KB Output is correct
48 Correct 625 ms 24228 KB Output is correct
49 Correct 599 ms 24312 KB Output is correct
50 Correct 594 ms 24108 KB Output is correct
51 Correct 596 ms 24132 KB Output is correct
52 Correct 600 ms 24336 KB Output is correct
53 Correct 583 ms 24220 KB Output is correct
54 Correct 619 ms 24220 KB Output is correct
55 Correct 609 ms 24404 KB Output is correct
56 Correct 633 ms 24340 KB Output is correct
57 Correct 617 ms 24180 KB Output is correct
58 Correct 611 ms 24568 KB Output is correct
59 Correct 103 ms 12024 KB Output is correct
60 Correct 625 ms 24228 KB Output is correct
61 Correct 517 ms 25704 KB Output is correct
62 Correct 138 ms 16908 KB Output is correct
63 Correct 109 ms 12712 KB Output is correct
64 Correct 130 ms 16748 KB Output is correct
65 Correct 128 ms 16748 KB Output is correct
66 Correct 121 ms 13048 KB Output is correct
67 Correct 96 ms 12024 KB Output is correct
68 Correct 138 ms 16744 KB Output is correct
69 Correct 98 ms 12024 KB Output is correct
70 Correct 135 ms 16748 KB Output is correct
71 Correct 92 ms 12024 KB Output is correct
72 Correct 527 ms 31104 KB Output is correct
73 Correct 815 ms 35712 KB Output is correct
74 Correct 810 ms 35636 KB Output is correct
75 Correct 830 ms 35760 KB Output is correct
76 Correct 883 ms 35560 KB Output is correct
77 Correct 828 ms 35644 KB Output is correct
78 Correct 839 ms 35664 KB Output is correct
79 Correct 830 ms 35680 KB Output is correct
80 Correct 842 ms 35512 KB Output is correct
81 Correct 998 ms 35492 KB Output is correct
82 Correct 839 ms 35720 KB Output is correct
83 Correct 823 ms 35500 KB Output is correct
84 Correct 811 ms 35548 KB Output is correct
85 Correct 839 ms 35740 KB Output is correct
86 Correct 857 ms 35524 KB Output is correct
87 Correct 836 ms 35536 KB Output is correct
88 Correct 849 ms 35508 KB Output is correct
89 Correct 343 ms 25068 KB Output is correct
90 Correct 815 ms 35472 KB Output is correct
91 Correct 716 ms 36000 KB Output is correct
92 Correct 353 ms 25328 KB Output is correct
93 Correct 537 ms 49180 KB Output is correct
94 Correct 355 ms 25236 KB Output is correct
95 Correct 358 ms 25300 KB Output is correct
96 Correct 540 ms 52048 KB Output is correct
97 Correct 377 ms 27128 KB Output is correct
98 Correct 350 ms 25256 KB Output is correct
99 Correct 417 ms 27356 KB Output is correct
100 Correct 338 ms 25324 KB Output is correct