oj.uz

Submission #949350

# Submission time Handle Problem Language Result Execution time Memory
949350 2024-03-19T06:45:21 Z vladilius Tourism (JOI23_tourism) C++17
100 / 100
 890 ms 25056 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using ll = long long;
using pii = pair<int, int>;

struct FT{
    vector<int> bit;
    int n;
    FT(int ns){
        n = ns;
        bit.resize(n + 1);
    }
    void upd(int v, int k){
        while (v <= n){
            bit[v] += k;
            v |= (v + 1);
        }
    }
    int get(int v){
        int out = 0;
        while (v > 0){
            out += bit[v];
            v = (v & (v + 1)) - 1;
        }
        return out;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, q; cin>>n>>m>>q;
    vector<int> g[n + 1];
    for (int i = 1; i < n; i++){
        int a, b; cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    vector<int> c(m + 1);
    for (int i = 1; i <= m; i++){
        cin>>c[i];
    }
    
    vector<int> pos(n + 1), sz(n + 1), p(n + 1), heavy(n + 1), head(n + 1), d(n + 1);
    function<void(int, int)> dfs = [&](int v, int pr){
        p[v] = pr; sz[v] = 1;
        for (int i: g[v]){
            if (i == pr) continue;
            d[i] = d[v] + 1;
            dfs(i, v);
            if (sz[i] > sz[heavy[v]]){
                heavy[v] = i;
            }
            sz[v] += sz[i];
        }
    };
    dfs(1, 0);
    int timer = 0;
    function<void(int, int, int)> dfs_hld = [&](int v, int pr, int k){
        pos[v] = ++timer;
        head[v] = k;
        if (!heavy[v]) return;
        dfs_hld(heavy[v], v, k);
        for (int i: g[v]){
            if (i == pr || i == heavy[v]){
                continue;
            }
            dfs_hld(i, v, i);
        }
    };
    dfs_hld(1, 0, 1);
    
    vector<pii> end[m + 1];
    vector<int> out(q + 1);
    for (int i = 1; i <= q; i++){
        int l, r; cin>>l>>r;
        if (l == r){
            out[i] = 1;
            continue;
        }
        end[l].push_back({r, i});
    }
    
    FT T(m);
    set<array<int, 3>> st;
    auto set = [&](int l, int r, int x){
        while (!st.empty()){
            auto it = st.lower_bound({l, 0, 0});
            if (it == st.end() || (*it)[0] > r) break;
            auto [a, b, k] = *it;
            if (b <= r){
                T.upd(k, -(b - a + 1));
                st.erase(it);
            }
            else {
                T.upd(k, -(r - a + 1));
                st.erase(it);
                st.insert({r + 1, b, k});
            }
        }
        while (!st.empty()){
            auto it = st.upper_bound({l, 0, 0}); 
            if (it == st.begin()) break;
            it--;
            if ((*it)[1] < l) break;
            auto [a, b, k] = *it;
            if (b < r){
                T.upd(k, -(b - l + 1));
                st.erase(it);
                if (a < l) st.insert({a, l - 1, k});
            }
            else {
                T.upd(k, -(r - l + 1));
                st.erase(it);
                if (a < l) st.insert({a, l - 1, k});
                if (r < b) st.insert({r + 1, b});
            }
        }
        T.upd(x, (r - l + 1));
        st.insert({l, r, x});
    };
    auto add = [&](int u, int v, int x){
        while (head[u] != head[v]){
            if (d[head[u]] > d[head[v]]){
                swap(u, v);
            }
            set(pos[head[v]], pos[v], x);
            v = p[head[v]];
        }
        if (d[u] > d[v]) swap(u, v);
        set(pos[u] + 1, pos[v], x);
    };
    
    for (int l = m; l > 0; l--){
        if (l != m){
            add(c[l], c[l + 1], l);
        }
        for (auto [r, j]: end[l]){
            out[j] = T.get(r - 1) + 1;
        }
    }
    for (int i = 1; i <= q; i++){
        cout<<out[i]<<"\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 6 ms 600 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 5 ms 604 KB Output is correct
35 Correct 5 ms 604 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 5 ms 616 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 3 ms 772 KB Output is correct
45 Correct 3 ms 856 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 568 KB Output is correct
49 Correct 3 ms 604 KB Output is correct
50 Correct 3 ms 860 KB Output is correct
51 Correct 3 ms 856 KB Output is correct
52 Correct 4 ms 860 KB Output is correct
53 Correct 3 ms 860 KB Output is correct
54 Correct 3 ms 820 KB Output is correct
55 Correct 3 ms 860 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 5 ms 604 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 79 ms 14544 KB Output is correct
5 Correct 67 ms 19028 KB Output is correct
6 Correct 76 ms 21404 KB Output is correct
7 Correct 98 ms 24536 KB Output is correct
8 Correct 104 ms 24708 KB Output is correct
9 Correct 98 ms 24400 KB Output is correct
10 Correct 97 ms 24400 KB Output is correct
11 Correct 97 ms 24400 KB Output is correct
12 Correct 100 ms 24032 KB Output is correct
13 Correct 101 ms 24236 KB Output is correct
14 Correct 101 ms 24244 KB Output is correct
15 Correct 53 ms 21328 KB Output is correct
16 Correct 86 ms 22096 KB Output is correct
17 Correct 81 ms 12356 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 278 ms 8196 KB Output is correct
3 Correct 392 ms 10296 KB Output is correct
4 Correct 329 ms 10180 KB Output is correct
5 Correct 503 ms 14836 KB Output is correct
6 Correct 502 ms 14668 KB Output is correct
7 Correct 474 ms 14676 KB Output is correct
8 Correct 498 ms 14984 KB Output is correct
9 Correct 571 ms 14928 KB Output is correct
10 Correct 503 ms 14632 KB Output is correct
11 Correct 488 ms 14648 KB Output is correct
12 Correct 510 ms 15188 KB Output is correct
13 Correct 483 ms 15140 KB Output is correct
14 Correct 543 ms 15888 KB Output is correct
15 Correct 542 ms 15744 KB Output is correct
16 Correct 468 ms 15116 KB Output is correct
17 Correct 542 ms 15152 KB Output is correct
18 Correct 492 ms 15352 KB Output is correct
19 Correct 302 ms 11600 KB Output is correct
20 Correct 307 ms 11620 KB Output is correct
21 Correct 308 ms 11908 KB Output is correct
22 Correct 304 ms 11604 KB Output is correct
23 Correct 288 ms 11604 KB Output is correct
24 Correct 291 ms 11604 KB Output is correct
25 Correct 333 ms 12116 KB Output is correct
26 Correct 296 ms 11560 KB Output is correct
27 Correct 305 ms 11672 KB Output is correct
28 Correct 338 ms 11668 KB Output is correct
29 Correct 306 ms 12136 KB Output is correct
30 Correct 304 ms 11848 KB Output is correct
31 Correct 300 ms 11860 KB Output is correct
32 Correct 313 ms 12232 KB Output is correct
33 Correct 316 ms 12840 KB Output is correct
34 Correct 304 ms 12184 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 687 ms 12704 KB Output is correct
5 Correct 750 ms 12932 KB Output is correct
6 Correct 811 ms 16632 KB Output is correct
7 Correct 863 ms 18312 KB Output is correct
8 Correct 853 ms 18268 KB Output is correct
9 Correct 828 ms 18048 KB Output is correct
10 Correct 875 ms 18020 KB Output is correct
11 Correct 814 ms 18088 KB Output is correct
12 Correct 862 ms 18108 KB Output is correct
13 Correct 890 ms 18116 KB Output is correct
14 Correct 75 ms 12368 KB Output is correct

Subtask #6
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 4 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 6 ms 600 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 5 ms 604 KB Output is correct
35 Correct 5 ms 604 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 5 ms 616 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 3 ms 772 KB Output is correct
45 Correct 3 ms 856 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 568 KB Output is correct
49 Correct 3 ms 604 KB Output is correct
50 Correct 3 ms 860 KB Output is correct
51 Correct 3 ms 856 KB Output is correct
52 Correct 4 ms 860 KB Output is correct
53 Correct 3 ms 860 KB Output is correct
54 Correct 3 ms 820 KB Output is correct
55 Correct 3 ms 860 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 5 ms 604 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 79 ms 14544 KB Output is correct
63 Correct 67 ms 19028 KB Output is correct
64 Correct 76 ms 21404 KB Output is correct
65 Correct 98 ms 24536 KB Output is correct
66 Correct 104 ms 24708 KB Output is correct
67 Correct 98 ms 24400 KB Output is correct
68 Correct 97 ms 24400 KB Output is correct
69 Correct 97 ms 24400 KB Output is correct
70 Correct 100 ms 24032 KB Output is correct
71 Correct 101 ms 24236 KB Output is correct
72 Correct 101 ms 24244 KB Output is correct
73 Correct 53 ms 21328 KB Output is correct
74 Correct 86 ms 22096 KB Output is correct
75 Correct 81 ms 12356 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 278 ms 8196 KB Output is correct
78 Correct 392 ms 10296 KB Output is correct
79 Correct 329 ms 10180 KB Output is correct
80 Correct 503 ms 14836 KB Output is correct
81 Correct 502 ms 14668 KB Output is correct
82 Correct 474 ms 14676 KB Output is correct
83 Correct 498 ms 14984 KB Output is correct
84 Correct 571 ms 14928 KB Output is correct
85 Correct 503 ms 14632 KB Output is correct
86 Correct 488 ms 14648 KB Output is correct
87 Correct 510 ms 15188 KB Output is correct
88 Correct 483 ms 15140 KB Output is correct
89 Correct 543 ms 15888 KB Output is correct
90 Correct 542 ms 15744 KB Output is correct
91 Correct 468 ms 15116 KB Output is correct
92 Correct 542 ms 15152 KB Output is correct
93 Correct 492 ms 15352 KB Output is correct
94 Correct 302 ms 11600 KB Output is correct
95 Correct 307 ms 11620 KB Output is correct
96 Correct 308 ms 11908 KB Output is correct
97 Correct 304 ms 11604 KB Output is correct
98 Correct 288 ms 11604 KB Output is correct
99 Correct 291 ms 11604 KB Output is correct
100 Correct 333 ms 12116 KB Output is correct
101 Correct 296 ms 11560 KB Output is correct
102 Correct 305 ms 11672 KB Output is correct
103 Correct 338 ms 11668 KB Output is correct
104 Correct 306 ms 12136 KB Output is correct
105 Correct 304 ms 11848 KB Output is correct
106 Correct 300 ms 11860 KB Output is correct
107 Correct 313 ms 12232 KB Output is correct
108 Correct 316 ms 12840 KB Output is correct
109 Correct 304 ms 12184 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 687 ms 12704 KB Output is correct
114 Correct 750 ms 12932 KB Output is correct
115 Correct 811 ms 16632 KB Output is correct
116 Correct 863 ms 18312 KB Output is correct
117 Correct 853 ms 18268 KB Output is correct
118 Correct 828 ms 18048 KB Output is correct
119 Correct 875 ms 18020 KB Output is correct
120 Correct 814 ms 18088 KB Output is correct
121 Correct 862 ms 18108 KB Output is correct
122 Correct 890 ms 18116 KB Output is correct
123 Correct 75 ms 12368 KB Output is correct
124 Correct 504 ms 16980 KB Output is correct
125 Correct 381 ms 14320 KB Output is correct
126 Correct 580 ms 17700 KB Output is correct
127 Correct 555 ms 17744 KB Output is correct
128 Correct 562 ms 17768 KB Output is correct
129 Correct 577 ms 17600 KB Output is correct
130 Correct 519 ms 17612 KB Output is correct
131 Correct 111 ms 22592 KB Output is correct
132 Correct 112 ms 24348 KB Output is correct
133 Correct 123 ms 18264 KB Output is correct
134 Correct 317 ms 14520 KB Output is correct
135 Correct 345 ms 14672 KB Output is correct
136 Correct 345 ms 14520 KB Output is correct
137 Correct 232 ms 21388 KB Output is correct
138 Correct 216 ms 24776 KB Output is correct
139 Correct 223 ms 25056 KB Output is correct
140 Correct 203 ms 19916 KB Output is correct
141 Correct 217 ms 23772 KB Output is correct
142 Correct 214 ms 20472 KB Output is correct
143 Correct 45 ms 8788 KB Output is correct
144 Correct 497 ms 15352 KB Output is correct