oj.uz

Submission #916663

# Submission time Handle Problem Language Result Execution time Memory
916663 2024-01-26T08:57:46 Z thangdz2k7 Tourism (JOI23_tourism) C++17
34 / 100
 5000 ms 20968 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 <ii> s;

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

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

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

int cur[N];

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

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

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

    s.insert(ii(l, r));
    cur[l] = 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(ii(0, 0)), s.insert(ii(n + 1, n + 1));

    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 8540 KB Output is correct
4 Correct 2 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 3 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8540 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 8716 KB Output is correct
16 Correct 10 ms 8536 KB Output is correct
17 Correct 9 ms 8720 KB Output is correct
18 Correct 7 ms 8712 KB Output is correct
19 Correct 7 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 2 ms 8540 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 8628 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8540 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 8540 KB Output is correct
4 Correct 2 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 3 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8540 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 8716 KB Output is correct
16 Correct 10 ms 8536 KB Output is correct
17 Correct 9 ms 8720 KB Output is correct
18 Correct 7 ms 8712 KB Output is correct
19 Correct 7 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 2 ms 8540 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 8628 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 8 ms 8796 KB Output is correct
31 Correct 9 ms 8796 KB Output is correct
32 Correct 11 ms 8796 KB Output is correct
33 Correct 11 ms 8796 KB Output is correct
34 Correct 11 ms 8796 KB Output is correct
35 Correct 11 ms 8796 KB Output is correct
36 Correct 11 ms 8796 KB Output is correct
37 Correct 11 ms 8852 KB Output is correct
38 Correct 390 ms 8796 KB Output is correct
39 Correct 398 ms 8968 KB Output is correct
40 Correct 393 ms 8988 KB Output is correct
41 Correct 414 ms 8968 KB Output is correct
42 Correct 391 ms 9248 KB Output is correct
43 Correct 405 ms 8936 KB Output is correct
44 Correct 188 ms 9044 KB Output is correct
45 Correct 149 ms 8796 KB Output is correct
46 Correct 176 ms 8796 KB Output is correct
47 Correct 165 ms 8876 KB Output is correct
48 Correct 134 ms 8876 KB Output is correct
49 Correct 186 ms 8796 KB Output is correct
50 Correct 6 ms 8796 KB Output is correct
51 Correct 5 ms 8796 KB Output is correct
52 Correct 5 ms 8896 KB Output is correct
53 Correct 5 ms 8796 KB Output is correct
54 Correct 5 ms 8796 KB Output is correct
55 Correct 5 ms 8780 KB Output is correct
56 Correct 4 ms 8540 KB Output is correct
57 Correct 4 ms 8796 KB Output is correct
58 Correct 11 ms 9048 KB Output is correct

Subtask #3
0 / 7.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 3 ms 8536 KB Output is correct
4 Execution timed out 5089 ms 19248 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 8540 KB Output is correct
2 Correct 517 ms 13524 KB Output is correct
3 Correct 838 ms 13908 KB Output is correct
4 Correct 660 ms 14420 KB Output is correct
5 Correct 1096 ms 16980 KB Output is correct
6 Correct 1071 ms 16980 KB Output is correct
7 Correct 1099 ms 16980 KB Output is correct
8 Correct 1035 ms 16980 KB Output is correct
9 Correct 1120 ms 16980 KB Output is correct
10 Correct 1072 ms 17160 KB Output is correct
11 Correct 1108 ms 17016 KB Output is correct
12 Correct 1134 ms 17324 KB Output is correct
13 Correct 1092 ms 17352 KB Output is correct
14 Correct 1035 ms 18440 KB Output is correct
15 Correct 1104 ms 20968 KB Output is correct
16 Correct 1071 ms 17288 KB Output is correct
17 Correct 1123 ms 17488 KB Output is correct
18 Correct 1076 ms 17328 KB Output is correct
19 Execution timed out 5024 ms 16992 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 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 1113 ms 15948 KB Output is correct
5 Correct 1125 ms 16064 KB Output is correct
6 Correct 1380 ms 18516 KB Output is correct
7 Correct 1394 ms 19572 KB Output is correct
8 Correct 1339 ms 19796 KB Output is correct
9 Correct 1447 ms 19564 KB Output is correct
10 Correct 1392 ms 19572 KB Output is correct
11 Correct 1387 ms 19564 KB Output is correct
12 Correct 1387 ms 19772 KB Output is correct
13 Correct 1327 ms 19792 KB Output is correct
14 Correct 41 ms 11348 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 8540 KB Output is correct
4 Correct 2 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 3 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 3 ms 8540 KB Output is correct
11 Correct 3 ms 8540 KB Output is correct
12 Correct 3 ms 8540 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 8716 KB Output is correct
16 Correct 10 ms 8536 KB Output is correct
17 Correct 9 ms 8720 KB Output is correct
18 Correct 7 ms 8712 KB Output is correct
19 Correct 7 ms 8540 KB Output is correct
20 Correct 8 ms 8540 KB Output is correct
21 Correct 2 ms 8540 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 8628 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 8 ms 8796 KB Output is correct
31 Correct 9 ms 8796 KB Output is correct
32 Correct 11 ms 8796 KB Output is correct
33 Correct 11 ms 8796 KB Output is correct
34 Correct 11 ms 8796 KB Output is correct
35 Correct 11 ms 8796 KB Output is correct
36 Correct 11 ms 8796 KB Output is correct
37 Correct 11 ms 8852 KB Output is correct
38 Correct 390 ms 8796 KB Output is correct
39 Correct 398 ms 8968 KB Output is correct
40 Correct 393 ms 8988 KB Output is correct
41 Correct 414 ms 8968 KB Output is correct
42 Correct 391 ms 9248 KB Output is correct
43 Correct 405 ms 8936 KB Output is correct
44 Correct 188 ms 9044 KB Output is correct
45 Correct 149 ms 8796 KB Output is correct
46 Correct 176 ms 8796 KB Output is correct
47 Correct 165 ms 8876 KB Output is correct
48 Correct 134 ms 8876 KB Output is correct
49 Correct 186 ms 8796 KB Output is correct
50 Correct 6 ms 8796 KB Output is correct
51 Correct 5 ms 8796 KB Output is correct
52 Correct 5 ms 8896 KB Output is correct
53 Correct 5 ms 8796 KB Output is correct
54 Correct 5 ms 8796 KB Output is correct
55 Correct 5 ms 8780 KB Output is correct
56 Correct 4 ms 8540 KB Output is correct
57 Correct 4 ms 8796 KB Output is correct
58 Correct 11 ms 9048 KB Output is correct
59 Correct 2 ms 8540 KB Output is correct
60 Correct 2 ms 8540 KB Output is correct
61 Correct 3 ms 8536 KB Output is correct
62 Execution timed out 5089 ms 19248 KB Time limit exceeded
63 Halted 0 ms 0 KB -