oj.uz

Submission #939588

# Submission time Handle Problem Language Result Execution time Memory
939588 2024-03-06T14:37:00 Z alextodoran Tourism (JOI23_tourism) C++17
10 / 100
 5000 ms 27732 KB 
/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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];
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 range_lca[N_MAX * 2 + 2][LOG_N];
int arg_min_depth (int u, 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;
    }
    int l = euler_L[u], r = euler_R[v];
    if (l > r) {
        swap(u, v);
        swap(l, r);
    }
    int len = r - l + 1;
    int e = 31 - __builtin_clz(len);
    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[N_MAX + 2];

int cnt, root;

int occ[N_MAX + 2];
set <int> S;
void add (int u) {
    if (++occ[u] == 1) {
        if (S.empty() == true) {
            S.insert(L[u]);
            cnt = 1; root = u;
            return;
        }
        set <int> :: iterator it = S.insert(L[u]).first;
        int ul = (it != S.begin() ? order[*prev(it)] : 0);
        int ur = (next(it) != S.end() ? order[*next(it)] : 0);
        if (ur == 0 || R[u] < L[ur]) {
            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) {
        S.erase(L[u]);
    }
}

int answer[Q_MAX + 2];

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

    cin >> N >> M >> Q;
    for (int i = 1; i <= N - 1; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= M; i++) {
        cin >> C[i];
    }
    for (int i = 1; i <= Q; i++) {
        cin >> ql[i] >> qr[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) {
            del(C[r--]);
        }
        cnt = root = 0;
    }
    for (int i = 1; i <= Q; i++) {
        cout << answer[i] << "\n";
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 10048 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 3 ms 10072 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 3 ms 9820 KB Output is correct
16 Correct 3 ms 9796 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9816 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 3 ms 9820 KB Output is correct
23 Correct 3 ms 9820 KB Output is correct
24 Correct 3 ms 9800 KB Output is correct
25 Correct 3 ms 9820 KB Output is correct
26 Correct 3 ms 9820 KB Output is correct
27 Correct 2 ms 9816 KB Output is correct
28 Correct 2 ms 9756 KB Output is correct
29 Correct 3 ms 9820 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 10048 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 3 ms 10072 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 3 ms 9820 KB Output is correct
16 Correct 3 ms 9796 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9816 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 3 ms 9820 KB Output is correct
23 Correct 3 ms 9820 KB Output is correct
24 Correct 3 ms 9800 KB Output is correct
25 Correct 3 ms 9820 KB Output is correct
26 Correct 3 ms 9820 KB Output is correct
27 Correct 2 ms 9816 KB Output is correct
28 Correct 2 ms 9756 KB Output is correct
29 Correct 3 ms 9820 KB Output is correct
30 Correct 10 ms 9812 KB Output is correct
31 Correct 11 ms 9820 KB Output is correct
32 Correct 16 ms 10024 KB Output is correct
33 Correct 15 ms 10072 KB Output is correct
34 Correct 15 ms 9820 KB Output is correct
35 Correct 6 ms 9816 KB Output is correct
36 Correct 6 ms 9820 KB Output is correct
37 Correct 7 ms 9816 KB Output is correct
38 Correct 14 ms 10100 KB Output is correct
39 Correct 16 ms 10332 KB Output is correct
40 Correct 14 ms 10076 KB Output is correct
41 Correct 6 ms 10076 KB Output is correct
42 Correct 6 ms 10080 KB Output is correct
43 Correct 5 ms 10072 KB Output is correct
44 Correct 15 ms 10076 KB Output is correct
45 Correct 14 ms 10048 KB Output is correct
46 Correct 14 ms 10076 KB Output is correct
47 Correct 5 ms 9820 KB Output is correct
48 Correct 5 ms 9820 KB Output is correct
49 Correct 6 ms 9820 KB Output is correct
50 Correct 14 ms 10036 KB Output is correct
51 Correct 15 ms 9908 KB Output is correct
52 Correct 14 ms 10032 KB Output is correct
53 Correct 14 ms 10060 KB Output is correct
54 Correct 16 ms 9804 KB Output is correct
55 Correct 17 ms 10032 KB Output is correct
56 Correct 3 ms 9820 KB Output is correct
57 Correct 3 ms 9820 KB Output is correct
58 Correct 3 ms 9896 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9560 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 3 ms 9824 KB Output is correct
4 Execution timed out 5030 ms 27732 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9564 KB Output is correct
2 Incorrect 47 ms 21016 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Execution timed out 5024 ms 24148 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9564 KB Output is correct
2 Correct 2 ms 9564 KB Output is correct
3 Correct 2 ms 9564 KB Output is correct
4 Correct 3 ms 10048 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 3 ms 10072 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 2 ms 9820 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 3 ms 9820 KB Output is correct
16 Correct 3 ms 9796 KB Output is correct
17 Correct 3 ms 9820 KB Output is correct
18 Correct 3 ms 9820 KB Output is correct
19 Correct 3 ms 9816 KB Output is correct
20 Correct 3 ms 9820 KB Output is correct
21 Correct 3 ms 9820 KB Output is correct
22 Correct 3 ms 9820 KB Output is correct
23 Correct 3 ms 9820 KB Output is correct
24 Correct 3 ms 9800 KB Output is correct
25 Correct 3 ms 9820 KB Output is correct
26 Correct 3 ms 9820 KB Output is correct
27 Correct 2 ms 9816 KB Output is correct
28 Correct 2 ms 9756 KB Output is correct
29 Correct 3 ms 9820 KB Output is correct
30 Correct 10 ms 9812 KB Output is correct
31 Correct 11 ms 9820 KB Output is correct
32 Correct 16 ms 10024 KB Output is correct
33 Correct 15 ms 10072 KB Output is correct
34 Correct 15 ms 9820 KB Output is correct
35 Correct 6 ms 9816 KB Output is correct
36 Correct 6 ms 9820 KB Output is correct
37 Correct 7 ms 9816 KB Output is correct
38 Correct 14 ms 10100 KB Output is correct
39 Correct 16 ms 10332 KB Output is correct
40 Correct 14 ms 10076 KB Output is correct
41 Correct 6 ms 10076 KB Output is correct
42 Correct 6 ms 10080 KB Output is correct
43 Correct 5 ms 10072 KB Output is correct
44 Correct 15 ms 10076 KB Output is correct
45 Correct 14 ms 10048 KB Output is correct
46 Correct 14 ms 10076 KB Output is correct
47 Correct 5 ms 9820 KB Output is correct
48 Correct 5 ms 9820 KB Output is correct
49 Correct 6 ms 9820 KB Output is correct
50 Correct 14 ms 10036 KB Output is correct
51 Correct 15 ms 9908 KB Output is correct
52 Correct 14 ms 10032 KB Output is correct
53 Correct 14 ms 10060 KB Output is correct
54 Correct 16 ms 9804 KB Output is correct
55 Correct 17 ms 10032 KB Output is correct
56 Correct 3 ms 9820 KB Output is correct
57 Correct 3 ms 9820 KB Output is correct
58 Correct 3 ms 9896 KB Output is correct
59 Correct 3 ms 9560 KB Output is correct
60 Correct 2 ms 9820 KB Output is correct
61 Correct 3 ms 9824 KB Output is correct
62 Execution timed out 5030 ms 27732 KB Time limit exceeded
63 Halted 0 ms 0 KB -