oj.uz

Submission #1001301

# Submission time Handle Problem Language Result Execution time Memory
1001301 2024-06-18T18:23:31 Z LonlyR Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 53676 KB 
#include<bits/stdc++.h>
#define int signed
#define all(x) x.begin(), x.end()
#define ii pair<int,int>
#define ff first
#define ss second
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
 
using namespace std;
const int maxn = 1e5 + 5, bl = sqrt(maxn);
int n, m, q, cnt, cur;
int in[maxn], out[maxn], h[maxn], par[18][maxn], id[maxn], c[maxn], ans[maxn], in_set[maxn];
vector<int> adj[maxn], euler = {0};
int lgs[3*maxn];
 
int rev_in[maxn];
 
set<int> s;
 
struct Q{
    int l, r, id;
    bool operator < (Q b) const
    {
        if (l / bl != b.l / bl) return l < b.l;
        return (l / bl & 1) ? (r < b.r) : (r > b.r);
    }
} qr[maxn];
 
void dfs(int x = 1, int p = 1)
{
    h[x] = h[p] + 1;
    in[x] = ++cnt;
    id[x] = euler.size();
    euler.push_back(x);
    for (int i : adj[x]) if (i != p)
        dfs(i, x),
        euler.push_back(x);
    out[x] = cnt;
}
 
//inline bool sub(int u, int v) /// u in subtree of v
//{
//    return in[v] <= in[u] && out[u] <= out[v];
//}
//
//int lca(int u, int v)
//{
//    if (h[u] > h[v]) swap(u, v);
//    if (sub(v, u)) return u;
//    for (int i = 17; i >= 0; i--)
//        if (sub(u, par[i][v]) == 0)
//            v = par[i][v];
//    return par[0][v];
//}
 
vector<vector<ii>> st;
 
inline void build()
{
    int sz = euler.size();
    int LG = __lg(sz);
    st = vector<vector<ii>>(LG + 1, vector<ii>(sz, {sz, 0}));
    for (int i = 1; i < sz; i++) st[0][i] = {h[euler[i]], euler[i]};
    for (int j = 1; j <= LG; j++)
        for (int i = 1; i + (1 << j) - 1 < sz; i++)
            st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
}
 
inline int lca(int l, int r)
{
    l = id[l];
    r = id[r];
    if (l > r) swap(l, r);
//    assert(r-l+1<=n);
    int k = lgs[(r - l + 1)];
    return min(st[k][l], st[k][r - (1 << k) + 1]).ss;
}
 
inline void add(int x)
{
    x = c[x];
    in_set[x]++;
    if (in_set[x] == 1)
    {
        cur += h[x];
        if (s.size() == 0) return s.insert(in[x]), void();
        auto it = s.lower_bound(in[x]);
        if (it == s.begin())
            cur -= h[lca(x, rev_in[*it])];
        else if (it == s.end())
            cur -= h[lca(x, rev_in[*prev(it)])];
        else
        {
            auto u = rev_in[*it], v = rev_in[*prev(it)];
            cur += h[lca(u, v)];
            cur -= h[lca(u, x)];
            cur -= h[lca(v, x)];
        }
    }
    s.insert(in[x]);
}
 
inline void del(int x)
{
    x = c[x];
    in_set[x]--;
    if (in_set[x] == 0)
    {
        cur -= h[x];
        if (s.size() == 1) return s.clear(), void();
        auto it = s.lower_bound(in[x]);
        if (it == s.begin())
            cur += h[lca(x, rev_in[*next(it)])];
        else if (next(it) == s.end())
            cur += h[lca(x, rev_in[*prev(it)])];
        else
        {
            auto u = rev_in[*prev(it)], v = rev_in[*next(it)];
            cur -= h[lca(u, v)];
            cur += h[lca(u, x)];
            cur += h[lca(v, x)];
        }
        s.erase(it);
    }
 
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); //cout.tie(0);
//    freopen("test.inp", "r", stdin);
//    freopen("test.out", "w", stdout);
    cin >> n >> m >> q;
    for (int i = 1, u, v; i < n; i++)
        cin >> u >> v,
        adj[u].push_back(v),
        adj[v].push_back(u);
    for (int i = 1; i <= m; i++)
        cin >> c[i];
    dfs();
    for (int i = 1; i <= 3*n; i++) lgs[i] = __lg(i);
    build();
    for (int i = 1; i <= n; i++) rev_in[in[i]] = i;
    for (int i = 1; i <= q; i++)
        cin >> qr[i].l >> qr[i].r, qr[i].id = i;
    sort(qr + 1, qr + q + 1);
    for (int i = 1, l = 1, r = 0; i <= q; i++)
    {
        auto [lx, rx, id] = qr[i];
        while (r < rx) add(++r);
        while (l > lx) add(--l);
        while (r > rx) del(r--);
        while (l < lx) del(l++);
        ans[id] = cur - h[lca(rev_in[*s.begin()], rev_in[*s.rbegin()])] + 1;
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 6724 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6576 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6580 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6580 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 10 ms 7004 KB Output is correct
31 Correct 12 ms 7004 KB Output is correct
32 Correct 17 ms 7200 KB Output is correct
33 Correct 16 ms 7004 KB Output is correct
34 Correct 16 ms 7204 KB Output is correct
35 Correct 2 ms 7000 KB Output is correct
36 Correct 3 ms 7192 KB Output is correct
37 Correct 3 ms 7000 KB Output is correct
38 Correct 17 ms 7284 KB Output is correct
39 Correct 17 ms 7260 KB Output is correct
40 Correct 17 ms 7260 KB Output is correct
41 Correct 3 ms 7260 KB Output is correct
42 Correct 3 ms 7260 KB Output is correct
43 Correct 3 ms 7260 KB Output is correct
44 Correct 18 ms 7004 KB Output is correct
45 Correct 16 ms 7000 KB Output is correct
46 Correct 16 ms 7240 KB Output is correct
47 Correct 3 ms 7004 KB Output is correct
48 Correct 2 ms 7208 KB Output is correct
49 Correct 2 ms 7004 KB Output is correct
50 Correct 15 ms 7212 KB Output is correct
51 Correct 15 ms 7004 KB Output is correct
52 Correct 15 ms 7004 KB Output is correct
53 Correct 14 ms 7004 KB Output is correct
54 Correct 15 ms 7004 KB Output is correct
55 Correct 15 ms 7208 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 1 ms 7084 KB Output is correct
58 Correct 2 ms 7004 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 3 ms 6744 KB Output is correct
4 Correct 3186 ms 32224 KB Output is correct
5 Correct 1934 ms 42968 KB Output is correct
6 Correct 3167 ms 47908 KB Output is correct
7 Correct 4873 ms 51876 KB Output is correct
8 Correct 4931 ms 53668 KB Output is correct
9 Correct 4993 ms 53676 KB Output is correct
10 Correct 4948 ms 53672 KB Output is correct
11 Execution timed out 5044 ms 53676 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 47 ms 26936 KB Output is correct
3 Correct 67 ms 28624 KB Output is correct
4 Correct 60 ms 32460 KB Output is correct
5 Correct 65 ms 44972 KB Output is correct
6 Correct 78 ms 44196 KB Output is correct
7 Correct 86 ms 43720 KB Output is correct
8 Correct 87 ms 43720 KB Output is correct
9 Correct 81 ms 43756 KB Output is correct
10 Correct 89 ms 43720 KB Output is correct
11 Correct 92 ms 43720 KB Output is correct
12 Correct 103 ms 43716 KB Output is correct
13 Correct 96 ms 43720 KB Output is correct
14 Correct 90 ms 43716 KB Output is correct
15 Correct 123 ms 43648 KB Output is correct
16 Correct 93 ms 43852 KB Output is correct
17 Correct 102 ms 43904 KB Output is correct
18 Correct 99 ms 43720 KB Output is correct
19 Correct 89 ms 44896 KB Output is correct
20 Correct 75 ms 44896 KB Output is correct
21 Correct 97 ms 43632 KB Output is correct
22 Correct 88 ms 43620 KB Output is correct
23 Correct 111 ms 43616 KB Output is correct
24 Correct 108 ms 43716 KB Output is correct
25 Correct 74 ms 43676 KB Output is correct
26 Correct 78 ms 43728 KB Output is correct
27 Correct 84 ms 43720 KB Output is correct
28 Correct 90 ms 43720 KB Output is correct
29 Correct 99 ms 43720 KB Output is correct
30 Correct 98 ms 43732 KB Output is correct
31 Correct 128 ms 43568 KB Output is correct
32 Correct 114 ms 40644 KB Output is correct
33 Correct 128 ms 39824 KB Output is correct
34 Correct 105 ms 40908 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 3993 ms 29224 KB Output is correct
5 Correct 3833 ms 30012 KB Output is correct
6 Correct 4948 ms 40372 KB Output is correct
7 Execution timed out 5050 ms 44888 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 3 ms 6492 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 2 ms 6724 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6576 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6580 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6580 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 10 ms 7004 KB Output is correct
31 Correct 12 ms 7004 KB Output is correct
32 Correct 17 ms 7200 KB Output is correct
33 Correct 16 ms 7004 KB Output is correct
34 Correct 16 ms 7204 KB Output is correct
35 Correct 2 ms 7000 KB Output is correct
36 Correct 3 ms 7192 KB Output is correct
37 Correct 3 ms 7000 KB Output is correct
38 Correct 17 ms 7284 KB Output is correct
39 Correct 17 ms 7260 KB Output is correct
40 Correct 17 ms 7260 KB Output is correct
41 Correct 3 ms 7260 KB Output is correct
42 Correct 3 ms 7260 KB Output is correct
43 Correct 3 ms 7260 KB Output is correct
44 Correct 18 ms 7004 KB Output is correct
45 Correct 16 ms 7000 KB Output is correct
46 Correct 16 ms 7240 KB Output is correct
47 Correct 3 ms 7004 KB Output is correct
48 Correct 2 ms 7208 KB Output is correct
49 Correct 2 ms 7004 KB Output is correct
50 Correct 15 ms 7212 KB Output is correct
51 Correct 15 ms 7004 KB Output is correct
52 Correct 15 ms 7004 KB Output is correct
53 Correct 14 ms 7004 KB Output is correct
54 Correct 15 ms 7004 KB Output is correct
55 Correct 15 ms 7208 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 1 ms 7084 KB Output is correct
58 Correct 2 ms 7004 KB Output is correct
59 Correct 1 ms 6492 KB Output is correct
60 Correct 1 ms 6492 KB Output is correct
61 Correct 3 ms 6744 KB Output is correct
62 Correct 3186 ms 32224 KB Output is correct
63 Correct 1934 ms 42968 KB Output is correct
64 Correct 3167 ms 47908 KB Output is correct
65 Correct 4873 ms 51876 KB Output is correct
66 Correct 4931 ms 53668 KB Output is correct
67 Correct 4993 ms 53676 KB Output is correct
68 Correct 4948 ms 53672 KB Output is correct
69 Execution timed out 5044 ms 53676 KB Time limit exceeded
70 Halted 0 ms 0 KB -