oj.uz

답안 #1001290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001290 2024-06-18T18:15:33 Z LonlyR Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 46500 KB 
#include<bits/stdc++.h>
#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;

inline int64_t gilbertOrder(int x, int y, int pow, int rotate) {
	if (pow == 0) {
		return 0;
	}
	int hpow = 1 << (pow-1);
	int seg = (x < hpow) ? (
		(y < hpow) ? 0 : 3
	) : (
		(y < hpow) ? 1 : 2
	);
	seg = (seg + rotate) & 3;
	const int rotateDelta[4] = {3, 0, 0, 1};
	int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
	int nrot = (rotate + rotateDelta[seg]) & 3;
	int64_t subSquareSize = int64_t(1) << (2*pow - 2);
	int64_t ans = seg * subSquareSize;
	int64_t add = gilbertOrder(nx, ny, pow-1, nrot);
	ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
	return ans;
}

struct Q {
	int l, r, id;
	int64_t ord;

	inline void calcOrder() {
		ord = gilbertOrder(l, r, 21, 0);
	}
} qr[maxn];

inline bool operator<(const Q &a, const Q &b) {
	return a.ord < b.ord;
}

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, tmp] = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 4 ms 6492 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 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 5 ms 6488 KB Output is correct
16 Correct 4 ms 6736 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 5 ms 6488 KB Output is correct
20 Correct 5 ms 6492 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6728 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 6 ms 6492 KB Output is correct
26 Correct 4 ms 6580 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 6 ms 6724 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 4 ms 6492 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 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 5 ms 6488 KB Output is correct
16 Correct 4 ms 6736 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 5 ms 6488 KB Output is correct
20 Correct 5 ms 6492 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6728 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 6 ms 6492 KB Output is correct
26 Correct 4 ms 6580 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 6 ms 6724 KB Output is correct
30 Correct 106 ms 7072 KB Output is correct
31 Correct 148 ms 7092 KB Output is correct
32 Correct 188 ms 7004 KB Output is correct
33 Correct 203 ms 7512 KB Output is correct
34 Correct 200 ms 7236 KB Output is correct
35 Correct 4 ms 7256 KB Output is correct
36 Correct 4 ms 7260 KB Output is correct
37 Correct 4 ms 7260 KB Output is correct
38 Correct 190 ms 7324 KB Output is correct
39 Correct 212 ms 7328 KB Output is correct
40 Correct 185 ms 7260 KB Output is correct
41 Correct 4 ms 7228 KB Output is correct
42 Correct 3 ms 7260 KB Output is correct
43 Correct 4 ms 7260 KB Output is correct
44 Correct 195 ms 7260 KB Output is correct
45 Correct 201 ms 7260 KB Output is correct
46 Correct 192 ms 7284 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 3 ms 7260 KB Output is correct
49 Correct 4 ms 7248 KB Output is correct
50 Correct 176 ms 7260 KB Output is correct
51 Correct 173 ms 7260 KB Output is correct
52 Correct 169 ms 7240 KB Output is correct
53 Correct 186 ms 7260 KB Output is correct
54 Correct 201 ms 7260 KB Output is correct
55 Correct 188 ms 7272 KB Output is correct
56 Correct 6 ms 6492 KB Output is correct
57 Correct 2 ms 7000 KB Output is correct
58 Correct 291 ms 7172 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Execution timed out 5082 ms 33192 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 306 ms 26068 KB Output is correct
3 Correct 450 ms 27940 KB Output is correct
4 Correct 373 ms 31660 KB Output is correct
5 Correct 76 ms 43812 KB Output is correct
6 Correct 88 ms 43084 KB Output is correct
7 Correct 92 ms 42696 KB Output is correct
8 Correct 188 ms 42916 KB Output is correct
9 Correct 306 ms 43168 KB Output is correct
10 Correct 403 ms 43172 KB Output is correct
11 Correct 468 ms 43436 KB Output is correct
12 Correct 544 ms 43180 KB Output is correct
13 Correct 639 ms 45820 KB Output is correct
14 Correct 685 ms 45648 KB Output is correct
15 Correct 738 ms 46500 KB Output is correct
16 Correct 394 ms 45996 KB Output is correct
17 Correct 399 ms 46108 KB Output is correct
18 Correct 399 ms 45908 KB Output is correct
19 Correct 64 ms 43872 KB Output is correct
20 Correct 73 ms 43844 KB Output is correct
21 Correct 90 ms 42568 KB Output is correct
22 Correct 86 ms 42620 KB Output is correct
23 Correct 176 ms 43036 KB Output is correct
24 Correct 239 ms 43372 KB Output is correct
25 Correct 292 ms 43180 KB Output is correct
26 Correct 363 ms 43356 KB Output is correct
27 Correct 397 ms 43336 KB Output is correct
28 Correct 459 ms 43344 KB Output is correct
29 Correct 503 ms 43176 KB Output is correct
30 Correct 571 ms 43432 KB Output is correct
31 Correct 645 ms 45744 KB Output is correct
32 Correct 685 ms 45736 KB Output is correct
33 Correct 753 ms 45992 KB Output is correct
34 Correct 779 ms 46412 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 6 ms 6700 KB Output is correct
4 Execution timed out 5089 ms 29732 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 4 ms 6492 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Correct 5 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 5 ms 6488 KB Output is correct
16 Correct 4 ms 6736 KB Output is correct
17 Correct 4 ms 6492 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 5 ms 6488 KB Output is correct
20 Correct 5 ms 6492 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 6728 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 6 ms 6492 KB Output is correct
26 Correct 4 ms 6580 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 6 ms 6724 KB Output is correct
30 Correct 106 ms 7072 KB Output is correct
31 Correct 148 ms 7092 KB Output is correct
32 Correct 188 ms 7004 KB Output is correct
33 Correct 203 ms 7512 KB Output is correct
34 Correct 200 ms 7236 KB Output is correct
35 Correct 4 ms 7256 KB Output is correct
36 Correct 4 ms 7260 KB Output is correct
37 Correct 4 ms 7260 KB Output is correct
38 Correct 190 ms 7324 KB Output is correct
39 Correct 212 ms 7328 KB Output is correct
40 Correct 185 ms 7260 KB Output is correct
41 Correct 4 ms 7228 KB Output is correct
42 Correct 3 ms 7260 KB Output is correct
43 Correct 4 ms 7260 KB Output is correct
44 Correct 195 ms 7260 KB Output is correct
45 Correct 201 ms 7260 KB Output is correct
46 Correct 192 ms 7284 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 3 ms 7260 KB Output is correct
49 Correct 4 ms 7248 KB Output is correct
50 Correct 176 ms 7260 KB Output is correct
51 Correct 173 ms 7260 KB Output is correct
52 Correct 169 ms 7240 KB Output is correct
53 Correct 186 ms 7260 KB Output is correct
54 Correct 201 ms 7260 KB Output is correct
55 Correct 188 ms 7272 KB Output is correct
56 Correct 6 ms 6492 KB Output is correct
57 Correct 2 ms 7000 KB Output is correct
58 Correct 291 ms 7172 KB Output is correct
59 Correct 1 ms 6492 KB Output is correct
60 Correct 1 ms 6492 KB Output is correct
61 Correct 5 ms 6492 KB Output is correct
62 Execution timed out 5082 ms 33192 KB Time limit exceeded
63 Halted 0 ms 0 KB -