Submission #2559548


Source Code Expand

#include <cstdio>
#include <vector>

std::vector<int> children[100000];
int to[100000];
int N,K;

int cost=0;

int dfs(int node){
  int height=1;
  for(int child:children[node]){
    height=std::max(height,dfs(child)+1);
  }
  if(height==K&&to[node]!=0){
    cost++;
    return 0;
  }else{
    return height;
  }
}

int main(){
  scanf("%d %d",&N,&K);
  int R;
  scanf("%d",&R);
  if(R!=1){
    cost++;
  }
  for(int i=1;i<N;i++){
    int A;
    scanf("%d",&A);
    children[A-1].push_back(i);
    to[i]=A-1;
  }
  dfs(0);
  printf("%d\n",cost);
  return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User dragonslayerit
Language C++14 (GCC 5.4.1)
Score 800
Code Size 599 Byte
Status AC
Exec Time 26 ms
Memory 10752 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&N,&K);
                       ^
./Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&R);
                 ^
./Main.cpp:32:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&A);
                   ^

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 26 ms 10752 KB
1_03.txt AC 26 ms 10752 KB
1_04.txt AC 26 ms 10752 KB
1_05.txt AC 26 ms 10752 KB
1_06.txt AC 26 ms 10752 KB
1_07.txt AC 26 ms 10752 KB
1_08.txt AC 26 ms 10752 KB
1_09.txt AC 26 ms 10752 KB
1_10.txt AC 25 ms 8448 KB
1_11.txt AC 25 ms 8448 KB
1_12.txt AC 25 ms 8448 KB
1_13.txt AC 24 ms 6144 KB
1_14.txt AC 24 ms 6144 KB
1_15.txt AC 24 ms 6144 KB
1_16.txt AC 16 ms 4732 KB
1_17.txt AC 16 ms 4732 KB
1_18.txt AC 16 ms 4732 KB
1_19.txt AC 10 ms 3452 KB
1_20.txt AC 10 ms 3452 KB
1_21.txt AC 10 ms 3452 KB
1_22.txt AC 22 ms 4480 KB
1_23.txt AC 22 ms 4480 KB
1_24.txt AC 21 ms 4480 KB
1_25.txt AC 21 ms 3968 KB
1_26.txt AC 21 ms 3968 KB
1_27.txt AC 20 ms 3968 KB
1_28.txt AC 14 ms 3712 KB
1_29.txt AC 13 ms 3712 KB
1_30.txt AC 13 ms 3712 KB
1_31.txt AC 22 ms 4608 KB
1_32.txt AC 22 ms 4608 KB
1_33.txt AC 22 ms 4608 KB
1_34.txt AC 22 ms 4608 KB
1_35.txt AC 23 ms 4864 KB
1_36.txt AC 23 ms 4864 KB
1_37.txt AC 23 ms 4864 KB
1_38.txt AC 23 ms 4864 KB
1_39.txt AC 24 ms 4992 KB
1_40.txt AC 23 ms 4992 KB
1_41.txt AC 23 ms 4992 KB
1_42.txt AC 23 ms 4992 KB
1_43.txt AC 24 ms 5248 KB
1_44.txt AC 23 ms 5248 KB
1_45.txt AC 23 ms 5248 KB
1_46.txt AC 24 ms 5248 KB
1_47.txt AC 24 ms 6400 KB
1_48.txt AC 24 ms 6400 KB
1_49.txt AC 24 ms 6400 KB
1_50.txt AC 24 ms 6400 KB
1_51.txt AC 26 ms 9728 KB
1_52.txt AC 26 ms 9728 KB
1_53.txt AC 25 ms 9728 KB
1_54.txt AC 26 ms 9728 KB