oj.uz

답안 #878789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878789 2023-11-25T08:32:34 Z The_Samurai Evacuation plan (IZhO18_plan) C++17
100 / 100
 321 ms 39732 KB 
#include <random>

#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int inf = 1e9;
const int N = 1e5 + 5;

vector<pair<int, int>> g[N], queries[N];
pair<int, int> danger[N];
vector<bool> vis(N);
vector<int> v[N];
int ans[N], now, p[N], sz[N];

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

void add(int a, int b) {
    a = get(a); b = get(b);
    if (a == b) return;
    if (sz[a] > sz[b]) swap(a, b);
    sz[b] += sz[a];
    for (int s: v[a]) {
        for (auto [t, i]: queries[s]) {
            if (get(t) == b) ans[i] = now;
        }
        v[b].emplace_back(s);
    }
    p[a] = b;
}

void solve() {
    int n, m, q;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }
    for (int i = 1; i <= n; i++) danger[i] = make_pair(inf, i);
    {
        int k;
        cin >> k;
        priority_queue<pair<int, int>> pq;
        for (int i = 0; i < k; i++) {
            int root;
            cin >> root;
            pq.emplace(0, root);
            danger[root].first = 0;
        }
        while (!pq.empty()) {
            auto [d, u] = pq.top(); pq.pop();
            d = -d;
            if (vis[u]) continue;
            vis[u] = true;
            for (auto [v, w]: g[u]) {
                if (danger[v].first <= d + w) continue;
                danger[v].first = d + w;
                pq.emplace(-danger[v].first, v);
            }
        }
        sort(danger + 1, danger + n + 1);
    }
    cin >> q;
    vector<int> copy(n + 1);
    for (int i = 0; i < q; i++) {
        int s, t;
        cin >> s >> t;
        queries[s].emplace_back(t, i);
        queries[t].emplace_back(s, i);
    }

    for (int i = 1; i <= n; i++) {
        copy[danger[i].second] = danger[i].first;
        p[i] = i;
        sz[i] = (int) queries[i].size() + 1;
        v[i] = {i};
    }
    for (int i = n; i > 0; i--) {
        now = danger[i].first;
        int u = danger[i].second;
        for (auto [vv, w]: g[u]) {
            if (copy[vv] < now) continue;
            add(u, vv);
        }
    }
    for (int i = 0; i < q; i++) cout << ans[i] << '\n';
}

int main() {
    srand(time(0));
    cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int queries = 1;
//    cin >> queries;

    for (int test_case = 1; test_case <= queries; test_case++) {
#ifdef sunnatov
        cout << "Test case: " << test_case << endl;
#endif
        solve();
        cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 2 ms 9256 KB Output is correct
5 Correct 4 ms 9304 KB Output is correct
6 Correct 3 ms 9236 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 3 ms 9248 KB Output is correct
10 Correct 3 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 3 ms 9308 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct
15 Correct 3 ms 9340 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 2 ms 9256 KB Output is correct
5 Correct 4 ms 9304 KB Output is correct
6 Correct 3 ms 9236 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 3 ms 9248 KB Output is correct
10 Correct 3 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 3 ms 9308 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct
15 Correct 3 ms 9340 KB Output is correct
16 Correct 136 ms 19980 KB Output is correct
17 Correct 295 ms 29980 KB Output is correct
18 Correct 21 ms 11264 KB Output is correct
19 Correct 93 ms 22052 KB Output is correct
20 Correct 288 ms 30612 KB Output is correct
21 Correct 170 ms 23364 KB Output is correct
22 Correct 85 ms 20468 KB Output is correct
23 Correct 285 ms 30140 KB Output is correct
24 Correct 293 ms 29968 KB Output is correct
25 Correct 265 ms 29848 KB Output is correct
26 Correct 95 ms 21812 KB Output is correct
27 Correct 95 ms 21812 KB Output is correct
28 Correct 100 ms 21820 KB Output is correct
29 Correct 97 ms 21784 KB Output is correct
30 Correct 100 ms 22052 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 19788 KB Output is correct
2 Correct 239 ms 26504 KB Output is correct
3 Correct 225 ms 26516 KB Output is correct
4 Correct 61 ms 17020 KB Output is correct
5 Correct 279 ms 26324 KB Output is correct
6 Correct 224 ms 26288 KB Output is correct
7 Correct 257 ms 26664 KB Output is correct
8 Correct 230 ms 26512 KB Output is correct
9 Correct 263 ms 26500 KB Output is correct
10 Correct 252 ms 26348 KB Output is correct
11 Correct 226 ms 26480 KB Output is correct
12 Correct 234 ms 26588 KB Output is correct
13 Correct 246 ms 26336 KB Output is correct
14 Correct 220 ms 26312 KB Output is correct
15 Correct 242 ms 26304 KB Output is correct
16 Correct 252 ms 26324 KB Output is correct
17 Correct 261 ms 26332 KB Output is correct
18 Correct 239 ms 26336 KB Output is correct
19 Correct 56 ms 16644 KB Output is correct
20 Correct 232 ms 26356 KB Output is correct
21 Correct 219 ms 26420 KB Output is correct
22 Correct 60 ms 17668 KB Output is correct
23 Correct 62 ms 18384 KB Output is correct
24 Correct 58 ms 17712 KB Output is correct
25 Correct 57 ms 17708 KB Output is correct
26 Correct 75 ms 18948 KB Output is correct
27 Correct 46 ms 16832 KB Output is correct
28 Correct 58 ms 17792 KB Output is correct
29 Correct 46 ms 16888 KB Output is correct
30 Correct 72 ms 17716 KB Output is correct
31 Correct 47 ms 16732 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 2 ms 9256 KB Output is correct
5 Correct 4 ms 9304 KB Output is correct
6 Correct 3 ms 9236 KB Output is correct
7 Correct 2 ms 9308 KB Output is correct
8 Correct 2 ms 9308 KB Output is correct
9 Correct 3 ms 9248 KB Output is correct
10 Correct 3 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 3 ms 9308 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct
15 Correct 3 ms 9340 KB Output is correct
16 Correct 136 ms 19980 KB Output is correct
17 Correct 295 ms 29980 KB Output is correct
18 Correct 21 ms 11264 KB Output is correct
19 Correct 93 ms 22052 KB Output is correct
20 Correct 288 ms 30612 KB Output is correct
21 Correct 170 ms 23364 KB Output is correct
22 Correct 85 ms 20468 KB Output is correct
23 Correct 285 ms 30140 KB Output is correct
24 Correct 293 ms 29968 KB Output is correct
25 Correct 265 ms 29848 KB Output is correct
26 Correct 95 ms 21812 KB Output is correct
27 Correct 95 ms 21812 KB Output is correct
28 Correct 100 ms 21820 KB Output is correct
29 Correct 97 ms 21784 KB Output is correct
30 Correct 100 ms 22052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9048 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 2 ms 9052 KB Output is correct
36 Correct 3 ms 9308 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct
38 Correct 2 ms 9052 KB Output is correct
39 Correct 2 ms 9052 KB Output is correct
40 Correct 2 ms 9308 KB Output is correct
41 Correct 124 ms 19788 KB Output is correct
42 Correct 239 ms 26504 KB Output is correct
43 Correct 225 ms 26516 KB Output is correct
44 Correct 61 ms 17020 KB Output is correct
45 Correct 279 ms 26324 KB Output is correct
46 Correct 224 ms 26288 KB Output is correct
47 Correct 257 ms 26664 KB Output is correct
48 Correct 230 ms 26512 KB Output is correct
49 Correct 263 ms 26500 KB Output is correct
50 Correct 252 ms 26348 KB Output is correct
51 Correct 226 ms 26480 KB Output is correct
52 Correct 234 ms 26588 KB Output is correct
53 Correct 246 ms 26336 KB Output is correct
54 Correct 220 ms 26312 KB Output is correct
55 Correct 242 ms 26304 KB Output is correct
56 Correct 252 ms 26324 KB Output is correct
57 Correct 261 ms 26332 KB Output is correct
58 Correct 239 ms 26336 KB Output is correct
59 Correct 56 ms 16644 KB Output is correct
60 Correct 232 ms 26356 KB Output is correct
61 Correct 219 ms 26420 KB Output is correct
62 Correct 60 ms 17668 KB Output is correct
63 Correct 62 ms 18384 KB Output is correct
64 Correct 58 ms 17712 KB Output is correct
65 Correct 57 ms 17708 KB Output is correct
66 Correct 75 ms 18948 KB Output is correct
67 Correct 46 ms 16832 KB Output is correct
68 Correct 58 ms 17792 KB Output is correct
69 Correct 46 ms 16888 KB Output is correct
70 Correct 72 ms 17716 KB Output is correct
71 Correct 47 ms 16732 KB Output is correct
72 Correct 150 ms 23548 KB Output is correct
73 Correct 280 ms 39392 KB Output is correct
74 Correct 281 ms 39452 KB Output is correct
75 Correct 276 ms 39444 KB Output is correct
76 Correct 294 ms 39488 KB Output is correct
77 Correct 275 ms 39392 KB Output is correct
78 Correct 321 ms 39732 KB Output is correct
79 Correct 275 ms 39384 KB Output is correct
80 Correct 272 ms 39644 KB Output is correct
81 Correct 283 ms 39404 KB Output is correct
82 Correct 272 ms 39388 KB Output is correct
83 Correct 311 ms 39400 KB Output is correct
84 Correct 289 ms 39376 KB Output is correct
85 Correct 313 ms 39636 KB Output is correct
86 Correct 285 ms 39388 KB Output is correct
87 Correct 309 ms 39684 KB Output is correct
88 Correct 302 ms 39372 KB Output is correct
89 Correct 89 ms 23756 KB Output is correct
90 Correct 310 ms 39332 KB Output is correct
91 Correct 289 ms 39704 KB Output is correct
92 Correct 110 ms 24328 KB Output is correct
93 Correct 113 ms 25324 KB Output is correct
94 Correct 99 ms 24088 KB Output is correct
95 Correct 103 ms 24164 KB Output is correct
96 Correct 131 ms 25788 KB Output is correct
97 Correct 96 ms 23412 KB Output is correct
98 Correct 104 ms 24100 KB Output is correct
99 Correct 105 ms 23640 KB Output is correct
100 Correct 105 ms 24392 KB Output is correct