oj.uz

Submission #360186

# Submission time Handle Problem Language Result Execution time Memory
360186 2021-01-27T16:50:43 Z iamsleepy Cat in a tree (BOI17_catinatree) C++14
51 / 100
 1000 ms 21224 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e5+5;
const int inf=1e9;
int d;
int level[mxn];
set<pii> st;
vector<int> adj[mxn];
void dfs(int cur,int prev,int dist) {
	if(dist >= d) return;
	if(st.find({level[cur],cur}) != st.end()) st.erase({level[cur],cur});
	for(int u : adj[cur]) {
		if(u == prev) continue;
		dfs(u,cur,dist + 1);
	}
}


void DFS(int cur,int prev) {
	level[cur] = level[prev] + 1;
	for(int u : adj[cur]) {
		if(u != prev) DFS(u,cur);
	}
}


int main() {
	int n;
	cin>>n;

	cin>>d;
	for(int i = 1; i < n; i++) {
		int u;
		cin>>u;
		adj[u].push_back(i);
		adj[i].push_back(u);
	}

	level[0] = 0;
	DFS(0,0);
	for(int i = 0; i < n; i++) st.insert({level[i],i});
	int res = 0;
	while(!st.empty()) {
		auto it = st.rbegin();
		int u = it->second;
		res++;
		dfs(u,-1,0);
	}
	cout<<res<<endl;




}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 3 ms 4972 KB Output is correct
7 Correct 3 ms 4972 KB Output is correct
8 Correct 3 ms 4972 KB Output is correct
9 Correct 3 ms 4972 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 3 ms 4972 KB Output is correct
12 Correct 3 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 4 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 4 ms 4972 KB Output is correct
19 Correct 3 ms 4972 KB Output is correct
20 Correct 4 ms 4972 KB Output is correct
21 Correct 4 ms 5228 KB Output is correct
22 Correct 4 ms 5116 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5100 KB Output is correct
25 Correct 4 ms 5100 KB Output is correct
26 Correct 5 ms 5228 KB Output is correct
27 Correct 5 ms 5100 KB Output is correct
28 Correct 5 ms 5100 KB Output is correct
29 Correct 5 ms 5100 KB Output is correct
30 Correct 5 ms 5100 KB Output is correct
31 Correct 5 ms 5100 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 5 ms 5100 KB Output is correct
34 Correct 5 ms 5100 KB Output is correct
35 Correct 5 ms 5100 KB Output is correct
36 Correct 6 ms 5100 KB Output is correct
37 Correct 6 ms 5100 KB Output is correct
38 Correct 5 ms 5100 KB Output is correct
39 Correct 5 ms 5100 KB Output is correct
40 Correct 4 ms 5228 KB Output is correct
41 Execution timed out 1060 ms 21224 KB Time limit exceeded
42 Halted 0 ms 0 KB -