Submission #1840508


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

const int N=100010;

int n,k,cnt,ans,t,G[N];
struct edge{
  int t,nx;
}E[N<<1];

inline void addedge(int x,int y){
  E[++cnt].t=y; E[cnt].nx=G[x]; G[x]=cnt;
  E[++cnt].t=x; E[cnt].nx=G[y]; G[y]=cnt;
}

int dpt[N];

void dfs(int x,int f){
  for(int i=G[x];i;i=E[i].nx)
    if(E[i].t!=f){
      dfs(E[i].t,x);
      if(dpt[E[i].t]==k && x!=1) ans++;
      else dpt[x]=max(dpt[x],dpt[E[i].t]);
    }
  dpt[x]++;
}

int main(){
  scanf("%d%d",&n,&k); ans=0;
  int x; scanf("%d",&x);
  if(x!=1) ans++;
  for(int i=2;i<=n;i++)
    scanf("%d",&x),addedge(x,i);
  dfs(1,0);
  printf("%d\n",ans);
  return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User SBP
Language C++14 (GCC 5.4.1)
Score 800
Code Size 724 Byte
Status AC
Exec Time 20 ms
Memory 7296 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&k); ans=0;
                      ^
./Main.cpp:33:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x; scanf("%d",&x);
                        ^
./Main.cpp:36:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&x),addedge(x,i);
                                ^

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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 20 ms 7296 KB
1_03.txt AC 20 ms 7296 KB
1_04.txt AC 20 ms 7296 KB
1_05.txt AC 20 ms 7296 KB
1_06.txt AC 19 ms 7296 KB
1_07.txt AC 20 ms 7296 KB
1_08.txt AC 20 ms 7296 KB
1_09.txt AC 20 ms 7296 KB
1_10.txt AC 18 ms 4992 KB
1_11.txt AC 18 ms 4864 KB
1_12.txt AC 18 ms 4864 KB
1_13.txt AC 16 ms 2560 KB
1_14.txt AC 17 ms 2560 KB
1_15.txt AC 16 ms 2560 KB
1_16.txt AC 13 ms 2560 KB
1_17.txt AC 12 ms 2560 KB
1_18.txt AC 13 ms 2560 KB
1_19.txt AC 10 ms 2560 KB
1_20.txt AC 10 ms 2560 KB
1_21.txt AC 10 ms 2560 KB
1_22.txt AC 15 ms 2560 KB
1_23.txt AC 16 ms 2560 KB
1_24.txt AC 15 ms 2560 KB
1_25.txt AC 15 ms 2560 KB
1_26.txt AC 15 ms 2560 KB
1_27.txt AC 15 ms 2560 KB
1_28.txt AC 14 ms 2560 KB
1_29.txt AC 14 ms 2560 KB
1_30.txt AC 14 ms 2560 KB
1_31.txt AC 16 ms 2560 KB
1_32.txt AC 15 ms 2560 KB
1_33.txt AC 15 ms 2560 KB
1_34.txt AC 15 ms 2560 KB
1_35.txt AC 16 ms 2560 KB
1_36.txt AC 16 ms 2560 KB
1_37.txt AC 16 ms 2560 KB
1_38.txt AC 16 ms 2560 KB
1_39.txt AC 16 ms 2560 KB
1_40.txt AC 16 ms 2560 KB
1_41.txt AC 16 ms 2688 KB
1_42.txt AC 16 ms 2560 KB
1_43.txt AC 16 ms 2816 KB
1_44.txt AC 16 ms 2816 KB
1_45.txt AC 16 ms 2816 KB
1_46.txt AC 16 ms 2816 KB
1_47.txt AC 17 ms 3840 KB
1_48.txt AC 17 ms 3840 KB
1_49.txt AC 17 ms 3840 KB
1_50.txt AC 17 ms 3840 KB
1_51.txt AC 19 ms 6528 KB
1_52.txt AC 18 ms 6528 KB
1_53.txt AC 19 ms 6528 KB
1_54.txt AC 18 ms 6528 KB