oj.uz

Submission #375730

# Submission time Handle Problem Language Result Execution time Memory
375730 2021-03-09T21:55:25 Z ijxjdjd Evacuation plan (IZhO18_plan) C++14
100 / 100
 739 ms 56916 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

using namespace std;

using ll = long long;

const int MAXN = (int)(1e5) + 5;
vector<pair<int, int>> adj[MAXN];
int closest[MAXN];


int par[MAXN];
int rk[MAXN];
int ans[MAXN];

unordered_set<int> keep[MAXN];
int find(int x) {
    if (par[x] == x) {
        return x;
    }
    else {
        return (par[x] = find(par[x]));
    }
}
void merge(int x, int y) {
    int px = find(x);
    int py = find(y);
    int res = min(closest[x], closest[y]);
    if (px != py) {
        if (rk[px] < rk[py]) {
            swap(px, py);
        }
        for (int e : keep[py]) {
            if (keep[px].count(e)) {
                keep[px].erase(e);
                ans[e] = res;
            }
            else {
                keep[px].insert(e);
            }
        }
        rk[px] += rk[py];
        par[py] = px;
    }
}
int main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N, M;
	cin >> N >> M;
	vector<pair<int, int>> edges(M);
	FR(i, N) {
        rk[i] = 1;
        par[i] = i;
	}
	FR(iter, M) {
        int a, b, w;
        cin >> a >> b >> w;
        a--, b--;
        adj[b].push_back({a, w});
        adj[a].push_back({b, w});
        edges[iter] = {a, b};
	}
	fill(all(closest), (int)(1e9));
	int K;
	cin >> K;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	FR(iter, K) {
        int a;
        cin >> a;
        a--;
        pq.push({0, a});
        closest[a]=0;
	}
	while (pq.size()) {
        auto nxt = pq.top();
        pq.pop();
        if (closest[nxt.second] == nxt.first) {
            for (auto& e : adj[nxt.second]) {
                if (closest[e.first] > closest[nxt.second] + e.second) {
                    closest[e.first] = closest[nxt.second] + e.second;
                    pq.push({closest[e.first], e.first});
                }
            }
        }
	}
	sort(all(edges), [] (const auto& lhs, auto& rhs) {
        return min(closest[lhs.first], closest[lhs.second]) > min(closest[rhs.first], closest[rhs.second]);
      });
    int Q;
    cin >> Q;
    FR(iter, Q){
        int u, v;
        cin >> u >> v;
        u--, v--;
        keep[u].insert(iter);
        keep[v].insert(iter);
    }
    for (auto& e : edges) {
        merge(e.first, e.second);
    }
    FR(i, Q) {
        cout << ans[i] << '\n';
    }
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8556 KB Output is correct
2 Correct 8 ms 8684 KB Output is correct
3 Correct 8 ms 8684 KB Output is correct
4 Correct 8 ms 8556 KB Output is correct
5 Correct 7 ms 8684 KB Output is correct
6 Correct 9 ms 8684 KB Output is correct
7 Correct 6 ms 8556 KB Output is correct
8 Correct 6 ms 8556 KB Output is correct
9 Correct 9 ms 8684 KB Output is correct
10 Correct 7 ms 8684 KB Output is correct
11 Correct 7 ms 8684 KB Output is correct
12 Correct 7 ms 8684 KB Output is correct
13 Correct 8 ms 8684 KB Output is correct
14 Correct 9 ms 8684 KB Output is correct
15 Correct 8 ms 8684 KB Output is correct
16 Correct 278 ms 24812 KB Output is correct
17 Correct 666 ms 39912 KB Output is correct
18 Correct 40 ms 11500 KB Output is correct
19 Correct 213 ms 25956 KB Output is correct
20 Correct 728 ms 40168 KB Output is correct
21 Correct 423 ms 31176 KB Output is correct
22 Correct 202 ms 23916 KB Output is correct
23 Correct 684 ms 49256 KB Output is correct
24 Correct 671 ms 49252 KB Output is correct
25 Correct 687 ms 49256 KB Output is correct
26 Correct 206 ms 28772 KB Output is correct
27 Correct 212 ms 28772 KB Output is correct
28 Correct 210 ms 28772 KB Output is correct
29 Correct 210 ms 29160 KB Output is correct
30 Correct 217 ms 28900 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 18028 KB Output is correct
2 Correct 462 ms 28392 KB Output is correct
3 Correct 437 ms 28392 KB Output is correct
4 Correct 83 ms 13292 KB Output is correct
5 Correct 448 ms 28524 KB Output is correct
6 Correct 434 ms 28524 KB Output is correct
7 Correct 461 ms 28520 KB Output is correct
8 Correct 449 ms 28392 KB Output is correct
9 Correct 455 ms 28396 KB Output is correct
10 Correct 450 ms 28480 KB Output is correct
11 Correct 443 ms 28584 KB Output is correct
12 Correct 456 ms 28392 KB Output is correct
13 Correct 441 ms 28556 KB Output is correct
14 Correct 464 ms 28432 KB Output is correct
15 Correct 473 ms 29544 KB Output is correct
16 Correct 431 ms 28392 KB Output is correct
17 Correct 441 ms 28396 KB Output is correct
18 Correct 432 ms 28488 KB Output is correct
19 Correct 65 ms 13420 KB Output is correct
20 Correct 465 ms 36588 KB Output is correct
21 Correct 420 ms 37120 KB Output is correct
22 Correct 92 ms 17248 KB Output is correct
23 Correct 82 ms 15468 KB Output is correct
24 Correct 90 ms 17248 KB Output is correct
25 Correct 89 ms 17376 KB Output is correct
26 Correct 93 ms 15596 KB Output is correct
27 Correct 104 ms 14956 KB Output is correct
28 Correct 92 ms 17248 KB Output is correct
29 Correct 86 ms 14956 KB Output is correct
30 Correct 94 ms 17248 KB Output is correct
31 Correct 84 ms 14952 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8556 KB Output is correct
2 Correct 8 ms 8684 KB Output is correct
3 Correct 8 ms 8684 KB Output is correct
4 Correct 8 ms 8556 KB Output is correct
5 Correct 7 ms 8684 KB Output is correct
6 Correct 9 ms 8684 KB Output is correct
7 Correct 6 ms 8556 KB Output is correct
8 Correct 6 ms 8556 KB Output is correct
9 Correct 9 ms 8684 KB Output is correct
10 Correct 7 ms 8684 KB Output is correct
11 Correct 7 ms 8684 KB Output is correct
12 Correct 7 ms 8684 KB Output is correct
13 Correct 8 ms 8684 KB Output is correct
14 Correct 9 ms 8684 KB Output is correct
15 Correct 8 ms 8684 KB Output is correct
16 Correct 278 ms 24812 KB Output is correct
17 Correct 666 ms 39912 KB Output is correct
18 Correct 40 ms 11500 KB Output is correct
19 Correct 213 ms 25956 KB Output is correct
20 Correct 728 ms 40168 KB Output is correct
21 Correct 423 ms 31176 KB Output is correct
22 Correct 202 ms 23916 KB Output is correct
23 Correct 684 ms 49256 KB Output is correct
24 Correct 671 ms 49252 KB Output is correct
25 Correct 687 ms 49256 KB Output is correct
26 Correct 206 ms 28772 KB Output is correct
27 Correct 212 ms 28772 KB Output is correct
28 Correct 210 ms 28772 KB Output is correct
29 Correct 210 ms 29160 KB Output is correct
30 Correct 217 ms 28900 KB Output is correct
31 Correct 6 ms 8556 KB Output is correct
32 Correct 6 ms 8556 KB Output is correct
33 Correct 8 ms 8556 KB Output is correct
34 Correct 6 ms 8556 KB Output is correct
35 Correct 7 ms 8556 KB Output is correct
36 Correct 6 ms 8556 KB Output is correct
37 Correct 6 ms 8556 KB Output is correct
38 Correct 6 ms 8556 KB Output is correct
39 Correct 6 ms 8556 KB Output is correct
40 Correct 6 ms 8556 KB Output is correct
41 Correct 195 ms 18028 KB Output is correct
42 Correct 462 ms 28392 KB Output is correct
43 Correct 437 ms 28392 KB Output is correct
44 Correct 83 ms 13292 KB Output is correct
45 Correct 448 ms 28524 KB Output is correct
46 Correct 434 ms 28524 KB Output is correct
47 Correct 461 ms 28520 KB Output is correct
48 Correct 449 ms 28392 KB Output is correct
49 Correct 455 ms 28396 KB Output is correct
50 Correct 450 ms 28480 KB Output is correct
51 Correct 443 ms 28584 KB Output is correct
52 Correct 456 ms 28392 KB Output is correct
53 Correct 441 ms 28556 KB Output is correct
54 Correct 464 ms 28432 KB Output is correct
55 Correct 473 ms 29544 KB Output is correct
56 Correct 431 ms 28392 KB Output is correct
57 Correct 441 ms 28396 KB Output is correct
58 Correct 432 ms 28488 KB Output is correct
59 Correct 65 ms 13420 KB Output is correct
60 Correct 465 ms 36588 KB Output is correct
61 Correct 420 ms 37120 KB Output is correct
62 Correct 92 ms 17248 KB Output is correct
63 Correct 82 ms 15468 KB Output is correct
64 Correct 90 ms 17248 KB Output is correct
65 Correct 89 ms 17376 KB Output is correct
66 Correct 93 ms 15596 KB Output is correct
67 Correct 104 ms 14956 KB Output is correct
68 Correct 92 ms 17248 KB Output is correct
69 Correct 86 ms 14956 KB Output is correct
70 Correct 94 ms 17248 KB Output is correct
71 Correct 84 ms 14952 KB Output is correct
72 Correct 426 ms 37480 KB Output is correct
73 Correct 657 ms 50104 KB Output is correct
74 Correct 670 ms 50020 KB Output is correct
75 Correct 673 ms 49944 KB Output is correct
76 Correct 672 ms 50152 KB Output is correct
77 Correct 675 ms 49896 KB Output is correct
78 Correct 680 ms 49996 KB Output is correct
79 Correct 686 ms 50020 KB Output is correct
80 Correct 645 ms 50020 KB Output is correct
81 Correct 681 ms 49844 KB Output is correct
82 Correct 713 ms 49896 KB Output is correct
83 Correct 683 ms 50024 KB Output is correct
84 Correct 677 ms 49896 KB Output is correct
85 Correct 677 ms 50276 KB Output is correct
86 Correct 674 ms 49896 KB Output is correct
87 Correct 678 ms 50152 KB Output is correct
88 Correct 739 ms 49892 KB Output is correct
89 Correct 248 ms 29044 KB Output is correct
90 Correct 692 ms 49988 KB Output is correct
91 Correct 695 ms 52328 KB Output is correct
92 Correct 293 ms 30052 KB Output is correct
93 Correct 446 ms 54784 KB Output is correct
94 Correct 270 ms 29924 KB Output is correct
95 Correct 276 ms 30052 KB Output is correct
96 Correct 521 ms 56916 KB Output is correct
97 Correct 288 ms 30724 KB Output is correct
98 Correct 275 ms 30064 KB Output is correct
99 Correct 281 ms 30852 KB Output is correct
100 Correct 299 ms 30052 KB Output is correct