Submission #3783695


Source Code Expand

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=1e5;
int n,k,ans,tot;
vector<int>vr[maxn+8];
int pre[maxn+8],now[maxn+8],son[maxn+8],dep[maxn+8],fa[maxn+8];
bool vis[maxn+8];

int read()
{
    int x=0,f=1;char ch=getchar();
    for (;ch<'0'||ch>'9';ch=getchar()) if (ch=='-') f=-1;
    for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
    return x*f;
}

void add(int u,int v)
{
    pre[++tot]=now[u];
    now[u]=tot;
    son[tot]=v;
}

void dfs(int x)
{
    vr[dep[x]].push_back(x);
    for (int p=now[x];p;p=pre[p])
	{
	    int child=son[p];
	    fa[child]=x;dep[child]=dep[x]+1;
	    dfs(child);
	}
}

void solve(int x)
{
    for (int i=1;i<=k;i++)
	{
	    if (vis[x]) return;
	    vis[x]=1;
	    x=fa[x];
	}
    ans+=(x!=1);
}

int main()
{
    n=read(),k=read();
    int x=read();if (x!=1) ans=1;
    for (int i=2;i<=n;i++)
	{
	    int f=read();
	    add(f,i);
	}
    dfs(1);
    vis[1]=1;
    for (int i=n;i;i--)
	for (vector<int>::iterator it=vr[i].begin();it!=vr[i].end();it++)
	    solve(*it);
    printf("%d\n",ans);
    return 0;
}

Submission Info

Submission Time
Task D - Teleporter
User AlseoRoplyer
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1207 Byte
Status AC
Exec Time 23 ms
Memory 10880 KB

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 22 ms 10880 KB
1_03.txt AC 22 ms 10880 KB
1_04.txt AC 22 ms 10880 KB
1_05.txt AC 23 ms 10880 KB
1_06.txt AC 23 ms 10880 KB
1_07.txt AC 23 ms 10880 KB
1_08.txt AC 23 ms 10880 KB
1_09.txt AC 23 ms 10880 KB
1_10.txt AC 19 ms 7808 KB
1_11.txt AC 19 ms 7808 KB
1_12.txt AC 19 ms 7808 KB
1_13.txt AC 13 ms 5376 KB
1_14.txt AC 13 ms 5376 KB
1_15.txt AC 13 ms 5376 KB
1_16.txt AC 9 ms 5244 KB
1_17.txt AC 9 ms 5244 KB
1_18.txt AC 9 ms 5244 KB
1_19.txt AC 6 ms 4728 KB
1_20.txt AC 6 ms 4728 KB
1_21.txt AC 6 ms 4728 KB
1_22.txt AC 12 ms 5248 KB
1_23.txt AC 12 ms 5248 KB
1_24.txt AC 12 ms 5120 KB
1_25.txt AC 11 ms 5116 KB
1_26.txt AC 11 ms 5116 KB
1_27.txt AC 11 ms 5116 KB
1_28.txt AC 11 ms 5116 KB
1_29.txt AC 11 ms 5116 KB
1_30.txt AC 11 ms 5244 KB
1_31.txt AC 13 ms 5248 KB
1_32.txt AC 14 ms 5248 KB
1_33.txt AC 14 ms 5248 KB
1_34.txt AC 14 ms 5248 KB
1_35.txt AC 14 ms 5120 KB
1_36.txt AC 15 ms 5120 KB
1_37.txt AC 15 ms 5120 KB
1_38.txt AC 15 ms 5248 KB
1_39.txt AC 14 ms 5248 KB
1_40.txt AC 15 ms 5248 KB
1_41.txt AC 15 ms 5248 KB
1_42.txt AC 15 ms 5248 KB
1_43.txt AC 15 ms 5504 KB
1_44.txt AC 16 ms 5504 KB
1_45.txt AC 16 ms 5504 KB
1_46.txt AC 16 ms 5504 KB
1_47.txt AC 18 ms 6656 KB
1_48.txt AC 19 ms 6656 KB
1_49.txt AC 19 ms 6656 KB
1_50.txt AC 20 ms 6656 KB
1_51.txt AC 22 ms 9984 KB
1_52.txt AC 22 ms 9984 KB
1_53.txt AC 22 ms 9984 KB
1_54.txt AC 23 ms 9984 KB