oj.uz

Submission #545315

# Submission time Handle Problem Language Result Execution time Memory
545315 2022-04-04T08:49:51 Z Ai7081 Evacuation plan (IZhO18_plan) C++17
100 / 100
 1370 ms 41820 KB 
#include <bits/stdc++.h>
using namespace std;
const bool debug = 1;

const int N = 100005;
const int inf = 1e9;

struct node{
    int dis, v;
    bool operator < (const node &o) const { return dis > o.dis; }
};

int n, m, q, a, b, c, dis[N], l[N], r[N], g[N];
pair<int, int> que[N];
vector<pair<int, int>> adj[N], ord;
vector<int> test[N];
priority_queue<node> pq;
bool mark[N];

int findg(int x) {
    if (g[x] == x) return x;
    return g[x] = findg(g[x]);
}

int main() {
    scanf(" %d %d", &n, &m);
    while (m--) {
        scanf(" %d %d %d", &a, &b, &c);
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }
    fill_n(dis, N, inf);
    scanf(" %d", &a);
    while (a--) {
        scanf(" %d", &b);
        pq.push({0, b});
        dis[b] = 0;
    }
    scanf(" %d", &q);
    for (int i=0; i<q; i++) scanf(" %d %d", &que[i].first, &que[i].second);

    while (!pq.empty()) {
        int v = pq.top().v, d = pq.top().dis;
        pq.pop();
        if (mark[v]) continue;
        mark[v] = true;
        for (auto [to, w] : adj[v]) {
            if (!mark[to] && dis[to] > d+w) {
                dis[to] = d+w;
                pq.push({dis[to], to});
            }
        }
    }
    for (int i=1; i<=n; i++) ord.push_back({dis[i], i});
    sort(ord.begin(), ord.end(), greater<pair<int, int>>());

    bool con = true;
    fill_n(r, N, n-1);
    while (con) {
        con = false;
        fill_n(test, N, vector<int>());
        fill_n(mark, N, false);
        for (int i=1; i<=n; i++) g[i] = i;
        for (int i=0; i<q; i++) {
            if (l[i] != r[i]) {
                test[(l[i]+r[i])/2].push_back(i);
                con = true;
            }
        }
        for (int i=0; i<n; i++) {
            int v = ord[i].second;
            mark[v] = true;
            for (auto [to, w] : adj[v]) if (mark[to]) g[findg(to)] = findg(v);
            for (auto it : test[i]) {
                if (findg(que[it].first) == findg(que[it].second)) r[it] = i;
                else l[it] = i+1;
            }
        }
    }
    for (int i=0; i<q; i++) printf("%d\n", ord[l[i]].first);
    return 0;
}

/*
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:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf(" %d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
plan.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf(" %d %d %d", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf(" %d", &a);
      |     ~~~~~^~~~~~~~~~~
plan.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         scanf(" %d", &b);
      |         ~~~~~^~~~~~~~~~~
plan.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf(" %d", &q);
      |     ~~~~~^~~~~~~~~~~
plan.cpp:40:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     for (int i=0; i<q; i++) scanf(" %d %d", &que[i].first, &que[i].second);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5896 KB Output is correct
2 Correct 5 ms 5972 KB Output is correct
3 Correct 5 ms 5972 KB Output is correct
4 Correct 4 ms 5844 KB Output is correct
5 Correct 5 ms 5972 KB Output is correct
6 Correct 5 ms 5972 KB Output is correct
7 Correct 4 ms 5844 KB Output is correct
8 Correct 4 ms 5844 KB Output is correct
9 Correct 6 ms 5972 KB Output is correct
10 Correct 5 ms 5972 KB Output is correct
11 Correct 5 ms 5972 KB Output is correct
12 Correct 5 ms 5972 KB Output is correct
13 Correct 5 ms 5972 KB Output is correct
14 Correct 7 ms 5972 KB Output is correct
15 Correct 5 ms 6052 KB Output is correct
16 Correct 403 ms 24408 KB Output is correct
17 Correct 1312 ms 41680 KB Output is correct
18 Correct 66 ms 9036 KB Output is correct
19 Correct 204 ms 23720 KB Output is correct
20 Correct 1273 ms 41648 KB Output is correct
21 Correct 631 ms 29512 KB Output is correct
22 Correct 263 ms 25380 KB Output is correct
23 Correct 1287 ms 41644 KB Output is correct
24 Correct 1278 ms 41608 KB Output is correct
25 Correct 1266 ms 41552 KB Output is correct
26 Correct 209 ms 23476 KB Output is correct
27 Correct 206 ms 23160 KB Output is correct
28 Correct 211 ms 23416 KB Output is correct
29 Correct 207 ms 23592 KB Output is correct
30 Correct 199 ms 23380 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 565 ms 17296 KB Output is correct
2 Correct 1087 ms 30256 KB Output is correct
3 Correct 1099 ms 30344 KB Output is correct
4 Correct 157 ms 12720 KB Output is correct
5 Correct 1065 ms 30396 KB Output is correct
6 Correct 1094 ms 30544 KB Output is correct
7 Correct 1099 ms 30480 KB Output is correct
8 Correct 1037 ms 30356 KB Output is correct
9 Correct 1134 ms 30300 KB Output is correct
10 Correct 1035 ms 30676 KB Output is correct
11 Correct 1093 ms 30320 KB Output is correct
12 Correct 1091 ms 30372 KB Output is correct
13 Correct 1118 ms 30236 KB Output is correct
14 Correct 1073 ms 30420 KB Output is correct
15 Correct 1066 ms 31296 KB Output is correct
16 Correct 1132 ms 30376 KB Output is correct
17 Correct 1038 ms 30348 KB Output is correct
18 Correct 1134 ms 30456 KB Output is correct
19 Correct 128 ms 12660 KB Output is correct
20 Correct 1052 ms 30336 KB Output is correct
21 Correct 885 ms 30588 KB Output is correct
22 Correct 154 ms 13508 KB Output is correct
23 Correct 152 ms 12464 KB Output is correct
24 Correct 142 ms 13500 KB Output is correct
25 Correct 149 ms 13552 KB Output is correct
26 Correct 240 ms 12432 KB Output is correct
27 Correct 140 ms 12500 KB Output is correct
28 Correct 142 ms 13508 KB Output is correct
29 Correct 140 ms 12524 KB Output is correct
30 Correct 139 ms 13476 KB Output is correct
31 Correct 142 ms 12484 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5896 KB Output is correct
2 Correct 5 ms 5972 KB Output is correct
3 Correct 5 ms 5972 KB Output is correct
4 Correct 4 ms 5844 KB Output is correct
5 Correct 5 ms 5972 KB Output is correct
6 Correct 5 ms 5972 KB Output is correct
7 Correct 4 ms 5844 KB Output is correct
8 Correct 4 ms 5844 KB Output is correct
9 Correct 6 ms 5972 KB Output is correct
10 Correct 5 ms 5972 KB Output is correct
11 Correct 5 ms 5972 KB Output is correct
12 Correct 5 ms 5972 KB Output is correct
13 Correct 5 ms 5972 KB Output is correct
14 Correct 7 ms 5972 KB Output is correct
15 Correct 5 ms 6052 KB Output is correct
16 Correct 403 ms 24408 KB Output is correct
17 Correct 1312 ms 41680 KB Output is correct
18 Correct 66 ms 9036 KB Output is correct
19 Correct 204 ms 23720 KB Output is correct
20 Correct 1273 ms 41648 KB Output is correct
21 Correct 631 ms 29512 KB Output is correct
22 Correct 263 ms 25380 KB Output is correct
23 Correct 1287 ms 41644 KB Output is correct
24 Correct 1278 ms 41608 KB Output is correct
25 Correct 1266 ms 41552 KB Output is correct
26 Correct 209 ms 23476 KB Output is correct
27 Correct 206 ms 23160 KB Output is correct
28 Correct 211 ms 23416 KB Output is correct
29 Correct 207 ms 23592 KB Output is correct
30 Correct 199 ms 23380 KB Output is correct
31 Correct 4 ms 5780 KB Output is correct
32 Correct 4 ms 5844 KB Output is correct
33 Correct 3 ms 5844 KB Output is correct
34 Correct 4 ms 5844 KB Output is correct
35 Correct 4 ms 5908 KB Output is correct
36 Correct 3 ms 5844 KB Output is correct
37 Correct 4 ms 5844 KB Output is correct
38 Correct 4 ms 5788 KB Output is correct
39 Correct 4 ms 5844 KB Output is correct
40 Correct 4 ms 5844 KB Output is correct
41 Correct 565 ms 17296 KB Output is correct
42 Correct 1087 ms 30256 KB Output is correct
43 Correct 1099 ms 30344 KB Output is correct
44 Correct 157 ms 12720 KB Output is correct
45 Correct 1065 ms 30396 KB Output is correct
46 Correct 1094 ms 30544 KB Output is correct
47 Correct 1099 ms 30480 KB Output is correct
48 Correct 1037 ms 30356 KB Output is correct
49 Correct 1134 ms 30300 KB Output is correct
50 Correct 1035 ms 30676 KB Output is correct
51 Correct 1093 ms 30320 KB Output is correct
52 Correct 1091 ms 30372 KB Output is correct
53 Correct 1118 ms 30236 KB Output is correct
54 Correct 1073 ms 30420 KB Output is correct
55 Correct 1066 ms 31296 KB Output is correct
56 Correct 1132 ms 30376 KB Output is correct
57 Correct 1038 ms 30348 KB Output is correct
58 Correct 1134 ms 30456 KB Output is correct
59 Correct 128 ms 12660 KB Output is correct
60 Correct 1052 ms 30336 KB Output is correct
61 Correct 885 ms 30588 KB Output is correct
62 Correct 154 ms 13508 KB Output is correct
63 Correct 152 ms 12464 KB Output is correct
64 Correct 142 ms 13500 KB Output is correct
65 Correct 149 ms 13552 KB Output is correct
66 Correct 240 ms 12432 KB Output is correct
67 Correct 140 ms 12500 KB Output is correct
68 Correct 142 ms 13508 KB Output is correct
69 Correct 140 ms 12524 KB Output is correct
70 Correct 139 ms 13476 KB Output is correct
71 Correct 142 ms 12484 KB Output is correct
72 Correct 778 ms 29168 KB Output is correct
73 Correct 1339 ms 41632 KB Output is correct
74 Correct 1327 ms 41668 KB Output is correct
75 Correct 1301 ms 41656 KB Output is correct
76 Correct 1304 ms 41452 KB Output is correct
77 Correct 1319 ms 41636 KB Output is correct
78 Correct 1290 ms 41572 KB Output is correct
79 Correct 1293 ms 41448 KB Output is correct
80 Correct 1353 ms 41528 KB Output is correct
81 Correct 1280 ms 41560 KB Output is correct
82 Correct 1320 ms 41752 KB Output is correct
83 Correct 1264 ms 41532 KB Output is correct
84 Correct 1370 ms 41472 KB Output is correct
85 Correct 1267 ms 41820 KB Output is correct
86 Correct 1340 ms 41520 KB Output is correct
87 Correct 1316 ms 41584 KB Output is correct
88 Correct 1304 ms 41584 KB Output is correct
89 Correct 316 ms 26108 KB Output is correct
90 Correct 1321 ms 41644 KB Output is correct
91 Correct 1070 ms 41452 KB Output is correct
92 Correct 205 ms 23620 KB Output is correct
93 Correct 296 ms 23832 KB Output is correct
94 Correct 205 ms 23088 KB Output is correct
95 Correct 209 ms 23544 KB Output is correct
96 Correct 335 ms 22036 KB Output is correct
97 Correct 299 ms 24136 KB Output is correct
98 Correct 208 ms 23424 KB Output is correct
99 Correct 306 ms 24132 KB Output is correct
100 Correct 195 ms 23220 KB Output is correct