oj.uz

Submission #378948

# Submission time Handle Problem Language Result Execution time Memory
378948 2021-03-17T07:54:06 Z dannyboy20031204 Evacuation plan (IZhO18_plan) C++17
100 / 100
 3374 ms 38496 KB 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define z return 0;
using namespace std;
const int N = 1e5 + 5, inf = 1e9 + 1; //
int p[N];
int get(int pos){
    return p[pos] = p[pos] == pos ? pos : get(p[pos]);
}
void merge(int a, int b){
    a = get(a), b = get(b);
    p[a] = b;
}
void init(){
    for (int i = 0; i < N; i++) p[i] = i;
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m, k, t;
    cin >> n >> m;
    vector<pair<int, int>> g[n + 1], ord;
    for (int i = 0; i < m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    cin >> k;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    int dis[n + 1];
    for (int &i : dis) i = inf;
    for (int i = 0, u; i < k; i++){
        cin >> u;
        q.push({0, u});
    }
    while (!q.empty()){
        auto u = q.top();
        q.pop();
        if (u.fi >= dis[u.se]) continue;
        ord.push_back({u.se, u.fi});
        dis[u.se] = u.fi;
        for (auto i : g[u.se]) q.push({u.fi + i.se, i.fi});
    }
    reverse(ord.begin(), ord.end());
    cin >> t;
    int l[t], r[t], st[t], ed[t];
    for (int i = 0; i < t; i++){
        cin >> st[i] >> ed[i];
        l[i] = 0, r[i] = inf;
    }
    for (int _ = 0; _ < 31; _++){
        init();
        vector<pair<int, int>> vv;
        for (int i = 0; i < t; i++){
            int mid = l[i] + r[i] >> 1;
            vv.push_back({mid, i});
        }
        sort(vv.begin(), vv.end(), greater<pair<int, int>>());
        int vis[n + 1]{}, ptr = 0;
        for (auto u : ord){
            while (ptr < t and vv[ptr].fi > u.se){
                int i = vv[ptr].se;
                if (get(st[i]) == get(ed[i])) l[i] = (l[i] + r[i] >> 1) + 1;
                else r[i] = l[i] + r[i] >> 1;
                ptr++;
            }
            for (auto i : g[u.fi]) if (vis[i.fi]) merge(i.fi, u.fi);
            vis[u.fi] = true;
        }
    }
    for (int i = 0; i < t; i++) cout << max(0, l[i] - 1) << '\n';
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:57:28: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |             int mid = l[i] + r[i] >> 1;
      |                       ~~~~~^~~~~~
plan.cpp:65:60: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |                 if (get(st[i]) == get(ed[i])) l[i] = (l[i] + r[i] >> 1) + 1;
      |                                                       ~~~~~^~~~~~
plan.cpp:66:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |                 else r[i] = l[i] + r[i] >> 1;
      |                             ~~~~~^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 5 ms 876 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 6 ms 876 KB Output is correct
12 Correct 5 ms 876 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 7 ms 876 KB Output is correct
15 Correct 6 ms 876 KB Output is correct
16 Correct 1004 ms 14100 KB Output is correct
17 Correct 3002 ms 37072 KB Output is correct
18 Correct 163 ms 3940 KB Output is correct
19 Correct 532 ms 15692 KB Output is correct
20 Correct 3089 ms 37100 KB Output is correct
21 Correct 1470 ms 21600 KB Output is correct
22 Correct 837 ms 14712 KB Output is correct
23 Correct 3021 ms 37048 KB Output is correct
24 Correct 2971 ms 37144 KB Output is correct
25 Correct 2996 ms 37080 KB Output is correct
26 Correct 500 ms 15836 KB Output is correct
27 Correct 552 ms 15844 KB Output is correct
28 Correct 494 ms 15716 KB Output is correct
29 Correct 577 ms 15820 KB Output is correct
30 Correct 515 ms 15864 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1349 ms 16736 KB Output is correct
2 Correct 2772 ms 34424 KB Output is correct
3 Correct 2806 ms 34488 KB Output is correct
4 Correct 333 ms 11232 KB Output is correct
5 Correct 2924 ms 34456 KB Output is correct
6 Correct 2796 ms 34480 KB Output is correct
7 Correct 2728 ms 34516 KB Output is correct
8 Correct 2646 ms 34424 KB Output is correct
9 Correct 2710 ms 34640 KB Output is correct
10 Correct 2683 ms 34432 KB Output is correct
11 Correct 2695 ms 34424 KB Output is correct
12 Correct 2632 ms 34424 KB Output is correct
13 Correct 2591 ms 34432 KB Output is correct
14 Correct 2660 ms 34552 KB Output is correct
15 Correct 2703 ms 34536 KB Output is correct
16 Correct 2637 ms 34424 KB Output is correct
17 Correct 2823 ms 34424 KB Output is correct
18 Correct 2706 ms 34424 KB Output is correct
19 Correct 269 ms 10592 KB Output is correct
20 Correct 2720 ms 34428 KB Output is correct
21 Correct 2279 ms 34780 KB Output is correct
22 Correct 330 ms 11172 KB Output is correct
23 Correct 367 ms 10208 KB Output is correct
24 Correct 343 ms 11188 KB Output is correct
25 Correct 365 ms 11108 KB Output is correct
26 Correct 537 ms 10200 KB Output is correct
27 Correct 305 ms 11124 KB Output is correct
28 Correct 337 ms 11188 KB Output is correct
29 Correct 373 ms 11068 KB Output is correct
30 Correct 334 ms 11096 KB Output is correct
31 Correct 339 ms 11104 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 5 ms 876 KB Output is correct
3 Correct 5 ms 876 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 3 ms 748 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 6 ms 876 KB Output is correct
12 Correct 5 ms 876 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 7 ms 876 KB Output is correct
15 Correct 6 ms 876 KB Output is correct
16 Correct 1004 ms 14100 KB Output is correct
17 Correct 3002 ms 37072 KB Output is correct
18 Correct 163 ms 3940 KB Output is correct
19 Correct 532 ms 15692 KB Output is correct
20 Correct 3089 ms 37100 KB Output is correct
21 Correct 1470 ms 21600 KB Output is correct
22 Correct 837 ms 14712 KB Output is correct
23 Correct 3021 ms 37048 KB Output is correct
24 Correct 2971 ms 37144 KB Output is correct
25 Correct 2996 ms 37080 KB Output is correct
26 Correct 500 ms 15836 KB Output is correct
27 Correct 552 ms 15844 KB Output is correct
28 Correct 494 ms 15716 KB Output is correct
29 Correct 577 ms 15820 KB Output is correct
30 Correct 515 ms 15864 KB Output is correct
31 Correct 3 ms 748 KB Output is correct
32 Correct 2 ms 748 KB Output is correct
33 Correct 2 ms 748 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 3 ms 748 KB Output is correct
36 Correct 4 ms 876 KB Output is correct
37 Correct 3 ms 748 KB Output is correct
38 Correct 2 ms 748 KB Output is correct
39 Correct 2 ms 748 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 1349 ms 16736 KB Output is correct
42 Correct 2772 ms 34424 KB Output is correct
43 Correct 2806 ms 34488 KB Output is correct
44 Correct 333 ms 11232 KB Output is correct
45 Correct 2924 ms 34456 KB Output is correct
46 Correct 2796 ms 34480 KB Output is correct
47 Correct 2728 ms 34516 KB Output is correct
48 Correct 2646 ms 34424 KB Output is correct
49 Correct 2710 ms 34640 KB Output is correct
50 Correct 2683 ms 34432 KB Output is correct
51 Correct 2695 ms 34424 KB Output is correct
52 Correct 2632 ms 34424 KB Output is correct
53 Correct 2591 ms 34432 KB Output is correct
54 Correct 2660 ms 34552 KB Output is correct
55 Correct 2703 ms 34536 KB Output is correct
56 Correct 2637 ms 34424 KB Output is correct
57 Correct 2823 ms 34424 KB Output is correct
58 Correct 2706 ms 34424 KB Output is correct
59 Correct 269 ms 10592 KB Output is correct
60 Correct 2720 ms 34428 KB Output is correct
61 Correct 2279 ms 34780 KB Output is correct
62 Correct 330 ms 11172 KB Output is correct
63 Correct 367 ms 10208 KB Output is correct
64 Correct 343 ms 11188 KB Output is correct
65 Correct 365 ms 11108 KB Output is correct
66 Correct 537 ms 10200 KB Output is correct
67 Correct 305 ms 11124 KB Output is correct
68 Correct 337 ms 11188 KB Output is correct
69 Correct 373 ms 11068 KB Output is correct
70 Correct 334 ms 11096 KB Output is correct
71 Correct 339 ms 11104 KB Output is correct
72 Correct 2176 ms 20868 KB Output is correct
73 Correct 3374 ms 37084 KB Output is correct
74 Correct 3116 ms 37108 KB Output is correct
75 Correct 3060 ms 37132 KB Output is correct
76 Correct 3015 ms 37076 KB Output is correct
77 Correct 3038 ms 37096 KB Output is correct
78 Correct 2999 ms 37228 KB Output is correct
79 Correct 3028 ms 37072 KB Output is correct
80 Correct 3049 ms 37192 KB Output is correct
81 Correct 3022 ms 37100 KB Output is correct
82 Correct 2996 ms 37136 KB Output is correct
83 Correct 2998 ms 37108 KB Output is correct
84 Correct 2978 ms 37120 KB Output is correct
85 Correct 2949 ms 37132 KB Output is correct
86 Correct 3025 ms 37104 KB Output is correct
87 Correct 2999 ms 37136 KB Output is correct
88 Correct 3018 ms 37148 KB Output is correct
89 Correct 1077 ms 15172 KB Output is correct
90 Correct 3059 ms 37096 KB Output is correct
91 Correct 2463 ms 38496 KB Output is correct
92 Correct 517 ms 15676 KB Output is correct
93 Correct 878 ms 14748 KB Output is correct
94 Correct 514 ms 15692 KB Output is correct
95 Correct 539 ms 15688 KB Output is correct
96 Correct 813 ms 14884 KB Output is correct
97 Correct 1027 ms 15236 KB Output is correct
98 Correct 520 ms 15776 KB Output is correct
99 Correct 918 ms 14952 KB Output is correct
100 Correct 553 ms 15684 KB Output is correct