oj.uz

Submission #767731

# Submission time Handle Problem Language Result Execution time Memory
767731 2023-06-27T06:04:31 Z PurpleCrayon Tourism (JOI23_tourism) C++17
17 / 100
 5000 ms 64676 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 1e5+10, MOD = 1e9+7;
const int L = 19;

int n, m, q, st[N], en[N], depth[N], tt = 0;
vector<int> adj[N];

vector<int> lca_et;
int sparse[2 * N][L], st_lca[N], en_lca[N];

int dep_min(int a, int b) {
    return depth[a] < depth[b] ? a : b;
}

void build_rmq() {
    int k = sz(lca_et);
    for (int i = 0; i < k; i++) sparse[i][0] = lca_et[i];
    for (int c = 2, l = 1; c <= k; c *= 2, l++) {
        for (int i = 0; i + c <= k; i++) {
            sparse[i][l] = dep_min(sparse[i][l-1], sparse[i + c/2][l-1]);
        }
    }
}

int rmq_qry(int l, int r) {
    int lg = 31 - __builtin_clz(r - l + 1);
    int len = 1 << lg;
    return dep_min(sparse[l][lg], sparse[r - len + 1][lg]);
}

int lca(int a, int b) {
    if (st_lca[a] > st_lca[b]) swap(a, b);
    return rmq_qry(st_lca[a], en_lca[b]);
}

void dfs(int c, int p) {
    if (p != -1) depth[c] = depth[p] + 1;
    st[c] = tt++;

    st_lca[c] = en_lca[c] = sz(lca_et);
    lca_et.push_back(c);
    for (int nxt : adj[c]) if (nxt != p) {
        dfs(nxt, c);

        en_lca[c] = sz(lca_et);
        lca_et.push_back(c);
    }

    en[c] = tt-1;
}

int ans[N], c[N], lca_l[N], lca_r[N];
int rev[N], par[N], w[N];
pair<int, int> range[N];
vector<int> aux[N];
vector<pair<int, int>> ev[N];

void dfs_aux_range(int c) {
    for (int nxt : aux[c]) {
        dfs_aux_range(nxt);
        range[c].first = max(range[c].first, range[nxt].first);
        range[c].second = min(range[c].second, range[nxt].second);
    }
}

void rec(int l, int r, vector<ar<int, 3>> qs) {
    if (!sz(qs)) return;
    if (r <= l) return;

    int m = (l + r) / 2; // [l..m], [m+1..r]
    vector<ar<int, 3>> one, two, mine;
    for (auto qi : qs) {
        if (qi[1] <= m)
            one.push_back(qi);
        else if (qi[0] > m)
            two.push_back(qi);
        else
            mine.push_back(qi);
    }

    rec(l, m, one), rec(m+1, r, two);

    vector<int> use;
    for (int i = l; i <= r; i++) use.push_back(c[i]);

    sort(use.begin(), use.end(), [&](int x, int y) {
        return st[x] < st[y];
    });

    use.resize(unique(use.begin(), use.end()) - use.begin());
    int base = sz(use);
    for (int i = 0; i < base; i++) {
        use.push_back(lca(use[i], use[(i+1) % base]));
    }

    sort(use.begin(), use.end(), [&](int x, int y) {
        return st[x] < st[y];
    });

    use.resize(unique(use.begin(), use.end()) - use.begin());
    for (int i = 0; i < sz(use); i++) {
        rev[use[i]] = i;
        aux[i].clear();
    }

    for (int i = 1; i < sz(use); i++) {
        par[i] = rev[lca(use[i-1], use[i])];
        aux[par[i]].push_back(i);
        w[i] = depth[use[i]] - depth[use[par[i]]];
    }
    
    int k = sz(use);
    // max index of something on the left, min index of something on the right
    for (int i = 0; i < k; i++) {
        range[i] = {-1, MOD};
    }

    for (int i = l; i <= m; i++) {
        int cur = rev[c[i]];
        range[cur].first = max(range[cur].first, i);
    }

    for (int i = m+1; i <= r; i++) {
        int cur = rev[c[i]];
        range[cur].second = min(range[cur].second, i);
    }

    dfs_aux_range(0);
    for (int i = m; i >= l; i--) {
        lca_l[i] = c[i];
        if (i < m) lca_l[i] = lca(lca_l[i], lca_l[i+1]);
    }

    for (int i = m+1; i <= r; i++) {
        lca_r[i] = c[i];
        if (i > m+1) lca_r[i] = lca(lca_r[i], lca_r[i-1]);
    }

    int sum = 0;
    for (int j = 1; j < k; j++) sum += w[j];
    int top = use[0];

    for (int i = l; i <= r; i++) ev[i].clear();

    vector<int> data(r - l + 1);
    auto add = [&](int L, int R, int x) {
        if (R < L) return;
        L -= l;
        R -= l;
        for (int i = L; i <= R; i++) data[i] += x;
    };

    auto qry = [&](int i) {
        return data[i - l];
    };

    for (int j = 1; j < k; j++) {
        if (range[j].first < l) {
            ev[l].push_back({range[j].second, -w[j]});
        }
    }

    for (auto [L, R, i] : mine) {
        ans[i] += sum;
        ans[i] -= depth[lca(lca_l[L], lca_r[R])] - depth[top];

        ev[L].push_back({R, i});

        /*
        for (int j = 1; j < k; j++) {
            if (range[j].first < L && R < range[j].second) {
                ans[i] -= w[j];
            }
        }
        */
    }

    for (int j = 1; j < k; j++) {
        if (range[j].first >= l) {
            ev[range[j].first].push_back({range[j].second, -w[j]});
        }
    }

    for (int i = l; i <= r; i++) {
        for (auto [R, x] : ev[i]) {
            if (x >= 0) {
                ans[x] += qry(R);
            } else {
                x *= -1;
                add(l, min(r, R-1), -x);
            }
        }
    }
}

void solve() {
    cin >> n >> m >> q;
    for (int i = 0; i < n-1; i++) {
        int a, b; cin >> a >> b, --a, --b;
        adj[a].push_back(b), adj[b].push_back(a);
    }

    dfs(0, -1);
    build_rmq();

    for (int i = 0; i < m; i++) {
        cin >> c[i], --c[i];
    }

    vector<ar<int, 3>> qs(q);
    for (int i = 0; i < q; i++) {
        int l, r; cin >> l >> r, --l, --r;
        qs[i] = {l, r, i};
    }

    rec(0, m-1, qs);

    for (int i = 0; i < q; i++) cout << ans[i]+1 << '\n';
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7508 KB Output is correct
9 Correct 4 ms 7508 KB Output is correct
10 Correct 4 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 4 ms 7508 KB Output is correct
13 Correct 4 ms 7508 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7508 KB Output is correct
16 Correct 4 ms 7508 KB Output is correct
17 Correct 4 ms 7508 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 4 ms 7492 KB Output is correct
20 Correct 4 ms 7492 KB Output is correct
21 Correct 3 ms 7508 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 3 ms 7508 KB Output is correct
26 Correct 5 ms 7508 KB Output is correct
27 Correct 4 ms 7372 KB Output is correct
28 Correct 3 ms 7380 KB Output is correct
29 Correct 4 ms 7508 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7508 KB Output is correct
9 Correct 4 ms 7508 KB Output is correct
10 Correct 4 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 4 ms 7508 KB Output is correct
13 Correct 4 ms 7508 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7508 KB Output is correct
16 Correct 4 ms 7508 KB Output is correct
17 Correct 4 ms 7508 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 4 ms 7492 KB Output is correct
20 Correct 4 ms 7492 KB Output is correct
21 Correct 3 ms 7508 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 3 ms 7508 KB Output is correct
26 Correct 5 ms 7508 KB Output is correct
27 Correct 4 ms 7372 KB Output is correct
28 Correct 3 ms 7380 KB Output is correct
29 Correct 4 ms 7508 KB Output is correct
30 Correct 10 ms 7892 KB Output is correct
31 Correct 8 ms 7892 KB Output is correct
32 Correct 9 ms 8148 KB Output is correct
33 Correct 11 ms 8200 KB Output is correct
34 Correct 11 ms 8208 KB Output is correct
35 Correct 6 ms 8020 KB Output is correct
36 Correct 5 ms 8020 KB Output is correct
37 Correct 5 ms 8020 KB Output is correct
38 Correct 10 ms 8276 KB Output is correct
39 Correct 10 ms 8276 KB Output is correct
40 Correct 10 ms 8276 KB Output is correct
41 Correct 7 ms 8148 KB Output is correct
42 Correct 5 ms 8148 KB Output is correct
43 Correct 5 ms 8148 KB Output is correct
44 Correct 8 ms 8148 KB Output is correct
45 Correct 8 ms 8148 KB Output is correct
46 Correct 8 ms 8148 KB Output is correct
47 Correct 5 ms 8020 KB Output is correct
48 Correct 5 ms 8020 KB Output is correct
49 Correct 5 ms 8020 KB Output is correct
50 Correct 8 ms 8148 KB Output is correct
51 Correct 7 ms 8148 KB Output is correct
52 Correct 8 ms 8148 KB Output is correct
53 Correct 8 ms 8148 KB Output is correct
54 Correct 8 ms 8148 KB Output is correct
55 Correct 9 ms 8148 KB Output is correct
56 Correct 5 ms 7508 KB Output is correct
57 Correct 4 ms 7892 KB Output is correct
58 Correct 15 ms 8228 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7508 KB Output is correct
4 Correct 2469 ms 39152 KB Output is correct
5 Correct 1338 ms 42732 KB Output is correct
6 Correct 2523 ms 48740 KB Output is correct
7 Correct 3707 ms 55868 KB Output is correct
8 Correct 3682 ms 55832 KB Output is correct
9 Correct 3747 ms 56088 KB Output is correct
10 Correct 3665 ms 56036 KB Output is correct
11 Correct 3596 ms 55852 KB Output is correct
12 Correct 1900 ms 49652 KB Output is correct
13 Correct 1953 ms 49636 KB Output is correct
14 Correct 1955 ms 49640 KB Output is correct
15 Correct 59 ms 39900 KB Output is correct
16 Correct 3812 ms 64676 KB Output is correct
17 Correct 61 ms 16596 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 2071 ms 26264 KB Output is correct
3 Correct 4632 ms 31400 KB Output is correct
4 Correct 3142 ms 31332 KB Output is correct
5 Correct 2498 ms 33600 KB Output is correct
6 Correct 4212 ms 35532 KB Output is correct
7 Execution timed out 5082 ms 37308 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 4 ms 7508 KB Output is correct
4 Correct 4608 ms 35312 KB Output is correct
5 Correct 4899 ms 38220 KB Output is correct
6 Execution timed out 5079 ms 46052 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7508 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7508 KB Output is correct
9 Correct 4 ms 7508 KB Output is correct
10 Correct 4 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 4 ms 7508 KB Output is correct
13 Correct 4 ms 7508 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7508 KB Output is correct
16 Correct 4 ms 7508 KB Output is correct
17 Correct 4 ms 7508 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 4 ms 7492 KB Output is correct
20 Correct 4 ms 7492 KB Output is correct
21 Correct 3 ms 7508 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 3 ms 7508 KB Output is correct
26 Correct 5 ms 7508 KB Output is correct
27 Correct 4 ms 7372 KB Output is correct
28 Correct 3 ms 7380 KB Output is correct
29 Correct 4 ms 7508 KB Output is correct
30 Correct 10 ms 7892 KB Output is correct
31 Correct 8 ms 7892 KB Output is correct
32 Correct 9 ms 8148 KB Output is correct
33 Correct 11 ms 8200 KB Output is correct
34 Correct 11 ms 8208 KB Output is correct
35 Correct 6 ms 8020 KB Output is correct
36 Correct 5 ms 8020 KB Output is correct
37 Correct 5 ms 8020 KB Output is correct
38 Correct 10 ms 8276 KB Output is correct
39 Correct 10 ms 8276 KB Output is correct
40 Correct 10 ms 8276 KB Output is correct
41 Correct 7 ms 8148 KB Output is correct
42 Correct 5 ms 8148 KB Output is correct
43 Correct 5 ms 8148 KB Output is correct
44 Correct 8 ms 8148 KB Output is correct
45 Correct 8 ms 8148 KB Output is correct
46 Correct 8 ms 8148 KB Output is correct
47 Correct 5 ms 8020 KB Output is correct
48 Correct 5 ms 8020 KB Output is correct
49 Correct 5 ms 8020 KB Output is correct
50 Correct 8 ms 8148 KB Output is correct
51 Correct 7 ms 8148 KB Output is correct
52 Correct 8 ms 8148 KB Output is correct
53 Correct 8 ms 8148 KB Output is correct
54 Correct 8 ms 8148 KB Output is correct
55 Correct 9 ms 8148 KB Output is correct
56 Correct 5 ms 7508 KB Output is correct
57 Correct 4 ms 7892 KB Output is correct
58 Correct 15 ms 8228 KB Output is correct
59 Correct 3 ms 7380 KB Output is correct
60 Correct 5 ms 7380 KB Output is correct
61 Correct 4 ms 7508 KB Output is correct
62 Correct 2469 ms 39152 KB Output is correct
63 Correct 1338 ms 42732 KB Output is correct
64 Correct 2523 ms 48740 KB Output is correct
65 Correct 3707 ms 55868 KB Output is correct
66 Correct 3682 ms 55832 KB Output is correct
67 Correct 3747 ms 56088 KB Output is correct
68 Correct 3665 ms 56036 KB Output is correct
69 Correct 3596 ms 55852 KB Output is correct
70 Correct 1900 ms 49652 KB Output is correct
71 Correct 1953 ms 49636 KB Output is correct
72 Correct 1955 ms 49640 KB Output is correct
73 Correct 59 ms 39900 KB Output is correct
74 Correct 3812 ms 64676 KB Output is correct
75 Correct 61 ms 16596 KB Output is correct
76 Correct 4 ms 7380 KB Output is correct
77 Correct 2071 ms 26264 KB Output is correct
78 Correct 4632 ms 31400 KB Output is correct
79 Correct 3142 ms 31332 KB Output is correct
80 Correct 2498 ms 33600 KB Output is correct
81 Correct 4212 ms 35532 KB Output is correct
82 Execution timed out 5082 ms 37308 KB Time limit exceeded
83 Halted 0 ms 0 KB -