oj.uz

Submission #387503

# Submission time Handle Problem Language Result Execution time Memory
387503 2021-04-08T15:36:35 Z parsabahrami Evacuation plan (IZhO18_plan) C++17
100 / 100
 840 ms 71776 KB 
// I can feel death, can see its beady eyes
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 5e5 + 10;
int dp[N], ret[N], fr[N], to[N], w[N], M[N], ord[N], s[N], t[N], P[N], n, m, k;
vector<int> adj[N]; unordered_set<int> Q[N];

int Find(int v) {
    return !P[v] ? v : P[v] = Find(P[v]);
}

void Union(int u, int v, int x) {
    u = Find(u), v = Find(v);
    if (u == v) return;
    if (SZ(Q[u]) > SZ(Q[v])) swap(u, v);
    for (int id : Q[u]) {
        if (Q[v].find(id) != Q[v].end()) { ret[id] = x; Q[v].erase(id); }
        else Q[v].insert(id);
    }
    Q[u] = {}, P[u] = v;
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d", &fr[i], &to[i], &w[i]);
        adj[fr[i]].push_back(i);
        adj[to[i]].push_back(i);
    }
    scanf("%d", &k); priority_queue<pii> pq;
    fill(dp, dp + N, 1e9);
    for (int i = 1; i <= k; i++) {
        int v; scanf("%d", &v);
        pq.push({dp[v] = 0, v});
    }
    while (SZ(pq)) {
        int v = pq.top().S; pq.pop();
        if (M[v]) continue;
        M[v] = 1;
        for (int id : adj[v]) {
            int u = fr[id] ^ to[id] ^ v; 
            if (dp[u] > dp[v] + w[id]) 
                dp[u] = dp[v] + w[id], pq.push({-dp[u], u});
        }
    }
    iota(ord + 1, ord + m + 1, 1);
    sort(ord + 1, ord + m + 1, [&] (int a, int b) { return min(dp[fr[a]], dp[to[a]]) > min(dp[fr[b]], dp[to[b]]); });
    int q; scanf("%d", &q);
    for (int i = 1; i <= q; i++) {
        scanf("%d%d", &s[i], &t[i]);
        Q[s[i]].insert(i), Q[t[i]].insert(i);
    }
    for (int _ = 1; _ <= m; _++) {
        int i = ord[_];
        Union(fr[i], to[i], min(dp[fr[i]], dp[to[i]]));
    }
    for (int i = 1; i <= q; i++) 
        printf("%d\n", ret[i]);
    return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
plan.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |         scanf("%d%d%d", &fr[i], &to[i], &w[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |     scanf("%d", &k); priority_queue<pii> pq;
      |     ~~~~~^~~~~~~~~~
plan.cpp:42:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |         int v; scanf("%d", &v);
      |                ~~~~~^~~~~~~~~~
plan.cpp:57:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |     int q; scanf("%d", &q);
      |            ~~~~~^~~~~~~~~~
plan.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |         scanf("%d%d", &s[i], &t[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 41452 KB Output is correct
2 Correct 33 ms 41708 KB Output is correct
3 Correct 34 ms 41708 KB Output is correct
4 Correct 31 ms 41452 KB Output is correct
5 Correct 33 ms 41708 KB Output is correct
6 Correct 33 ms 41708 KB Output is correct
7 Correct 32 ms 41452 KB Output is correct
8 Correct 31 ms 41452 KB Output is correct
9 Correct 34 ms 41708 KB Output is correct
10 Correct 33 ms 41708 KB Output is correct
11 Correct 34 ms 41708 KB Output is correct
12 Correct 34 ms 41708 KB Output is correct
13 Correct 34 ms 41708 KB Output is correct
14 Correct 34 ms 41708 KB Output is correct
15 Correct 34 ms 41836 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 41452 KB Output is correct
2 Correct 33 ms 41708 KB Output is correct
3 Correct 34 ms 41708 KB Output is correct
4 Correct 31 ms 41452 KB Output is correct
5 Correct 33 ms 41708 KB Output is correct
6 Correct 33 ms 41708 KB Output is correct
7 Correct 32 ms 41452 KB Output is correct
8 Correct 31 ms 41452 KB Output is correct
9 Correct 34 ms 41708 KB Output is correct
10 Correct 33 ms 41708 KB Output is correct
11 Correct 34 ms 41708 KB Output is correct
12 Correct 34 ms 41708 KB Output is correct
13 Correct 34 ms 41708 KB Output is correct
14 Correct 34 ms 41708 KB Output is correct
15 Correct 34 ms 41836 KB Output is correct
16 Correct 327 ms 58984 KB Output is correct
17 Correct 794 ms 71720 KB Output is correct
18 Correct 72 ms 45188 KB Output is correct
19 Correct 248 ms 61284 KB Output is correct
20 Correct 784 ms 71776 KB Output is correct
21 Correct 477 ms 63200 KB Output is correct
22 Correct 228 ms 59628 KB Output is correct
23 Correct 840 ms 71648 KB Output is correct
24 Correct 791 ms 71740 KB Output is correct
25 Correct 805 ms 71720 KB Output is correct
26 Correct 253 ms 61028 KB Output is correct
27 Correct 254 ms 61284 KB Output is correct
28 Correct 256 ms 61052 KB Output is correct
29 Correct 251 ms 61156 KB Output is correct
30 Correct 260 ms 61268 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 41452 KB Output is correct
2 Correct 31 ms 41452 KB Output is correct
3 Correct 31 ms 41452 KB Output is correct
4 Correct 34 ms 41452 KB Output is correct
5 Correct 32 ms 41452 KB Output is correct
6 Correct 31 ms 41452 KB Output is correct
7 Correct 33 ms 41452 KB Output is correct
8 Correct 32 ms 41452 KB Output is correct
9 Correct 31 ms 41452 KB Output is correct
10 Correct 31 ms 41452 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 51428 KB Output is correct
2 Correct 590 ms 60640 KB Output is correct
3 Correct 599 ms 60384 KB Output is correct
4 Correct 117 ms 48236 KB Output is correct
5 Correct 578 ms 60500 KB Output is correct
6 Correct 596 ms 60512 KB Output is correct
7 Correct 589 ms 60200 KB Output is correct
8 Correct 608 ms 60128 KB Output is correct
9 Correct 595 ms 60196 KB Output is correct
10 Correct 561 ms 60128 KB Output is correct
11 Correct 572 ms 60384 KB Output is correct
12 Correct 590 ms 60256 KB Output is correct
13 Correct 657 ms 60128 KB Output is correct
14 Correct 595 ms 60256 KB Output is correct
15 Correct 574 ms 60476 KB Output is correct
16 Correct 584 ms 60396 KB Output is correct
17 Correct 586 ms 60000 KB Output is correct
18 Correct 682 ms 60000 KB Output is correct
19 Correct 99 ms 47724 KB Output is correct
20 Correct 601 ms 60048 KB Output is correct
21 Correct 508 ms 59744 KB Output is correct
22 Correct 130 ms 48996 KB Output is correct
23 Correct 148 ms 47852 KB Output is correct
24 Correct 133 ms 48996 KB Output is correct
25 Correct 136 ms 48996 KB Output is correct
26 Correct 138 ms 47852 KB Output is correct
27 Correct 120 ms 47596 KB Output is correct
28 Correct 134 ms 48868 KB Output is correct
29 Correct 118 ms 47596 KB Output is correct
30 Correct 132 ms 48868 KB Output is correct
31 Correct 123 ms 47596 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 41452 KB Output is correct
2 Correct 33 ms 41708 KB Output is correct
3 Correct 34 ms 41708 KB Output is correct
4 Correct 31 ms 41452 KB Output is correct
5 Correct 33 ms 41708 KB Output is correct
6 Correct 33 ms 41708 KB Output is correct
7 Correct 32 ms 41452 KB Output is correct
8 Correct 31 ms 41452 KB Output is correct
9 Correct 34 ms 41708 KB Output is correct
10 Correct 33 ms 41708 KB Output is correct
11 Correct 34 ms 41708 KB Output is correct
12 Correct 34 ms 41708 KB Output is correct
13 Correct 34 ms 41708 KB Output is correct
14 Correct 34 ms 41708 KB Output is correct
15 Correct 34 ms 41836 KB Output is correct
16 Correct 327 ms 58984 KB Output is correct
17 Correct 794 ms 71720 KB Output is correct
18 Correct 72 ms 45188 KB Output is correct
19 Correct 248 ms 61284 KB Output is correct
20 Correct 784 ms 71776 KB Output is correct
21 Correct 477 ms 63200 KB Output is correct
22 Correct 228 ms 59628 KB Output is correct
23 Correct 840 ms 71648 KB Output is correct
24 Correct 791 ms 71740 KB Output is correct
25 Correct 805 ms 71720 KB Output is correct
26 Correct 253 ms 61028 KB Output is correct
27 Correct 254 ms 61284 KB Output is correct
28 Correct 256 ms 61052 KB Output is correct
29 Correct 251 ms 61156 KB Output is correct
30 Correct 260 ms 61268 KB Output is correct
31 Correct 32 ms 41452 KB Output is correct
32 Correct 31 ms 41452 KB Output is correct
33 Correct 31 ms 41452 KB Output is correct
34 Correct 34 ms 41452 KB Output is correct
35 Correct 32 ms 41452 KB Output is correct
36 Correct 31 ms 41452 KB Output is correct
37 Correct 33 ms 41452 KB Output is correct
38 Correct 32 ms 41452 KB Output is correct
39 Correct 31 ms 41452 KB Output is correct
40 Correct 31 ms 41452 KB Output is correct
41 Correct 267 ms 51428 KB Output is correct
42 Correct 590 ms 60640 KB Output is correct
43 Correct 599 ms 60384 KB Output is correct
44 Correct 117 ms 48236 KB Output is correct
45 Correct 578 ms 60500 KB Output is correct
46 Correct 596 ms 60512 KB Output is correct
47 Correct 589 ms 60200 KB Output is correct
48 Correct 608 ms 60128 KB Output is correct
49 Correct 595 ms 60196 KB Output is correct
50 Correct 561 ms 60128 KB Output is correct
51 Correct 572 ms 60384 KB Output is correct
52 Correct 590 ms 60256 KB Output is correct
53 Correct 657 ms 60128 KB Output is correct
54 Correct 595 ms 60256 KB Output is correct
55 Correct 574 ms 60476 KB Output is correct
56 Correct 584 ms 60396 KB Output is correct
57 Correct 586 ms 60000 KB Output is correct
58 Correct 682 ms 60000 KB Output is correct
59 Correct 99 ms 47724 KB Output is correct
60 Correct 601 ms 60048 KB Output is correct
61 Correct 508 ms 59744 KB Output is correct
62 Correct 130 ms 48996 KB Output is correct
63 Correct 148 ms 47852 KB Output is correct
64 Correct 133 ms 48996 KB Output is correct
65 Correct 136 ms 48996 KB Output is correct
66 Correct 138 ms 47852 KB Output is correct
67 Correct 120 ms 47596 KB Output is correct
68 Correct 134 ms 48868 KB Output is correct
69 Correct 118 ms 47596 KB Output is correct
70 Correct 132 ms 48868 KB Output is correct
71 Correct 123 ms 47596 KB Output is correct
72 Correct 510 ms 62976 KB Output is correct
73 Correct 814 ms 71392 KB Output is correct
74 Correct 797 ms 71264 KB Output is correct
75 Correct 820 ms 71136 KB Output is correct
76 Correct 819 ms 71008 KB Output is correct
77 Correct 807 ms 71008 KB Output is correct
78 Correct 836 ms 71008 KB Output is correct
79 Correct 822 ms 71008 KB Output is correct
80 Correct 826 ms 70920 KB Output is correct
81 Correct 816 ms 70880 KB Output is correct
82 Correct 820 ms 71008 KB Output is correct
83 Correct 802 ms 70752 KB Output is correct
84 Correct 795 ms 70752 KB Output is correct
85 Correct 828 ms 71004 KB Output is correct
86 Correct 815 ms 70940 KB Output is correct
87 Correct 795 ms 70880 KB Output is correct
88 Correct 798 ms 70752 KB Output is correct
89 Correct 307 ms 59240 KB Output is correct
90 Correct 805 ms 70880 KB Output is correct
91 Correct 743 ms 70752 KB Output is correct
92 Correct 338 ms 60132 KB Output is correct
93 Correct 507 ms 65884 KB Output is correct
94 Correct 343 ms 60004 KB Output is correct
95 Correct 338 ms 60132 KB Output is correct
96 Correct 592 ms 66136 KB Output is correct
97 Correct 352 ms 59468 KB Output is correct
98 Correct 347 ms 60160 KB Output is correct
99 Correct 350 ms 59260 KB Output is correct
100 Correct 345 ms 60260 KB Output is correct