oj.uz

답안 #878384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878384 2023-11-24T09:35:02 Z TAhmed33 Tourism (JOI23_tourism) C++
5 / 100
 5000 ms 100928 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][1] + 1, 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--]);
        ret[queries[i][2]] = ans - depth[query2(tll, trr)] + 1;
	}
	for (int i = 1; i <= q; i++) cout << ret[i] << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 35164 KB Output is correct
2 Correct 9 ms 37212 KB Output is correct
3 Correct 8 ms 37212 KB Output is correct
4 Correct 48 ms 53808 KB Output is correct
5 Correct 40 ms 53808 KB Output is correct
6 Correct 49 ms 53596 KB Output is correct
7 Correct 49 ms 53808 KB Output is correct
8 Correct 33 ms 55644 KB Output is correct
9 Correct 57 ms 55644 KB Output is correct
10 Correct 56 ms 55896 KB Output is correct
11 Correct 62 ms 55644 KB Output is correct
12 Correct 8 ms 55896 KB Output is correct
13 Correct 9 ms 55644 KB Output is correct
14 Correct 9 ms 55840 KB Output is correct
15 Correct 55 ms 55748 KB Output is correct
16 Correct 71 ms 55896 KB Output is correct
17 Correct 54 ms 55640 KB Output is correct
18 Correct 56 ms 55860 KB Output is correct
19 Correct 48 ms 55860 KB Output is correct
20 Correct 48 ms 55644 KB Output is correct
21 Correct 52 ms 55644 KB Output is correct
22 Correct 50 ms 55644 KB Output is correct
23 Correct 51 ms 55640 KB Output is correct
24 Correct 72 ms 55644 KB Output is correct
25 Correct 53 ms 55868 KB Output is correct
26 Correct 48 ms 55640 KB Output is correct
27 Correct 1706 ms 37384 KB Output is correct
28 Correct 6 ms 43352 KB Output is correct
29 Correct 159 ms 55868 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 35164 KB Output is correct
2 Correct 9 ms 37212 KB Output is correct
3 Correct 8 ms 37212 KB Output is correct
4 Correct 48 ms 53808 KB Output is correct
5 Correct 40 ms 53808 KB Output is correct
6 Correct 49 ms 53596 KB Output is correct
7 Correct 49 ms 53808 KB Output is correct
8 Correct 33 ms 55644 KB Output is correct
9 Correct 57 ms 55644 KB Output is correct
10 Correct 56 ms 55896 KB Output is correct
11 Correct 62 ms 55644 KB Output is correct
12 Correct 8 ms 55896 KB Output is correct
13 Correct 9 ms 55644 KB Output is correct
14 Correct 9 ms 55840 KB Output is correct
15 Correct 55 ms 55748 KB Output is correct
16 Correct 71 ms 55896 KB Output is correct
17 Correct 54 ms 55640 KB Output is correct
18 Correct 56 ms 55860 KB Output is correct
19 Correct 48 ms 55860 KB Output is correct
20 Correct 48 ms 55644 KB Output is correct
21 Correct 52 ms 55644 KB Output is correct
22 Correct 50 ms 55644 KB Output is correct
23 Correct 51 ms 55640 KB Output is correct
24 Correct 72 ms 55644 KB Output is correct
25 Correct 53 ms 55868 KB Output is correct
26 Correct 48 ms 55640 KB Output is correct
27 Correct 1706 ms 37384 KB Output is correct
28 Correct 6 ms 43352 KB Output is correct
29 Correct 159 ms 55868 KB Output is correct
30 Correct 155 ms 64072 KB Output is correct
31 Correct 172 ms 64092 KB Output is correct
32 Correct 160 ms 64092 KB Output is correct
33 Correct 195 ms 64180 KB Output is correct
34 Correct 223 ms 64184 KB Output is correct
35 Correct 11 ms 64092 KB Output is correct
36 Correct 13 ms 64092 KB Output is correct
37 Correct 12 ms 64092 KB Output is correct
38 Correct 192 ms 64176 KB Output is correct
39 Correct 243 ms 64276 KB Output is correct
40 Correct 196 ms 64224 KB Output is correct
41 Correct 11 ms 64092 KB Output is correct
42 Correct 11 ms 64196 KB Output is correct
43 Correct 12 ms 64092 KB Output is correct
44 Correct 216 ms 64092 KB Output is correct
45 Correct 172 ms 64184 KB Output is correct
46 Correct 167 ms 64196 KB Output is correct
47 Correct 13 ms 64092 KB Output is correct
48 Correct 12 ms 64092 KB Output is correct
49 Correct 13 ms 64092 KB Output is correct
50 Correct 204 ms 64184 KB Output is correct
51 Correct 170 ms 64180 KB Output is correct
52 Correct 205 ms 64184 KB Output is correct
53 Correct 189 ms 64092 KB Output is correct
54 Correct 182 ms 64092 KB Output is correct
55 Correct 206 ms 64340 KB Output is correct
56 Execution timed out 5088 ms 41304 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 37208 KB Output is correct
2 Correct 1701 ms 37380 KB Output is correct
3 Execution timed out 5039 ms 41308 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 35160 KB Output is correct
2 Correct 4760 ms 98868 KB Output is correct
3 Execution timed out 5053 ms 100928 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35160 KB Output is correct
2 Correct 1716 ms 37388 KB Output is correct
3 Execution timed out 5036 ms 41560 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 35164 KB Output is correct
2 Correct 9 ms 37212 KB Output is correct
3 Correct 8 ms 37212 KB Output is correct
4 Correct 48 ms 53808 KB Output is correct
5 Correct 40 ms 53808 KB Output is correct
6 Correct 49 ms 53596 KB Output is correct
7 Correct 49 ms 53808 KB Output is correct
8 Correct 33 ms 55644 KB Output is correct
9 Correct 57 ms 55644 KB Output is correct
10 Correct 56 ms 55896 KB Output is correct
11 Correct 62 ms 55644 KB Output is correct
12 Correct 8 ms 55896 KB Output is correct
13 Correct 9 ms 55644 KB Output is correct
14 Correct 9 ms 55840 KB Output is correct
15 Correct 55 ms 55748 KB Output is correct
16 Correct 71 ms 55896 KB Output is correct
17 Correct 54 ms 55640 KB Output is correct
18 Correct 56 ms 55860 KB Output is correct
19 Correct 48 ms 55860 KB Output is correct
20 Correct 48 ms 55644 KB Output is correct
21 Correct 52 ms 55644 KB Output is correct
22 Correct 50 ms 55644 KB Output is correct
23 Correct 51 ms 55640 KB Output is correct
24 Correct 72 ms 55644 KB Output is correct
25 Correct 53 ms 55868 KB Output is correct
26 Correct 48 ms 55640 KB Output is correct
27 Correct 1706 ms 37384 KB Output is correct
28 Correct 6 ms 43352 KB Output is correct
29 Correct 159 ms 55868 KB Output is correct
30 Correct 155 ms 64072 KB Output is correct
31 Correct 172 ms 64092 KB Output is correct
32 Correct 160 ms 64092 KB Output is correct
33 Correct 195 ms 64180 KB Output is correct
34 Correct 223 ms 64184 KB Output is correct
35 Correct 11 ms 64092 KB Output is correct
36 Correct 13 ms 64092 KB Output is correct
37 Correct 12 ms 64092 KB Output is correct
38 Correct 192 ms 64176 KB Output is correct
39 Correct 243 ms 64276 KB Output is correct
40 Correct 196 ms 64224 KB Output is correct
41 Correct 11 ms 64092 KB Output is correct
42 Correct 11 ms 64196 KB Output is correct
43 Correct 12 ms 64092 KB Output is correct
44 Correct 216 ms 64092 KB Output is correct
45 Correct 172 ms 64184 KB Output is correct
46 Correct 167 ms 64196 KB Output is correct
47 Correct 13 ms 64092 KB Output is correct
48 Correct 12 ms 64092 KB Output is correct
49 Correct 13 ms 64092 KB Output is correct
50 Correct 204 ms 64184 KB Output is correct
51 Correct 170 ms 64180 KB Output is correct
52 Correct 205 ms 64184 KB Output is correct
53 Correct 189 ms 64092 KB Output is correct
54 Correct 182 ms 64092 KB Output is correct
55 Correct 206 ms 64340 KB Output is correct
56 Execution timed out 5088 ms 41304 KB Time limit exceeded
57 Halted 0 ms 0 KB -