oj.uz

Submission #916657

# Submission time Handle Problem Language Result Execution time Memory
916657 2024-01-26T08:48:56 Z thangdz2k7 Tourism (JOI23_tourism) C++17
34 / 100
 5000 ms 21868 KB 
#include <bits/stdc++.h>
#define ii pair <int, int>
#define iii pair <ii, int>
#define F first
#define S second
#define pb push_back

using namespace std;

const int N = 1e5 + 5;

int n, m, q;
int c[N], l[N], r[N];
vector <int> adj[N], query[N];

int bit[N];

void update(int u, int v){
    while (u <= m){
        bit[u] += v;
        u += (u & (-u));
    }
}

int get(int u){
    int ans = 0;
    while (u > 0){
        ans += bit[u];
        u -= (u & (-u));
    }

    return ans;
}

int par[N], heavy[N], depth[N];

int dfs(int u, int pa){
    int sz = 0;
    par[u] = pa;
    int maxsz = 0;
    depth[u] = depth[pa] + 1;

    for (int v : adj[u]){
        if (v == pa) continue;
        int cur = dfs(v, u);
        sz += cur;
        if (maxsz < cur){
            cur = maxsz;
            heavy[u] = v;

        }
    }

    return sz;
}

int pos[N], head[N], cu;
set <iii> s;

void decompose(int u, int h){
    head[u] = h;
    ++ cu;
    pos[u] = cu;
    s.insert(iii(ii(cu, cu), 0));

    if (heavy[u]){
        decompose(heavy[u], h);
    }

    for (int v : adj[u]){
        if (v != par[u] && v != heavy[u]) decompose(v, v);
    }
}

void add(int t, int l, int r, int val){
    while (true){
        iii z = *s.lower_bound(iii(ii(l, -1), -1));
        if (z.F.F > r) break;
        s.erase(z);
        if (z.F.S > r) {
            s.insert(iii(ii(r + 1, z.F.S), z.S));
            int le = r - z.F.F + 1;
            update(z.S + 1, le);
            update(val + 1, -le);
        }
        else {
            int le = z.F.S - z.F.F + 1;
            update(z.S + 1, le);
            update(val + 1, -le);
        }
    }

    iii z = *(--s.lower_bound(iii(ii(l, -1), -1)));
    if (z.F.S > r){
        s.erase(z);
        s.insert(iii(ii(z.F.F, l - 1), z.S));
        s.insert(iii(ii(r + 1, z.F.S), z.S));
        int le = r - l + 1;
        update(z.S + 1, le);
        update(val + 1, -le);
    }

    else if (z.F.S >= l){
         s.erase(z);
         s.insert(iii(ii(z.F.F, l - 1), z.S));
         int le = z.F.S - l + 1;
         update(z.S + 1, le);
         update(val + 1, -le);
    }

    s.insert(iii(ii(l, r), val));
}

void upd(int u, int v, int val){
    for (; head[u] != head[v]; v = par[head[v]]){
        if (depth[head[u]] > depth[head[v]]) swap(u, v);
        add(head[v], pos[head[v]], pos[v], val);

    }

    if (depth[u] > depth[v]) swap(u, v);
    add(head[u], pos[u], pos[v], val);
}

int ans[N];

void solve(){
    cin >> n >> m >> q;
    for (int i = 1, u, v; i <= n - 1; ++ i){
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    for (int i = 1; i <= m; ++ i) cin >> c[i];
    for (int i = 1, r; i <= q; ++ i){
        cin >> l[i] >> r;
        query[r].pb(i);
    }

    dfs(1, 0);
    decompose(1, 1);

    s.insert(iii(ii(0, 0), 0)), s.insert(iii(ii(n + 1, n + 1), 0));

    for (int i = 1; i <= m; ++ i){
        if (i > 1) upd(c[i], c[i - 1], i - 1);
        for (int k : query[i]){
            ans[k] = max(1, get(l[k]));
        }
    }

    for (int i = 1; i <= q; ++ i) cout << ans[i] << '\n';
}

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

    solve();
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8552 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 3 ms 8788 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8628 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 9 ms 8540 KB Output is correct
17 Correct 10 ms 8540 KB Output is correct
18 Correct 8 ms 8692 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 9 ms 8536 KB Output is correct
21 Correct 3 ms 8636 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 3 ms 8536 KB Output is correct
27 Correct 2 ms 8636 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8552 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 3 ms 8788 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8628 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 9 ms 8540 KB Output is correct
17 Correct 10 ms 8540 KB Output is correct
18 Correct 8 ms 8692 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 9 ms 8536 KB Output is correct
21 Correct 3 ms 8636 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 3 ms 8536 KB Output is correct
27 Correct 2 ms 8636 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct
30 Correct 10 ms 8796 KB Output is correct
31 Correct 9 ms 8848 KB Output is correct
32 Correct 15 ms 8916 KB Output is correct
33 Correct 13 ms 8796 KB Output is correct
34 Correct 11 ms 8792 KB Output is correct
35 Correct 11 ms 8796 KB Output is correct
36 Correct 12 ms 8796 KB Output is correct
37 Correct 13 ms 8884 KB Output is correct
38 Correct 415 ms 9040 KB Output is correct
39 Correct 410 ms 8992 KB Output is correct
40 Correct 431 ms 9004 KB Output is correct
41 Correct 408 ms 8992 KB Output is correct
42 Correct 404 ms 8992 KB Output is correct
43 Correct 409 ms 8956 KB Output is correct
44 Correct 195 ms 8796 KB Output is correct
45 Correct 156 ms 8916 KB Output is correct
46 Correct 181 ms 8960 KB Output is correct
47 Correct 169 ms 8904 KB Output is correct
48 Correct 133 ms 8796 KB Output is correct
49 Correct 191 ms 8920 KB Output is correct
50 Correct 5 ms 8796 KB Output is correct
51 Correct 5 ms 8796 KB Output is correct
52 Correct 5 ms 8792 KB Output is correct
53 Correct 5 ms 8796 KB Output is correct
54 Correct 5 ms 9048 KB Output is correct
55 Correct 5 ms 8796 KB Output is correct
56 Correct 2 ms 8540 KB Output is correct
57 Correct 4 ms 8792 KB Output is correct
58 Correct 12 ms 8796 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 3 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Execution timed out 5025 ms 19948 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 524 ms 13960 KB Output is correct
3 Correct 875 ms 14540 KB Output is correct
4 Correct 729 ms 15488 KB Output is correct
5 Correct 1072 ms 18384 KB Output is correct
6 Correct 1063 ms 18380 KB Output is correct
7 Correct 1070 ms 18516 KB Output is correct
8 Correct 1047 ms 18516 KB Output is correct
9 Correct 1134 ms 18344 KB Output is correct
10 Correct 1117 ms 18468 KB Output is correct
11 Correct 1033 ms 18272 KB Output is correct
12 Correct 1148 ms 18732 KB Output is correct
13 Correct 1129 ms 19180 KB Output is correct
14 Correct 1068 ms 19688 KB Output is correct
15 Correct 1160 ms 21868 KB Output is correct
16 Correct 1113 ms 18768 KB Output is correct
17 Correct 1168 ms 18816 KB Output is correct
18 Correct 1065 ms 18968 KB Output is correct
19 Execution timed out 5037 ms 18200 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 1114 ms 16268 KB Output is correct
5 Correct 1184 ms 16624 KB Output is correct
6 Correct 1450 ms 19284 KB Output is correct
7 Correct 1464 ms 20748 KB Output is correct
8 Correct 1726 ms 20748 KB Output is correct
9 Correct 1588 ms 20748 KB Output is correct
10 Correct 1614 ms 20824 KB Output is correct
11 Correct 1576 ms 20744 KB Output is correct
12 Correct 1495 ms 20744 KB Output is correct
13 Correct 1466 ms 20968 KB Output is correct
14 Correct 44 ms 10956 KB Output is correct

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8552 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 3 ms 8788 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8628 KB Output is correct
13 Correct 3 ms 8540 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 9 ms 8540 KB Output is correct
16 Correct 9 ms 8540 KB Output is correct
17 Correct 10 ms 8540 KB Output is correct
18 Correct 8 ms 8692 KB Output is correct
19 Correct 8 ms 8540 KB Output is correct
20 Correct 9 ms 8536 KB Output is correct
21 Correct 3 ms 8636 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 3 ms 8536 KB Output is correct
27 Correct 2 ms 8636 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct
30 Correct 10 ms 8796 KB Output is correct
31 Correct 9 ms 8848 KB Output is correct
32 Correct 15 ms 8916 KB Output is correct
33 Correct 13 ms 8796 KB Output is correct
34 Correct 11 ms 8792 KB Output is correct
35 Correct 11 ms 8796 KB Output is correct
36 Correct 12 ms 8796 KB Output is correct
37 Correct 13 ms 8884 KB Output is correct
38 Correct 415 ms 9040 KB Output is correct
39 Correct 410 ms 8992 KB Output is correct
40 Correct 431 ms 9004 KB Output is correct
41 Correct 408 ms 8992 KB Output is correct
42 Correct 404 ms 8992 KB Output is correct
43 Correct 409 ms 8956 KB Output is correct
44 Correct 195 ms 8796 KB Output is correct
45 Correct 156 ms 8916 KB Output is correct
46 Correct 181 ms 8960 KB Output is correct
47 Correct 169 ms 8904 KB Output is correct
48 Correct 133 ms 8796 KB Output is correct
49 Correct 191 ms 8920 KB Output is correct
50 Correct 5 ms 8796 KB Output is correct
51 Correct 5 ms 8796 KB Output is correct
52 Correct 5 ms 8792 KB Output is correct
53 Correct 5 ms 8796 KB Output is correct
54 Correct 5 ms 9048 KB Output is correct
55 Correct 5 ms 8796 KB Output is correct
56 Correct 2 ms 8540 KB Output is correct
57 Correct 4 ms 8792 KB Output is correct
58 Correct 12 ms 8796 KB Output is correct
59 Correct 2 ms 8536 KB Output is correct
60 Correct 3 ms 8540 KB Output is correct
61 Correct 3 ms 8540 KB Output is correct
62 Execution timed out 5025 ms 19948 KB Time limit exceeded
63 Halted 0 ms 0 KB -