oj.uz

답안 #1001294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001294 2024-06-18T18:17:44 Z LonlyR Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 52908 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, qr[i].calcOrder();
    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 1 ms 6492 KB Output is correct
5 Correct 1 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 2 ms 6488 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

# 결과 실행 시간 메모리 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 1 ms 6492 KB Output is correct
5 Correct 1 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 2 ms 6488 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 7 ms 7000 KB Output is correct
31 Correct 7 ms 7004 KB Output is correct
32 Correct 15 ms 7204 KB Output is correct
33 Correct 10 ms 7004 KB Output is correct
34 Correct 10 ms 7004 KB Output is correct
35 Correct 2 ms 7004 KB Output is correct
36 Correct 3 ms 7176 KB Output is correct
37 Correct 2 ms 7004 KB Output is correct
38 Correct 9 ms 7288 KB Output is correct
39 Correct 9 ms 7260 KB Output is correct
40 Correct 8 ms 7260 KB Output is correct
41 Correct 2 ms 7260 KB Output is correct
42 Correct 2 ms 7260 KB Output is correct
43 Correct 2 ms 7260 KB Output is correct
44 Correct 8 ms 7272 KB Output is correct
45 Correct 9 ms 7004 KB Output is correct
46 Correct 10 ms 7260 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 3 ms 7004 KB Output is correct
49 Correct 2 ms 7256 KB Output is correct
50 Correct 8 ms 7004 KB Output is correct
51 Correct 8 ms 7216 KB Output is correct
52 Correct 8 ms 7000 KB Output is correct
53 Correct 9 ms 7004 KB Output is correct
54 Correct 7 ms 7004 KB Output is correct
55 Correct 7 ms 7004 KB Output is correct
56 Correct 1 ms 6680 KB Output is correct
57 Correct 2 ms 7004 KB Output is correct
58 Correct 2 ms 7004 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 3491 ms 32312 KB Output is correct
5 Correct 2263 ms 44508 KB Output is correct
6 Correct 3174 ms 49224 KB Output is correct
7 Execution timed out 5071 ms 52908 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 87 ms 24832 KB Output is correct
3 Correct 140 ms 26436 KB Output is correct
4 Correct 111 ms 30408 KB Output is correct
5 Correct 72 ms 42968 KB Output is correct
6 Correct 102 ms 42916 KB Output is correct
7 Correct 141 ms 41668 KB Output is correct
8 Correct 135 ms 41668 KB Output is correct
9 Correct 152 ms 41672 KB Output is correct
10 Correct 180 ms 41672 KB Output is correct
11 Correct 172 ms 41556 KB Output is correct
12 Correct 181 ms 41672 KB Output is correct
13 Correct 175 ms 43384 KB Output is correct
14 Correct 186 ms 43436 KB Output is correct
15 Correct 78 ms 42412 KB Output is correct
16 Correct 154 ms 43888 KB Output is correct
17 Correct 143 ms 43932 KB Output is correct
18 Correct 148 ms 43736 KB Output is correct
19 Correct 67 ms 42788 KB Output is correct
20 Correct 72 ms 42920 KB Output is correct
21 Correct 90 ms 41900 KB Output is correct
22 Correct 116 ms 41672 KB Output is correct
23 Correct 125 ms 41712 KB Output is correct
24 Correct 129 ms 41596 KB Output is correct
25 Correct 136 ms 41476 KB Output is correct
26 Correct 146 ms 41640 KB Output is correct
27 Correct 153 ms 41672 KB Output is correct
28 Correct 155 ms 41668 KB Output is correct
29 Correct 173 ms 41672 KB Output is correct
30 Correct 172 ms 41668 KB Output is correct
31 Correct 165 ms 43436 KB Output is correct
32 Correct 175 ms 43436 KB Output is correct
33 Correct 156 ms 43688 KB Output is correct
34 Correct 79 ms 42420 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 2 ms 6492 KB Output is correct
4 Correct 3981 ms 29184 KB Output is correct
5 Correct 3982 ms 31092 KB Output is correct
6 Execution timed out 5035 ms 41292 KB Time limit exceeded
7 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 1 ms 6492 KB Output is correct
5 Correct 1 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 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 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 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 2 ms 6488 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 7 ms 7000 KB Output is correct
31 Correct 7 ms 7004 KB Output is correct
32 Correct 15 ms 7204 KB Output is correct
33 Correct 10 ms 7004 KB Output is correct
34 Correct 10 ms 7004 KB Output is correct
35 Correct 2 ms 7004 KB Output is correct
36 Correct 3 ms 7176 KB Output is correct
37 Correct 2 ms 7004 KB Output is correct
38 Correct 9 ms 7288 KB Output is correct
39 Correct 9 ms 7260 KB Output is correct
40 Correct 8 ms 7260 KB Output is correct
41 Correct 2 ms 7260 KB Output is correct
42 Correct 2 ms 7260 KB Output is correct
43 Correct 2 ms 7260 KB Output is correct
44 Correct 8 ms 7272 KB Output is correct
45 Correct 9 ms 7004 KB Output is correct
46 Correct 10 ms 7260 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 3 ms 7004 KB Output is correct
49 Correct 2 ms 7256 KB Output is correct
50 Correct 8 ms 7004 KB Output is correct
51 Correct 8 ms 7216 KB Output is correct
52 Correct 8 ms 7000 KB Output is correct
53 Correct 9 ms 7004 KB Output is correct
54 Correct 7 ms 7004 KB Output is correct
55 Correct 7 ms 7004 KB Output is correct
56 Correct 1 ms 6680 KB Output is correct
57 Correct 2 ms 7004 KB Output is correct
58 Correct 2 ms 7004 KB Output is correct
59 Correct 1 ms 6488 KB Output is correct
60 Correct 1 ms 6488 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 3491 ms 32312 KB Output is correct
63 Correct 2263 ms 44508 KB Output is correct
64 Correct 3174 ms 49224 KB Output is correct
65 Execution timed out 5071 ms 52908 KB Time limit exceeded
66 Halted 0 ms 0 KB -