oj.uz

답안 #939704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939704 2024-03-06T16:44:23 Z alextodoran Tourism (JOI23_tourism) C++17
35 / 100
 5000 ms 36516 KB 
/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int BUFFER_SIZE = 4096;

char buffer[BUFFER_SIZE];
int buf_pos = BUFFER_SIZE - 1;

char read_char () {
    if (++buf_pos == BUFFER_SIZE) {
        fread(buffer, BUFFER_SIZE, sizeof(char), stdin);
        buf_pos = 0;
    }
    return buffer[buf_pos];
}
int read_int () {
    char c;
    while (!isdigit(c = read_char()));
    int val = 0;
    do {
        val = val * 10 + (int) (c - '0');
    } while (isdigit(c = read_char()));
    return val;
}

const int N_MAX = 100000;
const int M_MAX = 100000;
const int Q_MAX = 100000;
const int LOG_N = 18;

int N, M, Q;
vector <int> adj[N_MAX + 2];
int C[M_MAX + 2];
int ql[Q_MAX + 2], qr[Q_MAX + 2];

int parent[N_MAX + 2];
int depth[N_MAX + 2];
int order[N_MAX + 2];
int L[N_MAX + 2], R[N_MAX + 2];
int curr;
int euler[N_MAX * 2 + 2];
int ecurr;

void dfs (int u) {
    euler[++ecurr] = u;
    L[u] = ++curr;
    order[curr] = u;
    for (int v : adj[u]) {
        if (v != parent[u]) {
            parent[v] = u;
            depth[v] = depth[u] + 1;
            dfs(v);
            euler[++ecurr] = u;
        }
    }
    R[u] = curr;
}

int p2[N_MAX * 2 + 2];

int range_lca[N_MAX * 2 + 2][LOG_N];
int arg_min_depth (const int &u, const int &v) {
    return (depth[u] < depth[v] ? u : v);
}

int euler_L[N_MAX + 2], euler_R[N_MAX + 2];
void precalc () {
    for (int i = 1; i <= N * 2; i++) {
        range_lca[i][0] = euler[i];
        if (euler_L[euler[i]] == 0) {
            euler_L[euler[i]] = i;
        }
        euler_R[euler[i]] = i;
    }
    for (int e = 1; e < LOG_N; e++) {
        for (int i = 1; i + (1 << e) - 1 <= N * 2; i++) {
            range_lca[i][e] = arg_min_depth(range_lca[i][e - 1],
                range_lca[i + (1 << (e - 1))][e - 1]);
        }
    }
}
int lca (int u, int v) {
    if (u == 0 || v == 0) {
        return 0;
    }
    if (L[u] > L[v]) {
        swap(u, v);
    }
    int l = euler_L[u], r = euler_R[v];
    int e = p2[r - l + 1];
    return arg_min_depth(range_lca[l][e], range_lca[r - (1 << e) + 1][e]);
}

int bucket;
int get_bucket (int i) {
    return (i - 1) / bucket + 1;
}
vector <int> queries[M_MAX + 2];

int cnt, root;

int Fen[N_MAX + 2];
void update (int pos, int sgn) {
    for (int i = pos; i <= N; i += i & -i) {
        Fen[i] += sgn;
    }
}
int query (int pos) {
    int cnt = 0;
    for (int i = pos; i >= 1; i -= i & -i) {
        cnt += Fen[i];
    }
    return cnt;
}
int get_kth (int k, int mx = N) {
    int i = 0;
    for (int e = p2[mx]; e >= 0 && k > 0; e--) {
        if (i + (1 << e) <= N && Fen[i + (1 << e)] < k) {
            i += (1 << e);
            k -= Fen[i];
        }
    }
    return i + 1;
}

int occ[N_MAX + 2];
int total = 0;
void add (int u) {
    if (++occ[u] == 1) {
        update(L[u], +1); total++;
        if (total == 1) {
            cnt = 1; root = u;
            return;
        }
        int upos = query(L[u]);
        int ur = (upos < total ? order[get_kth(upos + 1, N)] : 0);
        if (ur == 0 || R[u] < L[ur]) {
            int ul = (upos > 1 ? order[get_kth(upos - 1, L[u] - 1)] : 0);
            ul = lca(u, ul);
            ur = lca(u, ur);
            int v = (depth[ul] > depth[ur] ? ul : ur);
            cnt += depth[u] - depth[v];
            if (depth[v] < depth[root]) {
                cnt += depth[root] - depth[v];
                root = v;
            }
        } else {
            int v = lca(u, root);
            cnt += depth[root] - depth[v];
            root = v;
        }
    }
}
void del (int u) {
    if (--occ[u] == 0) {
        update(L[u], -1); total--;
    }
}

int answer[Q_MAX + 2];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
//    mt19937 rnd(0);

    N = read_int();
    M = read_int();
    Q = read_int();
//    N = M = Q = 100000;
    for (int i = 1; i <= N - 1; i++) {
        int u, v;
        u = read_int();
        v = read_int();
//        u = rnd() % i + 1;
//        v = i + 1;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= M; i++) {
        C[i] = read_int();
//        C[i] = i;
    }
//    shuffle(C + 1, C + M + 1, rnd);
    for (int i = 1; i <= Q; i++) {
        ql[i] = read_int();
        qr[i] = read_int();
//        ql[i] = rnd() % M + 1;
//        qr[i] = rnd() % M + 1;
//        if (ql[i] > qr[i]) {
//            swap(ql[i], qr[i]);
//        }
    }
    for (int i = 1; i <= N * 2; i++) {
        p2[i] = p2[i - 1];
        if ((1 << (p2[i] + 1)) <= i) {
            p2[i]++;
        }
    }
    depth[1] = 1;
    dfs(1);
    precalc();
    bucket = max(1, min(M, (int) sqrt(M)));
    for (int i = 1; i <= Q; i++) {
        int bl = get_bucket(ql[i]), br = get_bucket(qr[i]);
        if (bl < br) {
            queries[bl].push_back(i);
        } else {
            for (int j = ql[i]; j <= qr[i]; j++) {
                add(C[j]);
            }
            answer[i] = cnt;
            for (int j = qr[i]; j >= ql[i]; j--) {
                del(C[j]);
            }
            cnt = root = 0;
        }
    }
    for (int b = 1; b <= get_bucket(M) - 1; b++) {
        sort(queries[b].begin(), queries[b].end(), [&] (const int &i, const int &j) {
            return qr[i] < qr[j];
        });
        int r = b * bucket;
        for (int i : queries[b]) {
            while (r < qr[i]) {
                add(C[++r]);
            }
            int prv_cnt = cnt, prv_root = root;
            for (int j = b * bucket; j >= ql[i]; j--) {
                add(C[j]);
            }
            answer[i] = cnt;
            for (int j = ql[i]; j <= b * bucket; j++) {
                del(C[j]);
            }
            cnt = prv_cnt; root = prv_root;
        }
        while (r > b * bucket) {
            occ[C[r--]]--;
        }
        cnt = root = 0;
        fill(Fen + 1, Fen + N + 1, 0); total = 0;
    }
    for (int i = 1; i <= Q; i++) {
        cout << answer[i] << "\n";
    }

    return 0;
}

Compilation message

tourism.cpp: In function 'char read_char()':
tourism.cpp:22:14: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         fread(buffer, BUFFER_SIZE, sizeof(char), stdin);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11360 KB Output is correct
2 Correct 2 ms 11364 KB Output is correct
3 Correct 3 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 3 ms 11356 KB Output is correct
7 Correct 2 ms 11352 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 2 ms 11356 KB Output is correct
10 Correct 2 ms 11404 KB Output is correct
11 Correct 3 ms 11352 KB Output is correct
12 Correct 3 ms 11356 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11356 KB Output is correct
20 Correct 3 ms 11356 KB Output is correct
21 Correct 2 ms 11352 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11608 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 2 ms 11352 KB Output is correct
28 Correct 2 ms 11608 KB Output is correct
29 Correct 3 ms 11356 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11360 KB Output is correct
2 Correct 2 ms 11364 KB Output is correct
3 Correct 3 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 3 ms 11356 KB Output is correct
7 Correct 2 ms 11352 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 2 ms 11356 KB Output is correct
10 Correct 2 ms 11404 KB Output is correct
11 Correct 3 ms 11352 KB Output is correct
12 Correct 3 ms 11356 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11356 KB Output is correct
20 Correct 3 ms 11356 KB Output is correct
21 Correct 2 ms 11352 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11608 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 2 ms 11352 KB Output is correct
28 Correct 2 ms 11608 KB Output is correct
29 Correct 3 ms 11356 KB Output is correct
30 Correct 8 ms 11356 KB Output is correct
31 Correct 8 ms 11352 KB Output is correct
32 Correct 11 ms 11504 KB Output is correct
33 Correct 11 ms 11356 KB Output is correct
34 Correct 11 ms 11356 KB Output is correct
35 Correct 4 ms 11352 KB Output is correct
36 Correct 4 ms 11356 KB Output is correct
37 Correct 6 ms 11356 KB Output is correct
38 Correct 11 ms 11608 KB Output is correct
39 Correct 8 ms 11612 KB Output is correct
40 Correct 9 ms 11636 KB Output is correct
41 Correct 5 ms 11864 KB Output is correct
42 Correct 4 ms 11612 KB Output is correct
43 Correct 4 ms 11612 KB Output is correct
44 Correct 12 ms 11352 KB Output is correct
45 Correct 9 ms 11356 KB Output is correct
46 Correct 9 ms 11576 KB Output is correct
47 Correct 4 ms 11352 KB Output is correct
48 Correct 4 ms 11352 KB Output is correct
49 Correct 5 ms 11352 KB Output is correct
50 Correct 11 ms 11356 KB Output is correct
51 Correct 11 ms 11356 KB Output is correct
52 Correct 11 ms 11532 KB Output is correct
53 Correct 15 ms 11528 KB Output is correct
54 Correct 12 ms 11356 KB Output is correct
55 Correct 15 ms 11536 KB Output is correct
56 Correct 4 ms 11356 KB Output is correct
57 Correct 2 ms 11356 KB Output is correct
58 Correct 3 ms 11436 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 4 ms 11356 KB Output is correct
4 Correct 2735 ms 25936 KB Output is correct
5 Correct 2159 ms 32356 KB Output is correct
6 Correct 2683 ms 34036 KB Output is correct
7 Correct 4710 ms 36500 KB Output is correct
8 Correct 4661 ms 36496 KB Output is correct
9 Correct 4731 ms 36500 KB Output is correct
10 Correct 4776 ms 36516 KB Output is correct
11 Correct 4032 ms 36492 KB Output is correct
12 Correct 771 ms 36364 KB Output is correct
13 Correct 754 ms 36280 KB Output is correct
14 Correct 779 ms 36284 KB Output is correct
15 Correct 47 ms 35408 KB Output is correct
16 Correct 55 ms 35408 KB Output is correct
17 Correct 160 ms 12264 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11384 KB Output is correct
2 Correct 32 ms 21608 KB Output is correct
3 Correct 49 ms 23780 KB Output is correct
4 Correct 46 ms 23896 KB Output is correct
5 Correct 59 ms 28764 KB Output is correct
6 Correct 75 ms 28764 KB Output is correct
7 Correct 83 ms 28948 KB Output is correct
8 Correct 90 ms 28764 KB Output is correct
9 Correct 66 ms 28972 KB Output is correct
10 Correct 79 ms 28952 KB Output is correct
11 Correct 80 ms 28760 KB Output is correct
12 Correct 78 ms 28960 KB Output is correct
13 Correct 84 ms 28992 KB Output is correct
14 Correct 60 ms 29156 KB Output is correct
15 Correct 52 ms 29268 KB Output is correct
16 Correct 77 ms 28960 KB Output is correct
17 Correct 70 ms 28892 KB Output is correct
18 Correct 63 ms 28980 KB Output is correct
19 Correct 60 ms 28956 KB Output is correct
20 Correct 64 ms 28952 KB Output is correct
21 Correct 53 ms 28760 KB Output is correct
22 Correct 55 ms 28764 KB Output is correct
23 Correct 69 ms 28760 KB Output is correct
24 Correct 66 ms 28948 KB Output is correct
25 Correct 77 ms 28936 KB Output is correct
26 Correct 75 ms 28992 KB Output is correct
27 Correct 89 ms 28752 KB Output is correct
28 Correct 76 ms 28740 KB Output is correct
29 Correct 88 ms 28972 KB Output is correct
30 Correct 81 ms 28988 KB Output is correct
31 Correct 81 ms 29012 KB Output is correct
32 Correct 98 ms 29036 KB Output is correct
33 Correct 55 ms 29276 KB Output is correct
34 Correct 68 ms 29176 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11356 KB Output is correct
2 Correct 2 ms 11356 KB Output is correct
3 Correct 3 ms 11356 KB Output is correct
4 Correct 4240 ms 22936 KB Output is correct
5 Correct 4812 ms 24988 KB Output is correct
6 Execution timed out 5051 ms 27276 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11360 KB Output is correct
2 Correct 2 ms 11364 KB Output is correct
3 Correct 3 ms 11356 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 3 ms 11356 KB Output is correct
6 Correct 3 ms 11356 KB Output is correct
7 Correct 2 ms 11352 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 2 ms 11356 KB Output is correct
10 Correct 2 ms 11404 KB Output is correct
11 Correct 3 ms 11352 KB Output is correct
12 Correct 3 ms 11356 KB Output is correct
13 Correct 3 ms 11356 KB Output is correct
14 Correct 2 ms 11356 KB Output is correct
15 Correct 3 ms 11356 KB Output is correct
16 Correct 3 ms 11356 KB Output is correct
17 Correct 3 ms 11356 KB Output is correct
18 Correct 3 ms 11356 KB Output is correct
19 Correct 3 ms 11356 KB Output is correct
20 Correct 3 ms 11356 KB Output is correct
21 Correct 2 ms 11352 KB Output is correct
22 Correct 3 ms 11356 KB Output is correct
23 Correct 3 ms 11356 KB Output is correct
24 Correct 3 ms 11356 KB Output is correct
25 Correct 3 ms 11608 KB Output is correct
26 Correct 3 ms 11356 KB Output is correct
27 Correct 2 ms 11352 KB Output is correct
28 Correct 2 ms 11608 KB Output is correct
29 Correct 3 ms 11356 KB Output is correct
30 Correct 8 ms 11356 KB Output is correct
31 Correct 8 ms 11352 KB Output is correct
32 Correct 11 ms 11504 KB Output is correct
33 Correct 11 ms 11356 KB Output is correct
34 Correct 11 ms 11356 KB Output is correct
35 Correct 4 ms 11352 KB Output is correct
36 Correct 4 ms 11356 KB Output is correct
37 Correct 6 ms 11356 KB Output is correct
38 Correct 11 ms 11608 KB Output is correct
39 Correct 8 ms 11612 KB Output is correct
40 Correct 9 ms 11636 KB Output is correct
41 Correct 5 ms 11864 KB Output is correct
42 Correct 4 ms 11612 KB Output is correct
43 Correct 4 ms 11612 KB Output is correct
44 Correct 12 ms 11352 KB Output is correct
45 Correct 9 ms 11356 KB Output is correct
46 Correct 9 ms 11576 KB Output is correct
47 Correct 4 ms 11352 KB Output is correct
48 Correct 4 ms 11352 KB Output is correct
49 Correct 5 ms 11352 KB Output is correct
50 Correct 11 ms 11356 KB Output is correct
51 Correct 11 ms 11356 KB Output is correct
52 Correct 11 ms 11532 KB Output is correct
53 Correct 15 ms 11528 KB Output is correct
54 Correct 12 ms 11356 KB Output is correct
55 Correct 15 ms 11536 KB Output is correct
56 Correct 4 ms 11356 KB Output is correct
57 Correct 2 ms 11356 KB Output is correct
58 Correct 3 ms 11436 KB Output is correct
59 Correct 2 ms 11356 KB Output is correct
60 Correct 2 ms 11356 KB Output is correct
61 Correct 4 ms 11356 KB Output is correct
62 Correct 2735 ms 25936 KB Output is correct
63 Correct 2159 ms 32356 KB Output is correct
64 Correct 2683 ms 34036 KB Output is correct
65 Correct 4710 ms 36500 KB Output is correct
66 Correct 4661 ms 36496 KB Output is correct
67 Correct 4731 ms 36500 KB Output is correct
68 Correct 4776 ms 36516 KB Output is correct
69 Correct 4032 ms 36492 KB Output is correct
70 Correct 771 ms 36364 KB Output is correct
71 Correct 754 ms 36280 KB Output is correct
72 Correct 779 ms 36284 KB Output is correct
73 Correct 47 ms 35408 KB Output is correct
74 Correct 55 ms 35408 KB Output is correct
75 Correct 160 ms 12264 KB Output is correct
76 Correct 2 ms 11384 KB Output is correct
77 Correct 32 ms 21608 KB Output is correct
78 Correct 49 ms 23780 KB Output is correct
79 Correct 46 ms 23896 KB Output is correct
80 Correct 59 ms 28764 KB Output is correct
81 Correct 75 ms 28764 KB Output is correct
82 Correct 83 ms 28948 KB Output is correct
83 Correct 90 ms 28764 KB Output is correct
84 Correct 66 ms 28972 KB Output is correct
85 Correct 79 ms 28952 KB Output is correct
86 Correct 80 ms 28760 KB Output is correct
87 Correct 78 ms 28960 KB Output is correct
88 Correct 84 ms 28992 KB Output is correct
89 Correct 60 ms 29156 KB Output is correct
90 Correct 52 ms 29268 KB Output is correct
91 Correct 77 ms 28960 KB Output is correct
92 Correct 70 ms 28892 KB Output is correct
93 Correct 63 ms 28980 KB Output is correct
94 Correct 60 ms 28956 KB Output is correct
95 Correct 64 ms 28952 KB Output is correct
96 Correct 53 ms 28760 KB Output is correct
97 Correct 55 ms 28764 KB Output is correct
98 Correct 69 ms 28760 KB Output is correct
99 Correct 66 ms 28948 KB Output is correct
100 Correct 77 ms 28936 KB Output is correct
101 Correct 75 ms 28992 KB Output is correct
102 Correct 89 ms 28752 KB Output is correct
103 Correct 76 ms 28740 KB Output is correct
104 Correct 88 ms 28972 KB Output is correct
105 Correct 81 ms 28988 KB Output is correct
106 Correct 81 ms 29012 KB Output is correct
107 Correct 98 ms 29036 KB Output is correct
108 Correct 55 ms 29276 KB Output is correct
109 Correct 68 ms 29176 KB Output is correct
110 Correct 3 ms 11356 KB Output is correct
111 Correct 2 ms 11356 KB Output is correct
112 Correct 3 ms 11356 KB Output is correct
113 Correct 4240 ms 22936 KB Output is correct
114 Correct 4812 ms 24988 KB Output is correct
115 Execution timed out 5051 ms 27276 KB Time limit exceeded
116 Halted 0 ms 0 KB -