Submission #1001280

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1001280	2024-06-18T18:02:52 Z	LonlyR	Tourism (JOI23_tourism)	C++17	0 / 100	5000 ms	48300 KB

tourism

#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ii pair<int,int>
#define ff first
#define ss second

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};

struct cmp
{
    bool operator() (int x, int y) const
    {
        return in[x] < in[y];
    }
};

set<int, cmp> 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.emplace_back(x);
    for (int i : adj[x]) if (i != p)
        dfs(i, x),
        euler.emplace_back(x);
    out[x] = cnt;
}

vector<vector<ii>> st;
vector<int> lg = {0};

void build()
{
    int sz = euler.size();
    int LG = __lg(sz);
    lg = vector<int>(sz, 0);
    for (int i = 1; i < sz; i++) lg[i] = lg[i - 1] / 2;
    st = vector<vector<ii>>(LG, 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))]);
}

int lca(int l, int r)
{
    l = id[l];
    r = id[r];
    if (l > r) swap(l, r);
    int k = lg[r - l + 1];
    return min(st[k][l], st[k][r - (1 << k) + 1]).ss;
}

void add(int x)
{
    x = c[x];
    in_set[x]++;
    if (in_set[x] == 1)
    {
        cur += h[x];
        if (s.size() == 0) return s.emplace(x), void();
        auto it = s.lower_bound(x);
        if (it == s.begin())
            cur -= h[lca(x, *it)];
        else if (it == s.end())
            cur -= h[lca(x, *prev(it))];
        else
        {
            auto u = *it, v = *prev(it);
            cur += h[lca(u, v)];
            cur -= h[lca(u, x)];
            cur -= h[lca(v, x)];
        }
    }
    s.emplace(x);
}

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(x);
        if (it == s.begin())
            cur += h[lca(x, *next(it))];
        else if (next(it) == s.end())
            cur += h[lca(x, *prev(it))];
        else
        {
            auto u = *prev(it), v = *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(0); 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].emplace_back(v),
        adj[v].emplace_back(u);
    for (int i = 1; i <= m; i++)
        cin >> c[i];
    dfs();
    build();
    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(*s.begin(), *s.rbegin())] + 1;
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	6492 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	6492 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.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	3 ms	6492 KB	Output is correct
4	Correct	4153 ms	29756 KB	Output is correct
5	Correct	2291 ms	40416 KB	Output is correct
6	Correct	3653 ms	45096 KB	Output is correct
7	Execution timed out	5060 ms	48300 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-