oj.uz

답안 #878382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878382 2023-11-24T09:26:46 Z TAhmed33 Tourism (JOI23_tourism) C++
28 / 100
 5000 ms 105300 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
const int MAXN = 4e5 + 25;
#define mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
struct SegmentTree {
    int tree[2 * MAXN];
    void insert (int x) {
        tree[x]++;
    }
    void erase (int x) {
        tree[x]--;
    }
    int left (int x) {
        for (int i = x; i >= 1; i--) if (tree[i]) return i;
        return -1;
    }
    int right (int x) {
        for (int i = x + 1; i < 2 * MAXN; i++) if (tree[i]) return i;
        return -1;
    }
    bool empty (int x) {
        bool flag = 0; for (int i = 1; i < 2 * MAXN; i++) flag |= tree[i];
        return !flag;
    }
  /*  void add (int l, int r, int a, int node) {
        if (l == r) {
            tree[node] = 1; return;
        }
        if (a <= mid) add(l, mid, a, tl);
        else add(mid + 1, r, a, tr);
        tree[node] = tree[tl] | tree[tr];
    }
    void rem (int l, int r, int a, int node) {
        if (l == r) {
            tree[node] = 0; return;
        }
        if (a <= mid) rem(l, mid, a, tl);
        else rem(mid + 1, r, a, tr);
        tree[node] = tree[tl] | tree[tr];
    }
    int get1 (int l, int r, int a, int node) {
        if (!tree[node] || r < a) return -1;
        if (l == r) return l;
        int x = get1(l, mid, a, tl);
        if (x != -1 && x >= a) return x;
        return get1(mid + 1, r, a, tr);
    }
    int get2 (int l, int r, int a, int node) {
        if (!tree[node] || l > a) return -1;
        if (l == r) return l;
        int x = get2(mid + 1, r, a, tr);
        if (x != -1 && x <= a) return x;
        return get2(l, mid, a, tl);
    }
    void insert (int x) {
        add(1, MAXN, x, 1);
    }
    void erase (int x) {
        rem(1, MAXN, x, 1);
    }
    int left (int x) {
        if (x == 1) return -1;
        return get2(1, MAXN, x - 1, 1);
    }
    int right (int x) {
        if (x == MAXN) return -1;
        return get1(1, MAXN, x + 1, 1);
    }
    bool empty () {
        return tree[1] == 0;
    }*/
} dd;
int in[MAXN], depth[MAXN], revin[MAXN];
pair <int, int> sparse[__lg(MAXN)][MAXN];
vector <int> adj[MAXN];
int n, m, q;
int cnt = 0;
void dfs (int pos, int par, int dep = 1) {
	depth[pos] = dep;
	sparse[0][++cnt] = {dep, pos};
	in[pos] = cnt; revin[cnt] = pos;
	for (auto j : adj[pos]) {
		if (j != par) {
			dfs(j, pos, dep + 1);
			sparse[0][++cnt] = {dep, pos};
		}
	}
}
int sparse2[__lg(MAXN)][MAXN];
int query (int l, int r) {
	if (l > r) swap(l, r);
	int x = __lg(r - l + 1);
	return min(sparse[x][l], sparse[x][r - (1 << x) + 1]).second;
}
int query2 (int l, int r) {
	int x = __lg(r - l + 1);
	return query(in[sparse2[x][l]], in[sparse2[x][r - (1 << x) + 1]]);
}
int arr[MAXN];
array <int, 3> queries[MAXN];
int ret[MAXN];
int ans = 0;
void add (int x) {
    ans += depth[x];
    int l = dd.left(in[x]), r = dd.right(in[x]);
	if (r != -1) ans -= depth[query(in[x], r)];
    if (l != -1) ans -= depth[query(l, in[x])];
    if (l != -1 && r != -1) ans += depth[query(l, r)];
	dd.insert(in[x]);
}
void rem (int x) {
    dd.erase(in[x]);
    ans -= depth[x];
    int l = dd.left(in[x]), r = dd.right(in[x]);
    if (r != -1) ans += depth[query(in[x], r)];
    if (l != -1) ans += depth[query(l, in[x])];
    if (l != -1 && r != -1) ans -= depth[query(l, r)];
}
int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> q;
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs(1, -1);
	for (int i = 1; i <= __lg(cnt); i++) {
		for (int j = 1; j + (1 << i) - 1 <= cnt; j++) {
			sparse[i][j] = min(sparse[i - 1][j], sparse[i - 1][j + (1 << (i - 1))]);
		}
	}
	for (int i = 1; i <= m; i++) {
		cin >> arr[i];
		sparse2[0][i] = arr[i];
	}
	for (int i = 1; i <= __lg(m); i++) {
		for (int j = 1; j + (1 << i) - 1 <= m; j++) {
			sparse2[i][j] = query(in[sparse2[i - 1][j]], in[sparse2[i - 1][j + (1 << (i - 1))]]);
		}
	}
	/*for (int i = 1; i <= q; i++) {
		int l, r;
		cin >> l >> r;
		vector <int> g;
		for (int j = l; j <= r; j++) g.push_back(arr[j]);
		sort(g.begin(), g.end(), [&] (int a, int b) {
			return in[a] < in[b];
		});
		int ans = depth[g[0]], lca = g[0];
		for (int j = 1; j < (int)g.size(); j++) {
			ans += depth[g[j]] - depth[query(in[g[j]], in[g[j - 1]])];
			lca = query(in[lca], in[g[j]]);
		}
		ans -= depth[lca]; ans++;
		cout << ans << '\n';
	}*/
	for (int i = 1; i <= q; i++) {
		cin >> queries[i][0] >> queries[i][1]; queries[i][2] = i;
	}
	int x = sqrt(m); while (x * x < m) x++; while (x * x > m) x--;
	sort(queries + 1, queries + q + 1, [&] (array <int, 3> &a, array <int, 3> &b) {
		return a[0] / x == b[0] / x ? a[1] < b[1] : a[0] / x < b[0] / x;
	});
	int l = queries[1][0], r = queries[1][1];
	for (int i = 1; i <= q; i++) {
		int tll = queries[i][0], trr = queries[i][1];
	//	while (l < tll) rem(arr[l++]);
	//	while (l > tll) add(arr[--l]);
	////	while (r < trr) add(arr[++r]);
	//	while (r > trr) rem(arr[r--]);
       // memset(dd.tree, 0, sizeof(dd.tree)); ans = 0;
        //for (int j = tll; j <= trr; j++) add(arr[j]); 
        vector <int> g;
        for (int j = tll; j <= trr; j++) g.push_back(arr[j]);
        sort(g.begin(), g.end(), [&] (int a, int b) {
            return in[a] < in[b];
        });
        ans = depth[g[0]];
        for (int j = 1; j < (int)g.size(); j++) {
            ans += depth[g[j]] - depth[query(in[g[j]], in[g[j - 1]])];
        }
        ret[queries[i][2]] = ans - depth[query2(tll, trr)] + 1;
	}
	for (int i = 1; i <= q; i++) cout << ret[i] << '\n';
}

Compilation message

tourism.cpp: In function 'int main()':
tourism.cpp:170:6: warning: unused variable 'l' [-Wunused-variable]
  170 |  int l = queries[1][0], r = queries[1][1];
      |      ^
tourism.cpp:170:25: warning: unused variable 'r' [-Wunused-variable]
  170 |  int l = queries[1][0], r = queries[1][1];
      |                         ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35160 KB Output is correct
2 Correct 5 ms 37212 KB Output is correct
3 Correct 5 ms 37212 KB Output is correct
4 Correct 8 ms 53848 KB Output is correct
5 Correct 7 ms 53640 KB Output is correct
6 Correct 7 ms 53596 KB Output is correct
7 Correct 7 ms 53592 KB Output is correct
8 Correct 8 ms 55884 KB Output is correct
9 Correct 9 ms 55644 KB Output is correct
10 Correct 9 ms 55788 KB Output is correct
11 Correct 9 ms 55644 KB Output is correct
12 Correct 12 ms 55896 KB Output is correct
13 Correct 12 ms 55644 KB Output is correct
14 Correct 12 ms 55640 KB Output is correct
15 Correct 9 ms 55640 KB Output is correct
16 Correct 8 ms 55644 KB Output is correct
17 Correct 9 ms 55644 KB Output is correct
18 Correct 9 ms 55824 KB Output is correct
19 Correct 9 ms 55644 KB Output is correct
20 Correct 9 ms 55892 KB Output is correct
21 Correct 8 ms 55640 KB Output is correct
22 Correct 9 ms 55644 KB Output is correct
23 Correct 9 ms 55900 KB Output is correct
24 Correct 9 ms 55644 KB Output is correct
25 Correct 9 ms 55644 KB Output is correct
26 Correct 9 ms 55900 KB Output is correct
27 Correct 6 ms 37212 KB Output is correct
28 Correct 6 ms 43356 KB Output is correct
29 Correct 7 ms 55896 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35160 KB Output is correct
2 Correct 5 ms 37212 KB Output is correct
3 Correct 5 ms 37212 KB Output is correct
4 Correct 8 ms 53848 KB Output is correct
5 Correct 7 ms 53640 KB Output is correct
6 Correct 7 ms 53596 KB Output is correct
7 Correct 7 ms 53592 KB Output is correct
8 Correct 8 ms 55884 KB Output is correct
9 Correct 9 ms 55644 KB Output is correct
10 Correct 9 ms 55788 KB Output is correct
11 Correct 9 ms 55644 KB Output is correct
12 Correct 12 ms 55896 KB Output is correct
13 Correct 12 ms 55644 KB Output is correct
14 Correct 12 ms 55640 KB Output is correct
15 Correct 9 ms 55640 KB Output is correct
16 Correct 8 ms 55644 KB Output is correct
17 Correct 9 ms 55644 KB Output is correct
18 Correct 9 ms 55824 KB Output is correct
19 Correct 9 ms 55644 KB Output is correct
20 Correct 9 ms 55892 KB Output is correct
21 Correct 8 ms 55640 KB Output is correct
22 Correct 9 ms 55644 KB Output is correct
23 Correct 9 ms 55900 KB Output is correct
24 Correct 9 ms 55644 KB Output is correct
25 Correct 9 ms 55644 KB Output is correct
26 Correct 9 ms 55900 KB Output is correct
27 Correct 6 ms 37212 KB Output is correct
28 Correct 6 ms 43356 KB Output is correct
29 Correct 7 ms 55896 KB Output is correct
30 Correct 51 ms 64156 KB Output is correct
31 Correct 75 ms 64160 KB Output is correct
32 Correct 98 ms 64188 KB Output is correct
33 Correct 98 ms 64092 KB Output is correct
34 Correct 97 ms 64184 KB Output is correct
35 Correct 291 ms 64188 KB Output is correct
36 Correct 286 ms 64200 KB Output is correct
37 Correct 287 ms 64088 KB Output is correct
38 Correct 101 ms 64092 KB Output is correct
39 Correct 98 ms 64228 KB Output is correct
40 Correct 98 ms 64248 KB Output is correct
41 Correct 292 ms 64240 KB Output is correct
42 Correct 286 ms 64092 KB Output is correct
43 Correct 291 ms 64092 KB Output is correct
44 Correct 96 ms 64340 KB Output is correct
45 Correct 98 ms 64192 KB Output is correct
46 Correct 99 ms 64204 KB Output is correct
47 Correct 288 ms 64204 KB Output is correct
48 Correct 288 ms 64088 KB Output is correct
49 Correct 294 ms 64092 KB Output is correct
50 Correct 93 ms 64092 KB Output is correct
51 Correct 99 ms 64200 KB Output is correct
52 Correct 96 ms 64192 KB Output is correct
53 Correct 100 ms 64088 KB Output is correct
54 Correct 94 ms 64092 KB Output is correct
55 Correct 93 ms 64200 KB Output is correct
56 Correct 34 ms 41304 KB Output is correct
57 Correct 7 ms 47708 KB Output is correct
58 Correct 10 ms 64092 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 37212 KB Output is correct
2 Correct 6 ms 37352 KB Output is correct
3 Correct 32 ms 41308 KB Output is correct
4 Execution timed out 5052 ms 100824 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35164 KB Output is correct
2 Correct 40 ms 98632 KB Output is correct
3 Correct 50 ms 99960 KB Output is correct
4 Correct 50 ms 100608 KB Output is correct
5 Correct 75 ms 103248 KB Output is correct
6 Correct 71 ms 102944 KB Output is correct
7 Correct 71 ms 102736 KB Output is correct
8 Correct 69 ms 102484 KB Output is correct
9 Correct 79 ms 102608 KB Output is correct
10 Correct 67 ms 102624 KB Output is correct
11 Correct 67 ms 102608 KB Output is correct
12 Correct 69 ms 102504 KB Output is correct
13 Correct 69 ms 102812 KB Output is correct
14 Correct 86 ms 102128 KB Output is correct
15 Correct 104 ms 105300 KB Output is correct
16 Correct 76 ms 103120 KB Output is correct
17 Correct 72 ms 103144 KB Output is correct
18 Correct 73 ms 103248 KB Output is correct
19 Correct 65 ms 103120 KB Output is correct
20 Correct 84 ms 102924 KB Output is correct
21 Correct 66 ms 102752 KB Output is correct
22 Correct 63 ms 102500 KB Output is correct
23 Correct 64 ms 102484 KB Output is correct
24 Correct 64 ms 102480 KB Output is correct
25 Correct 64 ms 100988 KB Output is correct
26 Correct 62 ms 99412 KB Output is correct
27 Correct 63 ms 102556 KB Output is correct
28 Correct 63 ms 102696 KB Output is correct
29 Correct 68 ms 102564 KB Output is correct
30 Correct 62 ms 102476 KB Output is correct
31 Correct 65 ms 102736 KB Output is correct
32 Correct 68 ms 103060 KB Output is correct
33 Correct 92 ms 96456 KB Output is correct
34 Correct 101 ms 102444 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35164 KB Output is correct
2 Correct 6 ms 37212 KB Output is correct
3 Correct 36 ms 41532 KB Output is correct
4 Execution timed out 5048 ms 101708 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35160 KB Output is correct
2 Correct 5 ms 37212 KB Output is correct
3 Correct 5 ms 37212 KB Output is correct
4 Correct 8 ms 53848 KB Output is correct
5 Correct 7 ms 53640 KB Output is correct
6 Correct 7 ms 53596 KB Output is correct
7 Correct 7 ms 53592 KB Output is correct
8 Correct 8 ms 55884 KB Output is correct
9 Correct 9 ms 55644 KB Output is correct
10 Correct 9 ms 55788 KB Output is correct
11 Correct 9 ms 55644 KB Output is correct
12 Correct 12 ms 55896 KB Output is correct
13 Correct 12 ms 55644 KB Output is correct
14 Correct 12 ms 55640 KB Output is correct
15 Correct 9 ms 55640 KB Output is correct
16 Correct 8 ms 55644 KB Output is correct
17 Correct 9 ms 55644 KB Output is correct
18 Correct 9 ms 55824 KB Output is correct
19 Correct 9 ms 55644 KB Output is correct
20 Correct 9 ms 55892 KB Output is correct
21 Correct 8 ms 55640 KB Output is correct
22 Correct 9 ms 55644 KB Output is correct
23 Correct 9 ms 55900 KB Output is correct
24 Correct 9 ms 55644 KB Output is correct
25 Correct 9 ms 55644 KB Output is correct
26 Correct 9 ms 55900 KB Output is correct
27 Correct 6 ms 37212 KB Output is correct
28 Correct 6 ms 43356 KB Output is correct
29 Correct 7 ms 55896 KB Output is correct
30 Correct 51 ms 64156 KB Output is correct
31 Correct 75 ms 64160 KB Output is correct
32 Correct 98 ms 64188 KB Output is correct
33 Correct 98 ms 64092 KB Output is correct
34 Correct 97 ms 64184 KB Output is correct
35 Correct 291 ms 64188 KB Output is correct
36 Correct 286 ms 64200 KB Output is correct
37 Correct 287 ms 64088 KB Output is correct
38 Correct 101 ms 64092 KB Output is correct
39 Correct 98 ms 64228 KB Output is correct
40 Correct 98 ms 64248 KB Output is correct
41 Correct 292 ms 64240 KB Output is correct
42 Correct 286 ms 64092 KB Output is correct
43 Correct 291 ms 64092 KB Output is correct
44 Correct 96 ms 64340 KB Output is correct
45 Correct 98 ms 64192 KB Output is correct
46 Correct 99 ms 64204 KB Output is correct
47 Correct 288 ms 64204 KB Output is correct
48 Correct 288 ms 64088 KB Output is correct
49 Correct 294 ms 64092 KB Output is correct
50 Correct 93 ms 64092 KB Output is correct
51 Correct 99 ms 64200 KB Output is correct
52 Correct 96 ms 64192 KB Output is correct
53 Correct 100 ms 64088 KB Output is correct
54 Correct 94 ms 64092 KB Output is correct
55 Correct 93 ms 64200 KB Output is correct
56 Correct 34 ms 41304 KB Output is correct
57 Correct 7 ms 47708 KB Output is correct
58 Correct 10 ms 64092 KB Output is correct
59 Correct 5 ms 37212 KB Output is correct
60 Correct 6 ms 37352 KB Output is correct
61 Correct 32 ms 41308 KB Output is correct
62 Execution timed out 5052 ms 100824 KB Time limit exceeded
63 Halted 0 ms 0 KB -