Submission #1695239


Source Code Expand

#include <bits/stdc++.h>

#define For(i, j, k) for(int i = j; i <= k; i++)
#define pb push_back

using namespace std;

const int N = 1e5 + 10;

int ans, n, k;
vector<int> G[N];

int dep[N], dis[N];

void DFS(int o){
	dis[o] = 0;
	for(int v : G[o]){
		dep[v] = dep[o] + 1;
		DFS(v);
		dis[o] = max(dis[o], dis[v] + 1);
	}
	if(dis[o] == k - 1 && dep[o] > 1) dis[o] = -1, ++ans;
}

int main(){
	int x;
	scanf("%d%d%d", &n, &k, &x);
	ans = x != 1;
	For(i, 2, n){
		int v;
		scanf("%d", &v);
		G[v].pb(i);
	}
	DFS(1);
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User dy0607
Language C++14 (GCC 5.4.1)
Score 800
Code Size 583 Byte
Status AC
Exec Time 32 ms
Memory 11136 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &k, &x);
                             ^
./Main.cpp:31:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 58
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt
Case Name Status Exec Time Memory
0_00.txt AC 2 ms 2560 KB
0_01.txt AC 2 ms 2560 KB
0_02.txt AC 2 ms 2560 KB
1_00.txt AC 2 ms 2560 KB
1_01.txt AC 2 ms 2560 KB
1_02.txt AC 32 ms 11136 KB
1_03.txt AC 28 ms 11136 KB
1_04.txt AC 28 ms 11136 KB
1_05.txt AC 28 ms 11136 KB
1_06.txt AC 28 ms 11136 KB
1_07.txt AC 27 ms 11136 KB
1_08.txt AC 28 ms 11136 KB
1_09.txt AC 29 ms 11136 KB
1_10.txt AC 27 ms 8832 KB
1_11.txt AC 27 ms 8832 KB
1_12.txt AC 26 ms 8832 KB
1_13.txt AC 27 ms 6528 KB
1_14.txt AC 26 ms 6528 KB
1_15.txt AC 24 ms 6528 KB
1_16.txt AC 18 ms 5116 KB
1_17.txt AC 18 ms 5116 KB
1_18.txt AC 17 ms 5116 KB
1_19.txt AC 11 ms 3832 KB
1_20.txt AC 12 ms 3832 KB
1_21.txt AC 11 ms 3832 KB
1_22.txt AC 23 ms 4992 KB
1_23.txt AC 23 ms 4992 KB
1_24.txt AC 22 ms 4992 KB
1_25.txt AC 22 ms 4352 KB
1_26.txt AC 22 ms 4352 KB
1_27.txt AC 22 ms 4352 KB
1_28.txt AC 15 ms 4096 KB
1_29.txt AC 15 ms 4096 KB
1_30.txt AC 15 ms 4096 KB
1_31.txt AC 23 ms 4992 KB
1_32.txt AC 24 ms 4992 KB
1_33.txt AC 23 ms 4992 KB
1_34.txt AC 23 ms 4992 KB
1_35.txt AC 25 ms 5376 KB
1_36.txt AC 24 ms 5376 KB
1_37.txt AC 25 ms 5376 KB
1_38.txt AC 24 ms 5248 KB
1_39.txt AC 25 ms 5376 KB
1_40.txt AC 25 ms 5376 KB
1_41.txt AC 24 ms 5376 KB
1_42.txt AC 25 ms 5376 KB
1_43.txt AC 25 ms 5632 KB
1_44.txt AC 24 ms 5632 KB
1_45.txt AC 25 ms 5632 KB
1_46.txt AC 25 ms 5632 KB
1_47.txt AC 25 ms 6784 KB
1_48.txt AC 25 ms 6784 KB
1_49.txt AC 25 ms 6784 KB
1_50.txt AC 26 ms 6784 KB
1_51.txt AC 31 ms 10112 KB
1_52.txt AC 27 ms 10112 KB
1_53.txt AC 27 ms 10112 KB
1_54.txt AC 28 ms 10112 KB