oj.uz

Submission #197344

# Submission time Handle Problem Language Result Execution time Memory
197344 2020-01-20T13:07:36 Z dndhk Cat in a tree (BOI17_catinatree) C++14
100 / 100
 337 ms 32996 KB 
#include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 1
#define TEST if(test)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e18;
const int MAX_N = 200000;

int N, D;
int p[MAX_N+1], lv[MAX_N+1], in[MAX_N+1], out[MAX_N+1], cnt;
vector<int> gp[MAX_N+1];

struct SEG{
	struct NODE{
		int l, r, d;
	};
	vector<NODE> seg;
	int SZ;
	void add(){
		seg.pb({-1, -1, 0});
	}
	void Init(int x){
		SZ = x;
		add();
		init(0, 1, SZ);
	}
	void init(int idx, int s, int e){
		if(s==e)	return;
		seg[idx].l = seg.size(); add();
		seg[idx].r = seg.size(); add();
		init(seg[idx].l, s, (s+e)/2);
		init(seg[idx].r, (s+e)/2+1, e);
	}
	void Update(int x, int y){
		update(0, 1, SZ, x, y);
	}
	void update(int idx, int s, int e, int x, int y){
		if(s==e){
			seg[idx].d = y;
			return;
		}
		if(x<=(s+e)/2){
			update(seg[idx].l, s, (s+e)/2, x, y);
		}else{
			update(seg[idx].r, (s+e)/2+1, e, x, y);
		}
		if(seg[seg[idx].l].d==0){
			seg[idx].d = seg[seg[idx].r].d;
		}else if(seg[seg[idx].r].d==0){
			seg[idx].d = seg[seg[idx].l].d;
		}else{
			if(lv[seg[seg[idx].l].d]<lv[seg[seg[idx].r].d]){
				seg[idx].d = seg[seg[idx].l].d;
			}else{
				seg[idx].d = seg[seg[idx].r].d;
			}
		}
	}
	int Calc(int x, int y){
		return calc(0, 1, SZ, x, y);
	}
	int calc(int idx, int s, int e, int x, int y){
		if(x<=s && e<=y){
			return seg[idx].d;
		}else if(x>e || y<s)	return 0;
		int t0 = calc(seg[idx].l, s, (s+e)/2, x, y);
		int t1 = calc(seg[idx].r, (s+e)/2+1, e, x, y);
		if(t0==0)	return t1;
		if(t1==0)	return t0;
		if(lv[t0]<lv[t1])	return t0;
		return t1;
	}
}Seg;

void dfs(int x){
	in[x] = ++cnt;
	for(int i : gp[x]){
		lv[i] = lv[x]+1;
		dfs(i);
	}
	out[x] = cnt;
	while(1){
		int c = Seg.Calc(in[x], out[x]);
		if(c==0){
			Seg.Update(in[x], x);
			return;
		}
		Seg.Update(in[c], 0);
		int c2 = Seg.Calc(in[x], out[x]);
		if(c2==0){
			Seg.Update(in[c], c);
			break;
		}
		if(lv[c]-lv[x]+lv[c2]-lv[x]>=D){
			Seg.Update(in[c], c);
			break;
		}
	}
	int c = Seg.Calc(in[x], out[x]);
	if(lv[c]-lv[x]>=D){
		Seg.Update(in[x], x);
	}
}

int main(){
	scanf("%d%d", &N, &D);
	Seg.Init(N);
	for(int i=2; i<=N; i++){
		scanf("%d", &p[i]);
		p[i]++;
		gp[p[i]].pb(i);
	}
	dfs(1);
	int ans = 0;
	while(1){
		int c = Seg.Calc(in[1], out[1]);
		if(c==0)	break;
		ans++;
		Seg.Update(in[c], 0);
	}
	cout<<ans;
	return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:123:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &D);
  ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:126:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 5240 KB Output is correct
21 Correct 8 ms 5368 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 7 ms 5096 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 7 ms 5112 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 7 ms 5112 KB Output is correct
28 Correct 8 ms 5112 KB Output is correct
29 Correct 8 ms 5108 KB Output is correct
30 Correct 8 ms 5112 KB Output is correct
31 Correct 8 ms 5112 KB Output is correct
32 Correct 7 ms 5112 KB Output is correct
33 Correct 7 ms 5112 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 7 ms 5112 KB Output is correct
36 Correct 8 ms 5196 KB Output is correct
37 Correct 7 ms 5112 KB Output is correct
38 Correct 8 ms 5240 KB Output is correct
39 Correct 8 ms 5240 KB Output is correct
40 Correct 12 ms 5368 KB Output is correct
41 Correct 224 ms 17324 KB Output is correct
42 Correct 185 ms 11184 KB Output is correct
43 Correct 148 ms 11132 KB Output is correct
44 Correct 147 ms 11184 KB Output is correct
45 Correct 147 ms 11200 KB Output is correct
46 Correct 300 ms 17368 KB Output is correct
47 Correct 325 ms 17368 KB Output is correct
48 Correct 330 ms 17476 KB Output is correct
49 Correct 321 ms 17240 KB Output is correct
50 Correct 121 ms 9952 KB Output is correct
51 Correct 121 ms 10092 KB Output is correct
52 Correct 122 ms 10056 KB Output is correct
53 Correct 268 ms 14808 KB Output is correct
54 Correct 281 ms 14680 KB Output is correct
55 Correct 274 ms 14808 KB Output is correct
56 Correct 10 ms 5368 KB Output is correct
57 Correct 36 ms 9712 KB Output is correct
58 Correct 158 ms 26400 KB Output is correct
59 Correct 337 ms 32996 KB Output is correct
60 Correct 228 ms 18008 KB Output is correct
61 Correct 270 ms 17624 KB Output is correct