oj.uz

Submission #1019782

# Submission time Handle Problem Language Result Execution time Memory
1019782 2024-07-11T08:47:08 Z Pacybwoah Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 21064 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cassert>
#include<set>
#include<utility>
using namespace std;
const int k = 200;
vector<vector<int>> graph;
vector<int> in, dep, pos;
vector<vector<int>> anc;
int tst = 0;
void dfs(int node, int parent){
    in[++tst] = node;
    pos[node] = tst;
    anc[0][node] = parent;
    dep[node] = dep[parent] + 1;
    for(auto x: graph[node]){
        if(x == parent) continue;
        dfs(x, node);
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, q;
    cin >> n >> m >> q;
    //assert(n <= 2000);
    in.resize(n + 1);
    dep.resize(n + 1);
    pos.resize(n + 1);
    anc.resize(18, vector<int>(n + 1));
    graph.resize(n + 1);
    int a, b;
    for(int i = 1; i < n; i++){
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    dfs(1, 1);
    vector<int> vec(m + 1);
    for(int i = 1; i <= m; i++) cin >> vec[i], vec[i] = pos[vec[i]];
    vector<int> ans(q);
    for(int i = 1; i < 18; i++){
        for(int j = 1; j <= n; j++){
            anc[i][j] = anc[i - 1][anc[i - 1][j]];
        }
    }
    auto lca = [&](int u, int v){
        u = in[u], v = in[v];
        if(dep[u] < dep[v]) swap(u, v);
        for(int i = 17; i >= 0; i--){
            if((1 << i) & (dep[u] - dep[v])) u = anc[i][u];
        }
        for(int i = 17; i >= 0; i--){
            if(anc[i][u] != anc[i][v]) u = anc[i][u], v = anc[i][v];
        }
        if(u != v) u = anc[0][u], v = anc[0][v];
        return pos[u];
    };
    auto dist = [&](int u, int v){
        return dep[in[u]] + dep[in[v]] - 2 * dep[in[lca(u, v)]];
    };
    auto left = [&](int aa, int bb, int cc){
        return (dist(aa, bb) + dist(aa, cc) - dist(bb, cc)) / 2;
    };
    vector<vector<pair<pair<int, int>, int>>> queries(m / k + 1);
    for(int i = 0; i < q; i++){
        cin >> a >> b;
        queries[(a - 1) / k].push_back(make_pair(make_pair(a, b), i));
    }
    auto cmp = [&](pair<pair<int, int>, int> c, pair<pair<int, int>, int> d){
        return c.first.second < d.first.second;
    };
    for(int i = 0; i <= m / k; i++) sort(queries[i].begin(), queries[i].end(), cmp);
    int lb = 0, now_lca = -1;
    for(auto &x: queries){
        lb += k;
        multiset<int> s;
        int cnt = 0, rb = lb, last_cnt = 0, last_lca;
        auto add = [&](int node){
            if(s.empty()){
                now_lca = node;
                s.insert(node);
                cnt = 1;
                return;
            }
            auto iter = s.upper_bound(node);
            if(iter != s.end() && (*iter) == node){
                s.insert(node);
                return;
            }
            if(iter == s.begin()){
                cnt += left(node, (*iter), now_lca);
                now_lca = lca(node, now_lca);
                s.insert(node);
                return;
            }
            if(iter == s.end()){
                iter = prev(iter);
                //cout << node << " " << left(node, (*iter), now_lca) << "\n";
                //cout << node << " " << (*iter) << " " << now_lca << "\n";
                cnt += left(node, (*iter), now_lca);
                now_lca = lca(node, now_lca);
                s.insert(node);
                return;
            }
            int bf = (*prev(iter)), gf = (*iter);
            cnt += left(node, bf, gf);
            s.insert(node);
        };
        for(auto &y: x){
            a = y.first.first, b = y.first.second;
            while(b > rb){
                rb++;
                add(vec[rb]);
            }
            last_cnt = cnt;
            last_lca = now_lca;
            for(int i = a; i <= min(b, lb); i++){
                add(vec[i]);
            }
            ans[y.second] = cnt;
            cnt = last_cnt;
            now_lca = last_lca;
            for(int i = a; i <= min(b, lb); i++){
                s.erase(s.find(vec[i]));
            }
        }
    }
    for(int i = 0; i < q; i++) cout << ans[i] << "\n";
}
// g++ -std=c++17 pC.cpp -o run -fsanitize=undefined -fsanitize=address -Wall -Wextra -Wshadow
/*
7 6 2
1 2
1 3
2 4
2 5
3 6
3 7
2 3 6 4 5 7
1 3
4 6
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 452 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 11 ms 348 KB Output is correct
12 Correct 17 ms 536 KB Output is correct
13 Correct 18 ms 348 KB Output is correct
14 Correct 18 ms 456 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 9 ms 348 KB Output is correct
19 Correct 10 ms 348 KB Output is correct
20 Correct 9 ms 520 KB Output is correct
21 Correct 9 ms 528 KB Output is correct
22 Correct 12 ms 528 KB Output is correct
23 Correct 8 ms 348 KB Output is correct
24 Correct 8 ms 524 KB Output is correct
25 Correct 9 ms 348 KB Output is correct
26 Correct 8 ms 536 KB Output is correct
27 Correct 10 ms 472 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 51 ms 600 KB Output is correct
31 Correct 71 ms 780 KB Output is correct
32 Correct 83 ms 908 KB Output is correct
33 Correct 112 ms 856 KB Output is correct
34 Correct 82 ms 860 KB Output is correct
35 Correct 134 ms 900 KB Output is correct
36 Correct 152 ms 896 KB Output is correct
37 Correct 146 ms 860 KB Output is correct
38 Correct 83 ms 1004 KB Output is correct
39 Correct 87 ms 972 KB Output is correct
40 Correct 80 ms 976 KB Output is correct
41 Correct 123 ms 860 KB Output is correct
42 Correct 123 ms 860 KB Output is correct
43 Correct 131 ms 936 KB Output is correct
44 Correct 84 ms 860 KB Output is correct
45 Correct 93 ms 860 KB Output is correct
46 Correct 95 ms 884 KB Output is correct
47 Correct 127 ms 768 KB Output is correct
48 Correct 124 ms 724 KB Output is correct
49 Correct 130 ms 912 KB Output is correct
50 Correct 82 ms 864 KB Output is correct
51 Correct 76 ms 904 KB Output is correct
52 Correct 74 ms 860 KB Output is correct
53 Correct 90 ms 916 KB Output is correct
54 Correct 111 ms 860 KB Output is correct
55 Correct 91 ms 908 KB Output is correct
56 Correct 65 ms 596 KB Output is correct
57 Correct 1 ms 760 KB Output is correct
58 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 472 KB Output is correct
3 Correct 84 ms 604 KB Output is correct
4 Execution timed out 5057 ms 18656 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 58 ms 9268 KB Output is correct
3 Correct 94 ms 10048 KB Output is correct
4 Correct 73 ms 11356 KB Output is correct
5 Correct 151 ms 21064 KB Output is correct
6 Correct 165 ms 17776 KB Output is correct
7 Correct 190 ms 16648 KB Output is correct
8 Correct 131 ms 16584 KB Output is correct
9 Correct 129 ms 16472 KB Output is correct
10 Correct 146 ms 16404 KB Output is correct
11 Correct 143 ms 16452 KB Output is correct
12 Correct 103 ms 16476 KB Output is correct
13 Correct 104 ms 16772 KB Output is correct
14 Correct 94 ms 17272 KB Output is correct
15 Correct 59 ms 19372 KB Output is correct
16 Correct 119 ms 18700 KB Output is correct
17 Correct 134 ms 18736 KB Output is correct
18 Correct 147 ms 18852 KB Output is correct
19 Correct 133 ms 20832 KB Output is correct
20 Correct 145 ms 18380 KB Output is correct
21 Correct 151 ms 17044 KB Output is correct
22 Correct 169 ms 16592 KB Output is correct
23 Correct 155 ms 16328 KB Output is correct
24 Correct 161 ms 16044 KB Output is correct
25 Correct 173 ms 16000 KB Output is correct
26 Correct 167 ms 16244 KB Output is correct
27 Correct 144 ms 16076 KB Output is correct
28 Correct 154 ms 16072 KB Output is correct
29 Correct 137 ms 16072 KB Output is correct
30 Correct 134 ms 16328 KB Output is correct
31 Correct 132 ms 16684 KB Output is correct
32 Correct 136 ms 17000 KB Output is correct
33 Correct 100 ms 17680 KB Output is correct
34 Correct 49 ms 19236 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 63 ms 608 KB Output is correct
4 Execution timed out 5078 ms 16604 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 452 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 11 ms 348 KB Output is correct
12 Correct 17 ms 536 KB Output is correct
13 Correct 18 ms 348 KB Output is correct
14 Correct 18 ms 456 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 9 ms 348 KB Output is correct
19 Correct 10 ms 348 KB Output is correct
20 Correct 9 ms 520 KB Output is correct
21 Correct 9 ms 528 KB Output is correct
22 Correct 12 ms 528 KB Output is correct
23 Correct 8 ms 348 KB Output is correct
24 Correct 8 ms 524 KB Output is correct
25 Correct 9 ms 348 KB Output is correct
26 Correct 8 ms 536 KB Output is correct
27 Correct 10 ms 472 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 51 ms 600 KB Output is correct
31 Correct 71 ms 780 KB Output is correct
32 Correct 83 ms 908 KB Output is correct
33 Correct 112 ms 856 KB Output is correct
34 Correct 82 ms 860 KB Output is correct
35 Correct 134 ms 900 KB Output is correct
36 Correct 152 ms 896 KB Output is correct
37 Correct 146 ms 860 KB Output is correct
38 Correct 83 ms 1004 KB Output is correct
39 Correct 87 ms 972 KB Output is correct
40 Correct 80 ms 976 KB Output is correct
41 Correct 123 ms 860 KB Output is correct
42 Correct 123 ms 860 KB Output is correct
43 Correct 131 ms 936 KB Output is correct
44 Correct 84 ms 860 KB Output is correct
45 Correct 93 ms 860 KB Output is correct
46 Correct 95 ms 884 KB Output is correct
47 Correct 127 ms 768 KB Output is correct
48 Correct 124 ms 724 KB Output is correct
49 Correct 130 ms 912 KB Output is correct
50 Correct 82 ms 864 KB Output is correct
51 Correct 76 ms 904 KB Output is correct
52 Correct 74 ms 860 KB Output is correct
53 Correct 90 ms 916 KB Output is correct
54 Correct 111 ms 860 KB Output is correct
55 Correct 91 ms 908 KB Output is correct
56 Correct 65 ms 596 KB Output is correct
57 Correct 1 ms 760 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 11 ms 472 KB Output is correct
61 Correct 84 ms 604 KB Output is correct
62 Execution timed out 5057 ms 18656 KB Time limit exceeded
63 Halted 0 ms 0 KB -