oj.uz

Submission #1019745

# Submission time Handle Problem Language Result Execution time Memory
1019745 2024-07-11T08:33:17 Z Pacybwoah Tourism (JOI23_tourism) C++17
5 / 100
 95 ms 608 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cassert>
#include<set>
#include<utility>
using namespace std;
const int k = 300;
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;
        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;
            assert(rb == lb || b >= rb);
            while(b > rb){
                rb++;
                add(vec[rb]);
            }
            last_cnt = cnt;
            for(int i = a; i <= min(b, lb); i++){
                add(vec[i]);
            }
            ans[y.second] = cnt;
            cnt = last_cnt;
            for(int i = a; i <= min(b, lb); i++){
                s.erase(s.find(vec[i]));
            }
            //cout << cnt << "\n";
        }
    }
    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 456 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 12 ms 532 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 31 ms 348 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 11 ms 532 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 524 KB Output is correct
22 Correct 11 ms 348 KB Output is correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 11 ms 344 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 11 ms 348 KB Output is correct
27 Correct 9 ms 480 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 352 KB Output is correct

Subtask #2
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 456 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 12 ms 532 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 31 ms 348 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 11 ms 532 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 524 KB Output is correct
22 Correct 11 ms 348 KB Output is correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 11 ms 344 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 11 ms 348 KB Output is correct
27 Correct 9 ms 480 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Incorrect 71 ms 600 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 9 ms 472 KB Output is correct
3 Correct 95 ms 608 KB Output is correct
4 Runtime error 1 ms 608 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 9 ms 492 KB Output is correct
3 Correct 93 ms 608 KB Output is correct
4 Runtime error 1 ms 600 KB Execution killed with signal 6
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 456 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 12 ms 532 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 344 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 31 ms 348 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 11 ms 532 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 524 KB Output is correct
22 Correct 11 ms 348 KB Output is correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 11 ms 344 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 11 ms 348 KB Output is correct
27 Correct 9 ms 480 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Incorrect 71 ms 600 KB Output isn't correct
31 Halted 0 ms 0 KB -