oj.uz

Submission #132486

# Submission time Handle Problem Language Result Execution time Memory
132486 2019-07-19T03:54:21 Z 이온조(#3199) Cat in a tree (BOI17_catinatree) C++14
51 / 100
 1000 ms 14192 KB 
#include <bits/stdc++.h>
using namespace std;

int N, D, d[200009];
vector<int> adj[200009];
bool chk[200009];

void dfs(int x, int p, int l) {
	if(l <= 0) return;
	chk[x] = 1;
	for(auto& it: adj[x]) if(it != p) dfs(it, x, l-1);
}

int main() {
	scanf("%d%d",&N,&D);
	for(int i=1; i<N; i++) {
		int foo; scanf("%d",&foo);
		adj[foo].push_back(i);
		adj[i].push_back(foo);
		d[i] = d[foo] + 1;
	}
	vector<int> S;
	for(int i=0; i<N; i++) S.push_back(i);
	sort(S.begin(), S.end(), [&](int PP, int QQ) { return d[PP] > d[QQ]; });
	int ans = 0;
	for(auto& it: S) {
		if(chk[it]) continue;
		++ans;
		dfs(it, it, D);
	}
	printf("%d", ans);
	return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:15: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:17:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int foo; scanf("%d",&foo);
            ~~~~~^~~~~~~~~~~

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 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4956 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4988 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 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 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4956 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4988 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 6 ms 5116 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 7 ms 5112 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 7 ms 5084 KB Output is correct
31 Correct 7 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 5048 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 10 ms 5084 KB Output is correct
38 Correct 7 ms 5116 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 7 ms 5112 KB Output is correct

Subtask #3
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 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4956 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4988 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 6 ms 5116 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 7 ms 5112 KB Output is correct
28 Correct 7 ms 5112 KB Output is correct
29 Correct 7 ms 5112 KB Output is correct
30 Correct 7 ms 5084 KB Output is correct
31 Correct 7 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 5048 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 10 ms 5084 KB Output is correct
38 Correct 7 ms 5116 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 7 ms 5112 KB Output is correct
41 Execution timed out 1064 ms 14192 KB Time limit exceeded
42 Halted 0 ms 0 KB -