oj.uz

답안 #1019777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019777 2024-07-11T08:45:16 Z Pacybwoah Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 21092 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, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 5 ms 496 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 500 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 12 ms 528 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 30 ms 344 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 15 ms 716 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 532 KB Output is correct
22 Correct 10 ms 348 KB Output is correct
23 Correct 11 ms 524 KB Output is correct
24 Correct 14 ms 524 KB Output is correct
25 Correct 12 ms 532 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 9 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 5 ms 496 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 500 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 12 ms 528 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 30 ms 344 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 15 ms 716 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 532 KB Output is correct
22 Correct 10 ms 348 KB Output is correct
23 Correct 11 ms 524 KB Output is correct
24 Correct 14 ms 524 KB Output is correct
25 Correct 12 ms 532 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 9 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 75 ms 604 KB Output is correct
31 Correct 94 ms 604 KB Output is correct
32 Correct 116 ms 856 KB Output is correct
33 Correct 115 ms 876 KB Output is correct
34 Correct 122 ms 864 KB Output is correct
35 Correct 214 ms 856 KB Output is correct
36 Correct 186 ms 856 KB Output is correct
37 Correct 191 ms 896 KB Output is correct
38 Correct 120 ms 856 KB Output is correct
39 Correct 129 ms 964 KB Output is correct
40 Correct 109 ms 856 KB Output is correct
41 Correct 185 ms 964 KB Output is correct
42 Correct 183 ms 860 KB Output is correct
43 Correct 188 ms 944 KB Output is correct
44 Correct 114 ms 856 KB Output is correct
45 Correct 120 ms 916 KB Output is correct
46 Correct 114 ms 856 KB Output is correct
47 Correct 189 ms 768 KB Output is correct
48 Correct 179 ms 860 KB Output is correct
49 Correct 181 ms 860 KB Output is correct
50 Correct 105 ms 856 KB Output is correct
51 Correct 102 ms 1132 KB Output is correct
52 Correct 115 ms 1104 KB Output is correct
53 Correct 103 ms 856 KB Output is correct
54 Correct 104 ms 904 KB Output is correct
55 Correct 101 ms 856 KB Output is correct
56 Correct 102 ms 852 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 1 ms 776 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 488 KB Output is correct
3 Correct 94 ms 604 KB Output is correct
4 Execution timed out 5063 ms 18296 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 54 ms 9092 KB Output is correct
3 Correct 81 ms 10252 KB Output is correct
4 Correct 64 ms 11332 KB Output is correct
5 Correct 145 ms 20680 KB Output is correct
6 Correct 137 ms 17612 KB Output is correct
7 Correct 134 ms 16692 KB Output is correct
8 Correct 130 ms 16384 KB Output is correct
9 Correct 119 ms 16080 KB Output is correct
10 Correct 119 ms 16080 KB Output is correct
11 Correct 111 ms 16012 KB Output is correct
12 Correct 105 ms 16100 KB Output is correct
13 Correct 103 ms 16596 KB Output is correct
14 Correct 88 ms 17348 KB Output is correct
15 Correct 56 ms 19660 KB Output is correct
16 Correct 127 ms 18892 KB Output is correct
17 Correct 119 ms 18636 KB Output is correct
18 Correct 117 ms 18636 KB Output is correct
19 Correct 135 ms 21092 KB Output is correct
20 Correct 140 ms 18636 KB Output is correct
21 Correct 135 ms 17100 KB Output is correct
22 Correct 144 ms 16864 KB Output is correct
23 Correct 145 ms 16632 KB Output is correct
24 Correct 149 ms 16328 KB Output is correct
25 Correct 150 ms 16424 KB Output is correct
26 Correct 154 ms 16436 KB Output is correct
27 Correct 158 ms 16340 KB Output is correct
28 Correct 141 ms 16340 KB Output is correct
29 Correct 144 ms 16460 KB Output is correct
30 Correct 135 ms 16556 KB Output is correct
31 Correct 133 ms 16520 KB Output is correct
32 Correct 126 ms 16840 KB Output is correct
33 Correct 94 ms 18232 KB Output is correct
34 Correct 51 ms 19948 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 9 ms 484 KB Output is correct
3 Correct 95 ms 544 KB Output is correct
4 Execution timed out 5078 ms 16716 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 5 ms 496 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 500 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 12 ms 528 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 12 ms 348 KB Output is correct
12 Correct 30 ms 348 KB Output is correct
13 Correct 31 ms 348 KB Output is correct
14 Correct 30 ms 344 KB Output is correct
15 Correct 12 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 12 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 15 ms 716 KB Output is correct
20 Correct 12 ms 344 KB Output is correct
21 Correct 11 ms 532 KB Output is correct
22 Correct 10 ms 348 KB Output is correct
23 Correct 11 ms 524 KB Output is correct
24 Correct 14 ms 524 KB Output is correct
25 Correct 12 ms 532 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 9 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 75 ms 604 KB Output is correct
31 Correct 94 ms 604 KB Output is correct
32 Correct 116 ms 856 KB Output is correct
33 Correct 115 ms 876 KB Output is correct
34 Correct 122 ms 864 KB Output is correct
35 Correct 214 ms 856 KB Output is correct
36 Correct 186 ms 856 KB Output is correct
37 Correct 191 ms 896 KB Output is correct
38 Correct 120 ms 856 KB Output is correct
39 Correct 129 ms 964 KB Output is correct
40 Correct 109 ms 856 KB Output is correct
41 Correct 185 ms 964 KB Output is correct
42 Correct 183 ms 860 KB Output is correct
43 Correct 188 ms 944 KB Output is correct
44 Correct 114 ms 856 KB Output is correct
45 Correct 120 ms 916 KB Output is correct
46 Correct 114 ms 856 KB Output is correct
47 Correct 189 ms 768 KB Output is correct
48 Correct 179 ms 860 KB Output is correct
49 Correct 181 ms 860 KB Output is correct
50 Correct 105 ms 856 KB Output is correct
51 Correct 102 ms 1132 KB Output is correct
52 Correct 115 ms 1104 KB Output is correct
53 Correct 103 ms 856 KB Output is correct
54 Correct 104 ms 904 KB Output is correct
55 Correct 101 ms 856 KB Output is correct
56 Correct 102 ms 852 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 1 ms 776 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 11 ms 488 KB Output is correct
61 Correct 94 ms 604 KB Output is correct
62 Execution timed out 5063 ms 18296 KB Time limit exceeded
63 Halted 0 ms 0 KB -