oj.uz

Submission #208542

# Submission time Handle Problem Language Result Execution time Memory
208542 2020-03-11T13:27:26 Z eriksuenderhauf Cat in a tree (BOI17_catinatree) C++11
100 / 100
 254 ms 25188 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 2e5 + 5;
const double eps = 1e-9;
int seg[MAXN*4], st[MAXN], en[MAXN];
int t = 0, depth[MAXN], par[MAXN];
vi adj[MAXN];
vii arr;

void dfs(int u, int p) {
	st[u] = t++;
	for (int v: adj[u])
		if (v != p)
			dfs(v, u);
	en[u] = t;
}

void upd(int l, int r, int k, int a, int b, int v) {
	if (a <= l && r <= b) {
		seg[k] = min(seg[k], v);
		return;
	}
	int m = (l + r) / 2;
	if (a <= m) upd(l, m, k*2, a, b, v);
	if (m < b) upd(m + 1, r, k*2+1, a, b, v);
}

int qry(int l, int r, int k, int a) {
	if (a <= l && r <= a) return seg[k];
	int m = (l + r) / 2;
	if (a <= m) return min(seg[k],qry(l,m,k*2,a));
	return min(seg[k],qry(m+1,r,k*2+1,a));
}

int main() {
    memset(seg, 0x3f, sizeof seg);
    int n, d;
    scanf("%d %d", &n, &d);
    arr.pb({0, 0});
    depth[0] = 0;
    for (int i = 1; i < n; i++) {
    	scanf("%d", &par[i]);
    	adj[i].pb(par[i]);
    	adj[par[i]].pb(i);
    	depth[i] = depth[par[i]] + 1;
    	arr.pb({depth[i], i});
    }
    dfs(0, -1);
    sort(arr.rbegin(), arr.rend());
    int ans = 0;
    for (int i = 0; i < n; i++) {
    	int u = arr[i].se;
    	if (depth[u] + qry(0, n - 1, 1, st[u]) < d) continue;
    	int cnt = 0;
    	for (int v = u; cnt <= d; v = par[v]) {
    		upd(0, n - 1, 1, st[v], en[v] - 1, depth[u] - 2 * depth[v]);
    		cnt++;
    		if (v == 0) break;
    	}
    	ans++;
    }
    printf("%d\n", ans);
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &d);
     ~~~~~^~~~~~~~~~~~~~~~~
catinatree.cpp:72:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d", &par[i]);
      ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8188 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8188 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 10 ms 8188 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 10 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 9 ms 8184 KB Output is correct
18 Correct 9 ms 8184 KB Output is correct
19 Correct 9 ms 8188 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8188 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8188 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 10 ms 8188 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 10 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 9 ms 8184 KB Output is correct
18 Correct 9 ms 8184 KB Output is correct
19 Correct 9 ms 8188 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 10 ms 8312 KB Output is correct
22 Correct 10 ms 8188 KB Output is correct
23 Correct 9 ms 8184 KB Output is correct
24 Correct 11 ms 8312 KB Output is correct
25 Correct 10 ms 8184 KB Output is correct
26 Correct 10 ms 8184 KB Output is correct
27 Correct 10 ms 8056 KB Output is correct
28 Correct 10 ms 8312 KB Output is correct
29 Correct 10 ms 8184 KB Output is correct
30 Correct 11 ms 8312 KB Output is correct
31 Correct 10 ms 8312 KB Output is correct
32 Correct 11 ms 8184 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 10 ms 8184 KB Output is correct
35 Correct 10 ms 8312 KB Output is correct
36 Correct 10 ms 8312 KB Output is correct
37 Correct 10 ms 8316 KB Output is correct
38 Correct 10 ms 8312 KB Output is correct
39 Correct 10 ms 8312 KB Output is correct
40 Correct 10 ms 8312 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8188 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8188 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 10 ms 8188 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 10 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 9 ms 8184 KB Output is correct
18 Correct 9 ms 8184 KB Output is correct
19 Correct 9 ms 8188 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 10 ms 8312 KB Output is correct
22 Correct 10 ms 8188 KB Output is correct
23 Correct 9 ms 8184 KB Output is correct
24 Correct 11 ms 8312 KB Output is correct
25 Correct 10 ms 8184 KB Output is correct
26 Correct 10 ms 8184 KB Output is correct
27 Correct 10 ms 8056 KB Output is correct
28 Correct 10 ms 8312 KB Output is correct
29 Correct 10 ms 8184 KB Output is correct
30 Correct 11 ms 8312 KB Output is correct
31 Correct 10 ms 8312 KB Output is correct
32 Correct 11 ms 8184 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 10 ms 8184 KB Output is correct
35 Correct 10 ms 8312 KB Output is correct
36 Correct 10 ms 8312 KB Output is correct
37 Correct 10 ms 8316 KB Output is correct
38 Correct 10 ms 8312 KB Output is correct
39 Correct 10 ms 8312 KB Output is correct
40 Correct 10 ms 8312 KB Output is correct
41 Correct 150 ms 19812 KB Output is correct
42 Correct 114 ms 14312 KB Output is correct
43 Correct 89 ms 14316 KB Output is correct
44 Correct 80 ms 14316 KB Output is correct
45 Correct 83 ms 14440 KB Output is correct
46 Correct 254 ms 20452 KB Output is correct
47 Correct 181 ms 20452 KB Output is correct
48 Correct 186 ms 20584 KB Output is correct
49 Correct 181 ms 20456 KB Output is correct
50 Correct 64 ms 14568 KB Output is correct
51 Correct 67 ms 14696 KB Output is correct
52 Correct 64 ms 14572 KB Output is correct
53 Correct 128 ms 20964 KB Output is correct
54 Correct 122 ms 20964 KB Output is correct
55 Correct 130 ms 20964 KB Output is correct
56 Correct 11 ms 8440 KB Output is correct
57 Correct 22 ms 10356 KB Output is correct
58 Correct 76 ms 18408 KB Output is correct
59 Correct 177 ms 25188 KB Output is correct
60 Correct 145 ms 20072 KB Output is correct
61 Correct 167 ms 19812 KB Output is correct