Takahashi不慎让朋友X得知了他尴尬的秘密。每个朋友得知秘密后会将其分享给A[i]，只要A[i]还未得知。问题求解最终会有多少朋友知道这个秘密。输入包括N（朋友数），X（最先得知秘密的朋友编号）和A数组。通过搜索或循环可以找到秘密传播的范围。示例展示了传播过程和答案计算。
题目链接：B - Takahashi's Secret (atcoder.jp)
Problem Statement
Takahashi has N friends. They have nicknames: Friend 1, Friend 2, …, Friend N.
One day, Takahashi accidentally let one of his friends, Friend X, learn his shameful secret.
For each i = 1,2,…,N, when Friend ii learns the secret, he/she will share it with Friend Ai, if Friend Ai has not already learned it.
How many of Takahashi's friends will learn the secret in the end?
Constraints
- 2≤N≤105
- 1≤X≤N
- 1≤Ai≤N
- Ai!=i
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
N X A1 A2 ... AN
Output
Print the answer.
Sample Input 1 Copy
4 2 3
最低0.47元/天 解锁文章
扫一扫
317
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
