input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from itertools import accumulate
N,K=list(map(int,input().split()))
N_s=int(N**0.5)
list_a=[1]*N_s
list_b=[N//j-N_s for j in range(1,N_s+1)]
list_p=[N//j-N_s for j in range(1,N_s+1)]
for p in range(1,len(list_p)):
list_p[p-1]=list_p[p-1]-list_p[p]
for p in range(1,len(list_b)):
list_b[p-1]=list_b[p-1]-list_b[p]
list_bb=list(reversed(list(accumulate(reversed(list_b)))))
list_aa=list(accumulate(list_a))
mod=10**9+7
for i in range(K-1):
temp=sum(list_a)
list_an=[(temp+list_bb[j])%mod for j in range(N_s)]
list_bn=[(list_p[j-1]*list_aa[j-1])%mod for j in range(1,N_s+1)]
list_bbn=list(reversed(list(accumulate(reversed(list_bn)))))
list_aa=list(accumulate(list_an))
list_a=list_an
list_b=list_bn
list_bb=list_bbn
print(((sum(list_a)+sum(list_b))%mod)) | from itertools import accumulate as ac
N,K=list(map(int,input().split()))
n=int(N**0.5)
mod=10**9+7
list_a=[1]*n
list_b=[N//j-N//(j+1) for j in range(1,n)]+[(N//n-n)]
list_p=[p for p in list_b]
list_aa=list(ac(list_a))
list_bb=list(reversed(list(ac(reversed(list_b)))))
for i in range(K-1):
temp=sum(list_a)
list_a=[(temp+list_bb[j])%mod for j in range(n)]
list_b=[(list_p[j]*list_aa[j])%mod for j in range(n)]
list_aa=list(ac(list_a))
list_bb=list(reversed(list(ac(reversed(list_b)))))
print(((sum(list_a+list_b))%mod)) | p02992 |
N,K = list(map(int, input().split()))
# As = [N//i for i in range(1,int(N**0.5)+1)]
# Bs = [As[i]-As[i+1] for i in range(len(As)-1)]
# Bs[0] -= 1
# Bs = sorted(Bs) + [1]
As = []
for i in range(1,int(N**0.5)+1):
As.append(i)
if N//i != i:
As.append(N//i)
As = sorted(As,reverse=False)
nums = []
for i in range(len(As)-1):
nums.append(As[i+1]-As[i])
nums = [1] + nums
nums.reverse()
mod = 10**9 + 7
ans = 0
dp = [[0] * len(As) for i in range(K+1)]
from itertools import accumulate
# print(As,nums)
dp[0][0] = 1
for i in range(K):
# 1だと全通り分が成り立つし、Nだと1通り。
# それぞれ種別にまとまっているので、それらをかける
acc = list(accumulate(dp[i]))
for j in range(len(As)):
dp[i+1][len(As)-j-1] = acc[j]*nums[j]%mod
print((sum(dp[K])%mod))
| from itertools import accumulate
N,K = list(map(int, input().split()))
As = []
for i in range(1,int(N**0.5)+1):
As.append(i)
if N//i != i:
As.append(N//i)
As = sorted(As,reverse=False)
nums = []
for i in range(len(As)-1):
nums.append(As[i+1]-As[i])
nums = [1] + nums
nums.reverse()
mod = 10**9 + 7
ans = 0
dp = [[0] * len(As) for i in range(K+1)]
dp[0][0] = 1
for i in range(K):
# 1だと全通り分が成り立つし、Nだと1通り。
# それぞれ種別にまとまっているので、それらをかける
acc = list(accumulate(dp[i]))
for j in range(len(As)):
dp[i+1][len(As)-j-1] = acc[j]*nums[j]%mod
print((sum(dp[K])%mod))
| p02992 |
import sys
input = sys.stdin.readline
from itertools import accumulate
MOD = 10**9+7
n, k = list(map(int, input().split()))
S = set()
i = 1
while i * i <= n:
S.add(i)
S.add(n//i)
i += 1
L = [0] + sorted(S)
l = len(L) - 1
num = [0]*l
for i in range(l):
num[i] = L[i+1] - L[i]
dp = [0]*l
dp[0] = 1
for _ in range(k):
A = list(accumulate(dp))
for i in range(l):
dp[i] = A[l-1-i] * num[i]
dp[i] %= MOD
ans = sum(dp) % MOD
print(ans) | import sys
input = sys.stdin.readline
from itertools import accumulate
MOD = 10**9+7
def main():
n, k = list(map(int, input().split()))
S = set()
i = 1
while i * i <= n:
S.add(i)
S.add(n//i)
i += 1
L = [0] + sorted(S)
l = len(L) - 1
num = [0]*l
for i in range(l):
num[i] = L[i+1] - L[i]
dp = [0]*l
dp[0] = 1
for _ in range(k):
A = list(accumulate(dp))
for i in range(l):
dp[i] = A[l-1-i] * num[i]
dp[i] %= MOD
ans = sum(dp) % MOD
print(ans)
if __name__ == "__main__":
main() | p02992 |
import math
import copy
N, K = list(map(int, (input().split())))
mod = 10**9 + 7
ans_array = []
divide_max = N
for i in range(2, math.floor(math.sqrt(N)) + 2):
divide = math.floor(N / i)
ans_array.append(divide_max - divide)
divide_max = divide
for i in range(divide):
ans_array.append(1)
ans_array = ans_array[::-1]
ans_count = copy.deepcopy(ans_array)
# print(ans_count)
ans_length = len(ans_array)
ans_acc = [0] * ans_length
for k in range(2, K + 1):
ans_acc[0] = ans_array[0]
for i in range(1, ans_length):
ans_acc[i] = (ans_acc[i - 1] + ans_array[i]) % mod
# print(ans_array)
# print(ans_acc)
for i in range(ans_length):
ans_array[i] = ans_acc[ans_length-i-1] * ans_count[i] % mod
ans_acc[0] = ans_array[0]
for i in range(1, ans_length):
ans_acc[i] = (ans_acc[i - 1] + ans_array[i]) % mod
print((ans_acc[-1])) | import math
N, K = list(map(int, (input().split())))
mod = 10**9 + 7
ans_array = []
divide_max = N
divide_count = []
for i in range(2, math.floor(math.sqrt(N)) + 2):
divide = math.floor(N / i)
ans_array.append(divide_max - divide)
divide_count.append(divide_max - divide)
divide_max = divide
for i in range(divide):
ans_array.append(1)
ans_array = ans_array[::-1]
# print(ans_count)
ans_length = len(ans_array)
ans_acc = [0] * ans_length
for k in range(2, K + 1):
ans_acc[0] = ans_array[0]
for i in range(1, ans_length):
ans_acc[i] = (ans_acc[i - 1] + ans_array[i]) % mod
# print(ans_array)
# print(ans_acc)
for i in range(divide):
ans_array[i] = ans_acc[ans_length - i - 1]
for i in range(divide, ans_length):
ans_array[i] = ans_acc[ans_length - i - 1] * divide_count[
ans_length - 1 - i] % mod
ans_acc[0] = ans_array[0]
for i in range(1, ans_length):
ans_acc[i] = (ans_acc[i - 1] + ans_array[i]) % mod
print((ans_acc[-1])) | p02992 |
n, k = [int(x) for x in input().strip().split(" ")]
mod = pow(10, 9) + 7
ll = []
ks = []
cc = 0
last = 0
for i in range(n):
i += 1
if n//i < i:
last = n//i
break
ll.append(n//i)
ks.append(1)
last = n//i
cc += 1
while True:
if last == 0:
break
if last >= len(ll):
mm = last
else:
mm = ll[last]
ll.append(last * (ll[last-1] - mm))
ks.append((ll[last-1] - mm))
last -= 1
n_l = len(ll)
for _ in range(k-2):
nll = []
m = sum(ll) % mod
for i in range(n_l):
x = n_l - i - 1
nll.append((m * ks[i]) % mod)
m -= (mod + ll[x]) % mod
ll = nll[:]
print((sum(ll) % mod))
| from itertools import accumulate as r;n,k=list(map(int,input().split()));m=10**9+7;j=int(n**0.5);c=[n//(i+1)-n//(i+2) for i in range(n//(j+1))]+[1]*j;x=c;exec("x=[(y*d)%m for y,d in zip(r(x[::-1]),c)];"*k);print((x[-1])) | p02992 |
a,b,c=list(map(int,input().split()))
ans=0
poison=False
while(True):
if(poison):
if(b>0):
b-=1
ans+=1
elif(a>0):
a-=1
else:
break
poison=False
else:
if(c>0):
c-=1
ans+=1
poison=True
elif(b>0):
b-=1
ans+=1
elif(a>0):
a-=1
else:
break
print(ans) | a,b,c=list(map(int,input().split()))
if(c<=a+b):
print((c+b))
else:
print(((a+b)+b+1))
| p03186 |
import sys
input=sys.stdin.readline
a,b,c = list(map(int, input().split()))
hp = 2
ans = 0
while True:
if a == 0 and b == 0 and c == 0:
break
if hp == 1 and a == 0 and b == 0:
break
if hp > 1 and c > 0:
ans += 1
c -= 1
hp -= 1
if hp < 2 or c == 0:
if a > 0:
a -= 1
hp = max(2, hp+1)
elif b > 0:
b -= 1
hp = max(2, hp+1)
ans += 1
print(ans)
| import sys
input=sys.stdin.readline
a,b,c = list(map(int, input().split()))
if a >= c-1 or b >= c-1 or a+b >= c-1:
print((b+c))
else:
print((b+(a+b)+1))
| p03186 |
a,b,c=list(map(int, input().split()))
count=0
while(True):
if c>0:
if b>0:
c-=1
b-=1
count+=2
else:
if a>0:
c-=1
a-=1
count+=1
else:
c-=1
count+=1
break
else:
count+=b
break
print(count) | a,b,c=list(map(int, input().split()))
count=0
if c>=b:
count+=2*b
c=c-b
if c>a:
count+=a
c=c-a
if c>0:
count+=1
else:
count+=c
else:
count+=c+b
print(count) | p03186 |
A, B, C = list(map(int, input().split()))
ans = 0
c = C
for i in range(C) :
if c > 0 and B > 0 :
ans += 2
c -= 1
B -= 1
elif c > 0 and A > 0 :
ans += 1
c -= 1
A -= 1
if c > 0 :
ans += 1
print((ans + B))
| A, B, C = list(map(int, input().split()))
ans = 0
if B >= C :
print((B + C))
exit()
ans = 2 * B
C -= B
if A >= C :
print((ans + C))
exit()
print((ans + A + 1))
| p03186 |
A,B,C=(int(i) for i in input().split())
counter=0
while C>0:
C-=1
counter+=1
if B>0:
B-=1
counter+=1
elif A>0:
A-=1
else:
break
if B>0:
counter+=B
print(counter)
| A,B,C=(int(i) for i in input().split())
counter=0
#BとCから
if C>=B:
counter+=B*2
C=C-B
B=0
if C>A:
counter+=A+1
else:
counter+=C
else:
counter+=C*2
B-=C
C=0
counter+=B
print(counter)
| p03186 |
A,B,C = list(map(int,input().split()))
can = min(A+B,C)
eat = 0
for i in range(can):
C -= 1
eat += 1
if A > 0:
A -= 1
else:
eat += 1
B -= 1
if C > 0:
eat += 1
print((eat+B)) | A,B,C = list(map(int,input().split()))
can = min(A+B,C)
eat = 0
C -= can
eat += can*2-A
B = A+B -can
if C > 0:
eat += 1
print((eat+B)) | p03186 |
a,b,c = (int(i) for i in input().split())
if a + b >= c:
print((b + c))
else:
print((a + b + b + 1)) | a, b, c = (int(i) for i in input().split())
if a + b >= c:
print((b + c))
else:
print((b + a + b + 1)) | p03186 |
A, B, C = list(map(int, input().split()))
jyotai = 0
ans = 0
while True:
if A == 0 and B == 0 and jyotai == 1:
break
if B == 0 and C == 0:
break
if jyotai == 0:
if C != 0:
ans += 1
C -= 1
jyotai += 1
else:
ans += 1
B -= 1
jyotai -= 1
else:
if B != 0:
ans += 1
B -= 1
else:
A -= 1
jyotai -= 1
print(ans) | A, B, C = list(map(int, input().split()))
ans = 2 * B
C -= B
if A >= C:
ans += C
else:
ans += A + 1
print(ans) | p03186 |
# https://atcoder.jp/contests/agc030/tasks/agc030_a
def main():
A, B, C = list(map(int, input().split()))
deli = 0
while A > 0 and C > 0:
deli += 1
A -= 1
C -= 1
# 美味しくないクッキーがなくなった
while B > 0 and C > 0:
deli += 2
B -= 1
C -= 1
if C > 0:
deli += 1
deli += B
print(deli)
if __name__ == '__main__':
main()
| # https://atcoder.jp/contests/agc030/tasks/agc030_a
def main():
A, B, C = list(map(int, input().split()))
deli = 0
if A > 0 and C > 0:
eat = min(A, C)
deli += eat
A -= eat
C -= eat
# 美味しくないクッキーがなくなった, お腹壊してない
if B > 0 and C > 0:
eat = min(B, C)
deli += eat * 2
B -= eat
C -= eat
# お腹壊してない
if C > 0:
deli += 1
deli += B
print(deli)
if __name__ == '__main__':
main()
| p03186 |
from collections import defaultdict as dd
from collections import Counter
from pprint import pprint as pp
YN = {True: 'Yes', False: 'No'}
ri = lambda: int(eval(input()))
ria = lambda: list(map(int, input().split()))
rian = lambda n: [ria() for _ in range(n)]
rs = lambda: eval(input())
rsa = lambda: input().split()
rsn = lambda n: [rs() for _ in range(n)]
A, B, C = ria()
umai = 0
for _ in range(C):
umai += 1
if B > 0:
B -= 1
umai += 1
elif A > 0:
A -= 1
else:
break
umai += B
print(umai) | from collections import defaultdict as dd
from collections import Counter
from pprint import pprint as pp
YN = {True: 'Yes', False: 'No'}
ri = lambda: int(eval(input()))
ria = lambda: list(map(int, input().split()))
rian = lambda n: [ria() for _ in range(n)]
rs = lambda: eval(input())
rsa = lambda: input().split()
rsn = lambda n: [rs() for _ in range(n)]
A, B, C = ria()
umai = 0
if C <= B:
umai = C+B
else:
umai = B*2
C -= B
if C <= A:
umai += C
else:
umai += A+1
print(umai) | p03186 |
a, b, c = list(map(int, input().split()))
if c > (a + b):
print((a + b + 1 + b))
else:
print((c + b))
| a, b, c = list(map(int, input().split()))
print((b + min(a + b + 1, c)))
| p03186 |
A, B, C = list(map(int, input().split()))
print((min(C, A + B + 1) + B))
| A, B, C = list(map(int, input().split()))
print((B + min(C, A + B + 1)))
| p03186 |
# -*- coding: utf-8 -*-
# 整数の入力
a, b, c = list(map(int, input().split()))
sum = 0
while (1 == 1):
#Cがある時
if c > 0:
c = c - 1
sum = sum + 1
if a > 0:
a = a - 1
elif b > 0:
b = b -1
sum = sum + 1
else :
break
# Cがない時
else :
if b > 0:
b = b -1
sum = sum + 1
else :
break
# 出力
print(("{}" .format(sum))) | # -*- coding: utf-8 -*-
# 整数の入力
a, b, c = list(map(int, input().split()))
result = 0
if a + b + 1 >= c:
result = b + c
else:
result = b + (a + b + 1)
# 出力
print(("{}" .format(result))) | p03186 |
'''
AtCoder Grand Contest 030
A - Poisonous Cookies
'''
def main():
a, b, c = list(map(int, input().split()))
oishii = b + c
# クッキーを食べる
while a + b > 0:
c = c - 1 if c > 0 else 0
if b > 0:
b -= 1
elif a > 0:
a -= 1
# まだcが残ってるなら一枚食べれる
if c > 0:
c -= 1
print((oishii - (b + c)))
if __name__ == "__main__":
main()
| '''
AtCoder Grand Contest 030
A - Poisonous Cookies
'''
def main():
a, b, c = list(map(int, input().split()))
'''
A + B + 1 ≥ C ならすべての毒入りの
クッキーを食べることができるので B + C。
そうでないなら答えはB + (A + B + 1) 。
※「+1」は最後にCを食べるので
'''
print((b + min(c, a + b + 1)))
if __name__ == "__main__":
main()
| p03186 |
A, B, C = [int(s) for s in input().split()]
poisonous = False
eaten_cookies = 0
while True:
if not poisonous and C > 0:
eaten_cookies += 1
C -= 1
poisonous = True
elif poisonous and A > 0:
A -= 1
poisonous = False
elif B > 0:
eaten_cookies += 1
B -= 1
poisonous = False
else:
break
print(eaten_cookies) | A, B, C = [int(s) for s in input().split()]
print((min([C, A + B + 1]) + B)) | p03186 |
a, b, c = list(map(int, input().split()))
cnt = 0
while c > 0 or b > 0:
if c > 0:
c -= 1
cnt += 1
elif b > 0:
b -= 1
cnt += 1
continue
if b > 0:
b -= 1
cnt += 1
continue
elif a > 0:
a -= 1
continue
else:
break
print(cnt) | a, b, c = list(map(int, input().split()))
cnt = 0
if a + b + 1>= c:
ans = b + c
else:
ans = b + a + b + 1
print(ans) | p03186 |
A,B,C=list(map(int,input().split()))
poisoned=False
ans=0
while True:
if C>0 and not poisoned:
ans+=1
C-=1
poisoned=True
if B>0:
ans+=1
poisoned=False
B-=1
if A>0 and poisoned:
A-=1
poisoned=False
if (B==0 and A==0 and poisoned) or (B==0 and C==0):
break
print(ans) | A,B,C=list(map(int,input().split()))
if A+B>=C:
print((B+C))
else:
print((B*2+A+1))
| p03186 |
a,b,c = list(map(int, input().split()))
x = 0
if a<=c:
x += a
c -= a
a = 0
elif a>c:
x += c
c = 0
a -= c
if c<=b:
x += (c+b)
c = 0
b = 0
elif c>b:
x += (2*b)
b = 0
c -= b
if c>0:
x += 1
print(x)
| a,b,c = list(map(int, input().split()))
print((b+min(c,a+b+1))) | p03186 |
a,b,c=[int(i) for i in input().split()]
count=0
while c > 0:
c -= 1
count += 1
if b > 0:
b -= 1
count += 1
elif a>0:
a -= 1
else:
break
if b>0:
count+=b
print(count) | a,b,c=[int(i) for i in input().split()]
if c<b or c<=a+b:
print((b+c))
else:
print((a+b*2+1)) | p03186 |
from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
def dfs(level=0, u=0):
if len(to[(level, u)]) == 1:
cnt_tree[l - level] += 1
for kl, ku in to[(level, u)]:
dfs(kl, ku)
to = defaultdict(set)
n, l = map(int, input().split())
ss = [input()[:-1] for _ in range(n)]
# 各sをパスと見て、辺を張っていく
for s in ss:
now_l = 0
now_u = 0
for c in s:
nxt_l = now_l + 1
nxt_u = (now_u << 1) + int(c)
to[(now_l, now_u)].add((nxt_l, nxt_u))
now_l, now_u = nxt_l, nxt_u
# print(to)
# パスで分離された木のレベルと個数を数える
cnt_tree = defaultdict(int)
dfs()
#print(cnt_tree)
# Grundy数をlv & -lvで求め、xorをとる
sum_xor = 0
for lv, cnt in cnt_tree.items():
if cnt % 2 == 0: continue
sum_xor ^= lv & -lv
if sum_xor == 0:
print("Bob")
else:
print("Alice")
main()
| from collections import defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
n, l = map(int, input().split())
ss = [input()[:-1] for _ in range(n)] + ["$"]
ss.sort()
# print(ss)
# 隣同士のsを先頭から比べて、異なるところでそのlevelの木を消して、それ以降の木を追加する
cnt_tree = defaultdict(int)
cnt_tree[l] = 2
for s0, s1 in zip(ss, ss[1:]):
for depth, (c0, c1) in enumerate(zip(s0, s1)):
if c0 == c1: continue
cnt_tree[l - depth] -= 1
for lv in range(l - depth - 1, l - len(s1), -1):
cnt_tree[lv] += 1
# print(cnt_tree)
break
# Grundy数をlv & -lvで求め、xorをとる
sum_xor = 0
for lv, cnt in cnt_tree.items():
if cnt % 2 == 0: continue
sum_xor ^= lv & -lv
if sum_xor:
print("Alice")
else:
print("Bob")
main()
| p03491 |
def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N, L = list(map(int, input().split()))
dic = defaultdict(int)
for _ in range(N):
s = input().rstrip('\n')
for i in range(len(s)):
dic[s[:i+1]] = 1
g = 0
key = list(dic.keys())
for s in key:
t = [si for si in s]
t[-1] = '0' if t[-1] == '1' else '1'
t = ''.join(t)
if not dic[t]:
tmp = L - len(s) + 1
cnt = 0
while tmp % 2 == 0:
tmp //= 2
cnt += 1
g ^= (2**cnt)
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main() | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N, L = list(map(int, input().split()))
dic = defaultdict(int)
for _ in range(N):
s = input().rstrip('\n')
s = [si for si in s]
for i in range(len(s)):
dic[''.join(s[:i+1])] = 1
g = 0
key = list(dic.keys())
for s in key:
t = [si for si in s]
t[-1] = '0' if t[-1] == '1' else '1'
t = ''.join(t)
if not dic[t]:
tmp = L - len(s) + 1
cnt = 0
while tmp % 2 == 0:
tmp //= 2
cnt += 1
g ^= (2**cnt)
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main() | p03491 |
def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
mod = 10**10+7
mod2 = 10**10+9
mod3 = 998244353
N, L = list(map(int, input().split()))
dic = defaultdict(int)
dic2 = defaultdict(int)
dic3 = defaultdict(int)
h_list = []
h2_list = []
h3_list = []
pair = {}
pair2 = {}
pair3 = {}
M = 0
for _ in range(N):
s = input().rstrip('\n')
h = 0
h2 = 0
h3 = 0
for i in range(len(s)):
M += 1
h = (h*1007 + int(s[i]) + 1) % mod
pair[h] = (h + 1)%mod if s[i] == '0' else (h-1)%mod
h2 = (h2 * 2009 + int(s[i]) + 1) % mod2
pair2[h2] = (h2 + 1)%mod2 if s[i] == '0' else (h2-1)%mod2
h3 = (h3 * 3001 + int(s[i]) + 1) % mod3
pair3[h3] = (h3 + 1) % mod3 if s[i] == '0' else (h3 - 1) % mod3
dic[h] = i+1
dic2[h2] = i+1
dic[h3] = i+1
h_list.append(h)
h2_list.append(h2)
h3_list.append(h3)
g = 0
seen = defaultdict(int)
seen2 = defaultdict(int)
seen3 = defaultdict(int)
for i in range(M):
s, s2, s3 = h_list[i], h2_list[i], h3_list[i]
if seen[s] and seen2[s2] and seen3[s3]:
continue
t = pair[s]
t2 = pair2[s2]
t3 = pair3[s3]
if dic[t] == 0 or dic2[t2] == 0 or dic3[t3] == 0:
p = [dic[s], dic2[s2], dic3[s3]]
p.sort()
tmp = L - p[1] + 1
'''
if not seen[s]:
tmp = L - dic[s] + 1
elif not seen[s2]:
tmp = L - dic2[s2] + 1
else:
tmp = L - dic3[s3] + 1
'''
cnt = 0
while tmp % 2 == 0:
tmp //= 2
cnt += 1
g ^= (2**cnt)
#print(g, s, s2, t, t2, dic[t], dic2[t2])
seen[s] = 1
seen2[s2] = 1
seen3[s3] = 1
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.readline
class TreiNode:
def __init__(self, char_num, depth):
self.end = False
self.child = [None] * char_num
self.depth = depth
def __setitem__(self, i, x):
self.child[i] = x
def __getitem__(self, i):
return self.child[i]
class Trei:
def __init__(self, char_num):
self.root = TreiNode(char_num, 0)
self.char_num = char_num
def add(self, S):
v = self.root
for s in S:
if v[s] is None:
v[s] = TreiNode(self.char_num, v.depth + 1)
v = v[s]
v.end = True
def exist(self, S):
v = self.root
for s in S:
if v[s] is None:
return False
v = v[s]
if v.end:
return True
else:
return False
N, L = list(map(int, input().split()))
T = Trei(2)
for _ in range(N):
S = input().rstrip('\n')
S = [int(s) for s in S]
T.add(S)
g = 0
st = [T.root]
while st:
v = st.pop()
for i in range(2):
if v[i] is None:
d = L - v.depth
g ^= d & -d
else:
st.append(v[i])
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main()
| p03491 |
s = input().split()
n = int(s[0])
k = int(s[1])
a = input().split()
siyouzumi = [1]
t = 1
for i in range(1,k+1):
t = int(a[t-1])
if t in siyouzumi:
haba = i - siyouzumi.index(t)
kaisu = int((k - i) / haba)
l = k - (i + (haba * kaisu))
for j in range(l):
t = int(a[t-1])
break
siyouzumi.append(t)
print(t) | s = input().split()
n = int(s[0])
k = int(s[1])
a = input().split()
siyouzumi = {1}
y = [1]
t = 1
for i in range(1,k+1):
t = int(a[t-1])
if t in siyouzumi:
haba = i - y.index(t)
kaisu = int((k - i) / haba)
l = k - (i + (haba * kaisu))
for j in range(l):
t = int(a[t-1])
break
siyouzumi.add(t)
y.append(t)
print(t) | p02684 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
town = 1
record = [1]
for i in range(N):
town = A[town-1]
if town in record:
break
record.append(town)
newrecord = record[record.index(town):]
roop = len(newrecord)
newK = K-(len(record)-roop)
if newK>=0:
answer = newrecord[newK%roop]
else:
answer = record[K]
print(answer) | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
town = 1
record = [1]
record2 = [0]*N
for i in range(N):
town = A[town-1]
if record2[town-1]==1:
break
record.append(town)
record2[town-1] += 1
newrecord = record[record.index(town):]
roop = len(newrecord)
newK = K-(len(record)-roop)
if newK>=0:
answer = newrecord[newK%roop]
else:
answer = record[K]
print(answer) | p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
loc = 0
locs = [0]
ini = 0
while True:
c += 1
loc = a[loc] - 1
if c == k:
print((loc + 1))
break
if loc in locs:
ini = locs.index(loc)
break
locs.append(loc)
if c != k:
rest = int((k - ini) % (c - ini))
if rest <= 0:
print((loc + 1))
else:
d = 0
while True:
d += 1
loc = a[loc] - 1
if d == rest:
print((loc + 1))
break
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
loc = 0
locs = {0: 0}
ini = 0
while True:
c += 1
loc = a[loc] - 1
if c == k:
print((loc + 1))
break
if loc in locs:
ini = locs.get(loc)
break
locs[loc] = c
if c != k:
rest = int((k - ini) % (c - ini))
if rest <= 0:
print((loc + 1))
else:
d = 0
while True:
d += 1
loc = a[loc] - 1
if d == rest:
print((loc + 1))
break
| p02684 |
N, K = list(map(int, input().split()))
A = [1] + list(map(int, input().split()))
p = 1
points = [p]
for _ in range(N):
p = A[p]
if p in points:
break
points.append(p)
idx = points.index(p)
if idx > K:
print((points[K]))
exit()
cycle = points[idx:]
print((cycle[(K - idx) % len(cycle)])) | N, K = list(map(int, input().split()))
A = [1] + list(map(int, input().split()))
p = 1
points = [p]
visited = set([p])
for _ in range(N):
p = A[p]
if p in visited:
break
points.append(p)
visited.add(p)
idx = points.index(p)
if idx > K:
print((points[K]))
exit()
cycle = points[idx:]
print((cycle[(K - idx) % len(cycle)])) | p02684 |
n,k = list(map(int,input().split()))
alist = list(map(int,input().split()))
town_loop = [1]
for i in range(k):
next_town = alist[town_loop[i]-1]
try:
loop_start = town_loop.index(next_town)
break
except ValueError:
town_loop.append(next_town)
if len(town_loop) == k+1:
print((town_loop[k]))
else:
o = len(town_loop) - loop_start
print((town_loop[((k-loop_start) % o) + loop_start]))
|
n,k = list(map(int,input().split()))
alist = list(map(int,input().split()))
town_loop = [1]
used = [-1] * n
for i in range(k):
next_town = alist[town_loop[i]-1]
if used[next_town-1] == -1:
town_loop.append(next_town)
used[next_town-1] = 1
else:
break
loop_start = town_loop.index(next_town)
if len(town_loop) == k+1:
print((town_loop[k]))
else:
o = len(town_loop) - loop_start
print((town_loop[((k-loop_start) % o) + loop_start]))
| p02684 |
import sys
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [1]
cnt = 0
next_town = 0
l = len(a)
for j in range(l):
cnt += 1
if j==0:
b.append(a[0])
next_town = a[0]
continue
b.append(a[next_town - 1])
next_town = a[next_town -1]
for i in range(l):
if b.count(i+1)==2:
k -= cnt
idx_f = b.index(i+1)
roop_list = b[idx_f:-1]
roop_num = len(b[idx_f:-1])
last = k %roop_num
print((roop_list[last]))
sys.exit()
| N, K = list(map(int, input().split()))
A = [int(a) - 1 for a in input().split()]
if K <= N:
p = 0
for i in range(K):
p = A[p]
print((p + 1))
exit()
p = 0
t = [-1] * N
t[0] = 0
for i in range(1, N):
p = A[p]
if t[p] != -1:
break
t[p] = i
d = i - t[p]
K -= i
K %= d
for i in range(K):
p = A[p]
print((p + 1)) | p02684 |
def main():
N_machi, K_teleport = list(map(int, input().split()))
to_teleport = list(map(int, input().split()))
def find_double_town():
visited_city = [0]
first_twice = N_machi
next_city = 0
for i in range(N_machi):
next_city = to_teleport[next_city] - 1
visited_city.append(next_city)
if (len(visited_city) != len(set(visited_city))):
first_twice = i + 1
break
return (next_city, first_twice)
index_city, second_visit = find_double_town()
if (index_city == 0):
first_visit = 0
else:
next_city = 0
for i in range(N_machi):
next_city = to_teleport[next_city] - 1
if (next_city == index_city):
first_visit = i + 1
break
if (K_teleport >= first_visit):
mod = (K_teleport - first_visit) % (second_visit - first_visit)
next_city = index_city
else:
mod = K_teleport
next_city = 0
for i in range(mod):
next_city = to_teleport[next_city] - 1
ans = next_city + 1
print(ans)
# print(first_visit,second_visit)
if __name__ == '__main__':
main() | def main():
N_machi, K_teleport = list(map(int, input().split()))
to_teleport = list(map(int, input().split()))
visited_city = [1]
order = [-1 for i in range(N_machi + 1)]
order[1] = 0
next_city = 1
for i in range(N_machi):
next_city = to_teleport[next_city - 1]
tmp = order[next_city]
if (tmp == -1):
visited_city.append(next_city)
order[next_city] = i + 1
else:
break
first = order[next_city]
len_loop = len(visited_city) - first
if (K_teleport < first):
ans = visited_city[K_teleport]
else:
mod = (K_teleport - first) % len_loop
ans = visited_city[first + mod]
print(ans)
if __name__ == '__main__':
main() | p02684 |
import sys
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [1]
tmp = 1
ct = 0
check = 0
while True:
x = A[tmp - 1]
ct += 1
if x in L or ct > k:
check = x
break
else:
L.append(x)
tmp = x
if ct > k:
print((L[k]))
sys.exit()
p = L.index(check)
l = len(L)
roop = l - p
if k < p:
print((L[k]))
else:
k -= p
k %= roop
print((L[p + k])) | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
visit = [-1] * n #到達しているかどうかを管理
D = [1] # 循環するもののindexを格納
tmp = A[0] #初期位置
ct = 1
while visit[tmp - 1] == -1:
D.append(tmp)
visit[tmp - 1] = ct #到達済に変更
if k == ct:
print(tmp)
exit()
ct += 1
tmp = A[tmp - 1]
#循環している場合の残りの処理
k -= visit[tmp - 1]
k %= (ct - visit[tmp - 1])
print((D[visit[tmp - 1] + k])) | p02684 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
kiseki=[]
u=1
kiseki.append(1)
for i in l:
u=l[u-1]
if kiseki.count(u)==0:
kiseki.append(u)
else:
kiseki.append(u)
break
kuri=kiseki[kiseki.index(u):len(kiseki)-1]
if k<=len(kiseki)-(len(kuri)+1):
print((kiseki[k]))
else:
K=k-(len(kiseki)-(len(kuri)+1))
amari=K%len(kuri)
print((kuri[amari])) | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
kiseki=[-1]*n
i=0
v=1
while kiseki[v-1]==-1:
kiseki[v-1]=i
v=l[v-1]
i+=1
saisyo=kiseki[v-1]
kuri=i-saisyo
if saisyo>k:
print((kiseki.index(k)+1))
else:
amari=(k-saisyo)%kuri
print((kiseki.index(amari+saisyo)+1)) | p02684 |
def main():
N, K = list(map(int, input().split()))
A_list = input().split()
root = [1]
break_flag = 0
for n in range(K):
new = A_list[ int(root[n])-1 ]
if new not in root:
root.append(new)
else:
ind = root.index(new)
break
else:
print(new)
break_flag = 1
if break_flag == 0:
pre = len(root[:ind])
roop = len(root)-pre
print((root[ind:][(K-pre)%roop]))
if __name__ == '__main__':
main() | def main():
N, K = list(map(int, input().split()))
A_list = input().split()
root = [1]
record = [-1]*N
break_flag = 0
for n in range(K):
new = int(A_list[ int(root[n])-1 ])
if record[new-1] <0:
record[new-1]=1
root.append(new)
else:
ind = root.index(new)
break
else:
print(new)
break_flag = 1
if break_flag == 0:
pre = len(root[:ind])
roop = len(root)-pre
print((root[ind:][(K-pre)%roop]))
if __name__ == '__main__':
main() | p02684 |
n,k=list(map(int,input().split()))
a = list(map(int,input().split()))
rep = []
rep.append(1)
i = 0
cnt = 0
if n>k:
end =k
else:
end =n
nof = 0
while True:
cnt+=1
if cnt>end:
nof=1
break
go = a[i]-1
if a[i] not in rep:
rep.append(a[i])
i = go
else:
rep.append(a[i])
break
if nof==1:
print((rep[k]))
else:
lr = len(rep)
for i in range(lr):
if rep[i]==rep[lr-1]:
start=i
rep2 = rep[i:lr-1]
break
mod = len(rep2)
modL = [i%mod for i in range(start,start+mod)]
resM = k%mod
for i in range(mod):
if resM == modL[i]:
print((rep2[i])) | n,k=list(map(int,input().split()))
a = list(map(int,input().split()))
visit = []
visit = [0]*n
pos=0
move=[]
roop=[]
while visit[pos]!=2:
if visit[pos]==0:
move.append(pos)
else:
roop.append(pos)
visit[pos]+=1
pos = a[pos]-1
if len(move)>k:
print((move[k]+1))
else:
mod = (k-(len(move)-len(roop)))%len(roop)
print((roop[mod]+1)) | p02684 |
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
ts = []
t = 0
for i in range(N):
ts.append(t)
t = As[t]-1
if t in ts:
break
d = ts.index(t)
p = i - d + 1
if K > d:
idx = (K - d) % p + d
else:
idx = K
print((ts[idx]+1))
| N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
tl = [0]
ts = {0}
t = 0
for i in range(N):
t = As[t]-1
if t in ts:
break
else:
tl.append(t)
ts.add(t)
d = tl.index(t)
p = i - d + 1
if K > d:
idx = (K - d) % p + d
else:
idx = K
print((tl[idx]+1))
| p02684 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
idx=1
li=[]
idx_li=[1]
flag=False
for i in range(k):
idx=a[idx-1]
if idx in idx_li:
flag=True
break
idx_li.append(idx)
if flag:
#non_loop=idx_li[:idx_li.index(idx)]
loop = idx_li[idx_li.index(idx):]
size=len(loop)
print((loop[(k-(len(idx_li)-len(loop)))%size]))
else:
print(idx) | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
idx=1
idx_li=[]
ord_=[-1]*n
flag=False
for i in range(k):
idx_li.append(idx)
ord_[idx-1]=1
idx=a[idx-1]
if ord_[idx-1]==1:
flag=True
break
if flag:
#non_loop=idx_li[:idx_li.index(idx)]
loop = idx_li[idx_li.index(idx):]
size=len(loop)
print((loop[(k-(len(idx_li)-len(loop)))%size]))
else:
print(idx) | p02684 |
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
path = [1]
for _ in range(N+10):
next_A = As[path[-1] - 1]
if next_A in path:
break
else:
path.append(next_A)
before_loop = path.index(next_A)
loop_len = len(path) - before_loop
if K <= before_loop:
print((path[K]))
else:
print((path[(K - before_loop) % loop_len + before_loop]))
| N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
appeared = [False] * N
appeared[0] = True
path = [1]
for _ in range(N+10):
next_A = As[path[-1] - 1]
if appeared[next_A-1]:
break
else:
path.append(next_A)
appeared[next_A-1] = True
before_loop = path.index(next_A)
loop_len = len(path) - before_loop
if K <= before_loop:
print((path[K]))
else:
print((path[(K - before_loop) % loop_len + before_loop])) | p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now=1
flg = 0
path = [1]
pathcheck ={1}
for i in range(k):
now = a[now-1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path)-1
x3 = (k-x1)%(x2-x1)
print((path[x1+x3])) | import sys
readline = sys.stdin.buffer.readline
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
now=1
flg = 0
path = [1]
pathcheck ={1}
for i in range(k):
now = a[now-1]
if now in pathcheck:
flg = -1
path.append(now)
break
path.append(now)
pathcheck.add(now)
if flg == 0:
print(now)
exit()
x1 = path.index(now)
x2 = len(path)-1
x3 = (k-x1)%(x2-x1)
print((path[x1+x3]))
if __name__ == '__main__':
main() | p02684 |
n, k = list(map(int, input().split()))
an = list(map(int, input().split()))
for i in range(n):
an[i] -= 1
import math
dv = []
dv.append(an)
K = k
N = n
for _ in range(1, int(math.log2(K)) + 1):
l = [0] * N
dv.append(l)
for k in range(1, int(math.log2(K)) + 1):
for n in range(N):
dv[k][n] = dv[k - 1][dv[k - 1][n]]
# N 回目を 2 ^ t で表すためにビット演算を用いる
# a : dv の何行目を用いるかを格納
a = []
for i in range(int(math.log2(K)) + 1):
if K >> i & 1:
a.append(i)
now = 0
for i in a:
now = dv[i][now]
print((now + 1))
| N, K = list(map(int, input().split()))
ai = list(map(int, input().split()))
for i in range(N):
ai[i] -= 1
import math
dv = []
dv.append(ai)
for k in range(1, int(math.log2(K)) + 1):
l = [0] * N
dv.append(l)
for n in range(N):
dv[k][n] = dv[k - 1][dv[k - 1][n]]
a = []
for i in range(int(math.log2(K)) + 1):
if K >> i & 1:
a.append(i)
now = 0
for i in a:
now = dv[i][now]
print((now + 1)) | p02684 |
N, K = list(map(int, input().split()))
ai = list(map(int, input().split()))
for i in range(N):
ai[i] -= 1
import math
dv = []
dv.append(ai)
for k in range(1, int(math.log2(K)) + 1):
l = [0] * N
dv.append(l)
for n in range(N):
dv[k][n] = dv[k - 1][dv[k - 1][n]]
a = []
for i in range(int(math.log2(K)) + 1):
if K >> i & 1:
a.append(i)
now = 0
for i in a:
now = dv[i][now]
print((now + 1)) | N, K = list(map(int, input().split()))
ai = list(map(int, input().split()))
for i in range(N):
ai[i] -= 1
import math
dv = []
dv.append(ai)
for k in range(1, int(math.log2(K)) + 1):
l = [0] * N
dv.append(l)
for n in range(N):
dv[k][n] = dv[k - 1][dv[k - 1][n]]
#a = []
now = 0
for i in range(int(math.log2(K)) + 1):
if K >> i & 1:
#a.append(i)
now = dv[i][now]
print((now + 1)) | p02684 |
import sys
input = sys.stdin.readline
from collections import *
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
log_size = 100
dp = [[0]*N for _ in range(log_size)]
for i in range(N):
dp[0][i] = A[i]-1
for i in range(1, log_size):
for j in range(N):
dp[i][j] = dp[i-1][dp[i-1][j]]
c = 0
cur = 0
while K>0:
if K&1:
cur = dp[c][cur]
c += 1
K >>= 1
print((cur+1)) | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
l = [0]
s = {0}
for i in range(K):
nex = A[l[-1]]-1
if nex in s:
for i in range(len(l)):
if l[i]==nex:
mark = i
break
t = len(l)-mark
print((l[mark+(K-mark)%t]+1))
exit()
l.append(nex)
s.add(nex)
print((nex+1)) | p02684 |
n,k = list(map(int,input().split()))
a = [0]+list(map(int,input().split()))
def bin(arr,val):
left,right = 0,len(arr)-1
while left<=right:
mid = (left+right)//2
if arr[mid]==val: return 1
elif arr[mid]<val: left = mid + 1
else: right = mid - 1
return 0
know = []
now = 1
while not bin(know, now):
know.append(now)
now = a[now]
start = a[know[-1]]
for i,num in enumerate(know):
if num == start: loop = know[i:] ; break
#print(know,start,loop)
if k < len(know):
ans = know[k]
else:
k -= len(know)
ans = loop[k%len(loop)]
print(ans)
| n,k = list(map(int,input().split()))
a = [0]+list(map(int,input().split()))
def bin(arr,val):
left,right = 0,len(arr)-1
while left<=right:
mid = (left+right)//2
if arr[mid]==val: return 1
elif arr[mid]<val: left = mid + 1
else: right = mid - 1
return 0
know = []
now = 1
while not bin(know, now):
know.append(now)
now = a[now]
start = a[know[-1]]
for i,num in enumerate(know):
if num == start: loop = know[i:] ; break
ans = know[k] if k<len(know) else loop[(k-len(know))%len(loop)]
print(ans)
| p02684 |
N, K = list(map(int, input().split()))
towns = list(map(int, input().split()))
towns.insert(0, -1)
p = 1
tmp_move, first_move, roop_move = [1], [], []
res = -1
while True:
if towns[p] in tmp_move:
roop_move = tmp_move[tmp_move.index(towns[p]):]
first_move = tmp_move[:tmp_move.index(towns[p])]
break
else:
tmp_move.append(towns[p])
p = towns[p]
if K < len(first_move):
res = first_move[K]
else:
index = (K - len(first_move)) % len(roop_move)
res = roop_move[index]
print(res) | N, K = list(map(int, input().split()))
towns = list(map(int, input().split()))
towns.insert(0, -1)
p = 1
tmp_move, first_move, roop_move = [1], [], []
visited = [False for _ in range(N + 1)]
res = -1
while not visited[p]:
visited[p] = True
tmp_move.append(towns[p])
p = towns[p]
index = tmp_move.index(p)
roop_move = tmp_move[index:-1]
first_move = tmp_move[:index]
if K < len(first_move):
res = first_move[K]
else:
index = (K - len(first_move)) % len(roop_move)
res = roop_move[index]
print(res) | p02684 |
import sys
input = sys.stdin.readline
from collections import Counter
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [i - 1 for i in a]
ac = Counter(a)
kaiten = [0] * n
for i1 in range(n):
if ac[i1] >= 1:
kikan = n
current = i1
count = 0
while kikan > 0:
current = a[current]
count += 1
if current == i1:
kaiten[i1] = count
break
kikan -= 1
#print(kaiten)
koko = 0
go = 0
while True:
go += 1
koko = a[koko]
if kaiten[koko] > 0:
break
remain_go = (k - go) % kaiten[koko]
while remain_go > 0:
koko = a[koko]
remain_go -= 1
print((koko + 1))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
a = [0]
ta = list(map(int, input().split()))
a += ta
kaiten = [0] * (n + 1)
count = 0
koko = 1
kaitenkikan = 0
while k > 0:
koko = a[koko]
count += 1
k -= 1
if kaiten[koko] > 0:
kaitenkikan = abs(count - kaiten[koko])
break
else:
kaiten[koko] = count
if k == 0:
print(koko)
sys.exit()
k_remain = k % kaitenkikan
if k_remain < 0:
k_remain += kaitenkikan
while k_remain > 0:
koko = a[koko]
k_remain -= 1
print(koko)
if __name__ == '__main__':
main()
| p02684 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
n, k, *a = list(map(int, read().split()))
cur_town = 0
transits = set()
tran_time = defaultdict(int)
cnt = 0
while True:
if k == 0:
print((cur_town + 1))
sys.exit()
if cur_town in transits:
break
else:
transits.add(cur_town)
tran_time[cur_town] = cnt
cur_town = a[cur_town] - 1
cnt += 1
k -= 1
k2 = k % (cnt - tran_time[cur_town])
while k2 > 0:
k2 -= 1
cur_town = a[cur_town] - 1
print((cur_town + 1))
if __name__ == '__main__':
main() | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
n, k, *a = list(map(int, read().split()))
cur_town = 0
tran_time = defaultdict(int)
cnt = 0
while True:
if k == 0:
print((cur_town + 1))
sys.exit()
if cur_town in tran_time:
break
else:
tran_time[cur_town] = cnt
cur_town = a[cur_town] - 1
cnt += 1
k -= 1
k2 = k % (cnt - tran_time[cur_town])
while k2 > 0:
k2 -= 1
cur_town = a[cur_town] - 1
print((cur_town + 1))
if __name__ == '__main__':
main() | p02684 |
n,k = [int(i) for i in input().split()]
data = [int(i) for i in input().split()]
d = 1
count = 0
loop = []
route = [-1] * n
data_len = len(data)
for i in range(data_len):
route[i] = d
d = data[d-1]
if d in route:
loop = route[route.index(d):route.index(-1)]
break
loop_len = len(loop)
if loop_len > 0:
a = len(route[:route.index(-1)]) - loop_len
if k < a:
print((route[k]))
else:
print((loop[(k-a)%loop_len]))
else:
print((route[k])) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
visited = [0]
for _ in range(n):
now = a[visited[-1]]-1
visited.append(now)
if k < n:
print((visited[k]+1))
else:
p = visited.index(visited[-1])
loop = visited[::-1][1:].index(visited[-1])+1
x = (k-p-1)%loop
print((visited[p+x+1]+1))
| p02684 |
def main():
N, K, *A = list(map(int, open(0).read().split()))
A = [0] + A
cur = 1
visited = [-1] * (N + 1)
visited[cur] = 0
for i in range(1, K + 1):
next = A[cur]
if cur == next:
print(next)
return
elif (j := visited[next]) != -1:
print((visited.index((K - j) % (i - j) + j)))
break
else:
visited[next] = visited[cur] + 1
cur = next
else:
print(next)
return
if __name__ == "__main__":
main()
| def main():
N, K, *A = list(map(int, open(0).read().split()))
A = [0] + A
cur_pos = 1
last_visit = [-1] * (N + 1)
last_visit[cur_pos] = 0
for i in range(1, K + 1):
nxt_pos = A[cur_pos]
if cur_pos == nxt_pos:
print(nxt_pos)
return
elif (j := last_visit[nxt_pos]) != -1:
print((last_visit.index((K - j) % (i - j) + j)))
return
else:
last_visit[nxt_pos] = last_visit[cur_pos] + 1
cur_pos = nxt_pos
print(cur_pos)
if __name__ == "__main__":
main()
| p02684 |
n, k = list(map(int, input().split()))
to = [0]
to += list(map(int, input().split()))
circle = [1]
st = -1
while True:
point = to[circle[-1]]
if point in circle:
st = point
break
circle.append(point)
l1 = circle.index(st)
l2 = len(circle) - l1
if k < l1:
print((circle[k]))
elif k < l1 + l2:
print((circle[k]))
else:
div = (k - l1) % l2
print((circle[l1+div])) | n, k = list(map(int, input().split()))
to = [0]
to += list(map(int, input().split()))
passed = [0] * (n + 1)
circle = [1]
st = -1
while True:
nx = to[circle[-1]]
if passed[nx] == 1:
st = nx
break
circle.append(nx)
passed[nx] = 1
l1 = circle.index(st)
l2 = len(circle) - l1
if k < l1:
print((circle[k]))
elif k < l1 + l2:
print((circle[k]))
else:
div = (k - l1) % l2
print((circle[l1+div])) | p02684 |
def calc(i, k):
ans_list = [i]
count = 1
i = a[i]
while (i not in ans_list) & (count < n):
ans_list.append(i)
count += 1
i = a[i]
index = ans_list.index(i)
ans_list.append(i)
return count, ans_list
n, k = list(map(int, input().split()))
a = [int(i) - 1 for i in input().split()]
count, ans_list = calc(0, k)
if count < k:
index = ans_list.index(ans_list[-1])
k = k - index
ans_list = ans_list[index + 1:]
print((ans_list[k % len(ans_list) - 1] + 1))
else:
print((ans_list[k] + 1)) | n, k = list(map(int, input().split()))
a = [int(i) - 1 for i in input().split()]
visit = {0}
tmp = 0
a_list = [0]
ans = True
for i in range(k):
tmp = a[tmp]
if tmp in visit:
left = a_list.index(tmp)
ans = False
print((a_list[left + (k - left) % (i + 1 - left)] + 1))
break
else:
visit.add(tmp)
a_list.append(tmp)
if ans:
print((tmp + 1)) | p02684 |
n,k = list(map(int,input().split()))
mp = list(map(int,input().split()))
save = []
s_queue = [[1,0]]
while(len(s_queue)>0):
i,cnt = s_queue.pop()
if(cnt==k):
break
if(mp[i-1] in save):
last=mp[i-1]
break
save.append(mp[i-1])
s_queue.append([mp[i-1],cnt+1])
ls = len(save)
if(k<=ls):
print((save[k-1]))
else:
for i in range(ls):
if(save[i]==last):
si = i
k -= si
save = save[si:]
ls = len(save)
amari = k%ls
print((save[amari-1]))
| n,k = list(map(int,input().split()))
mp = list(map(int,input().split()))
save = []
isSaved = [False]*(n+1)
s_queue = [[1,0]]
while(len(s_queue)>0):
i,cnt = s_queue.pop()
if(cnt==k):
break
if(isSaved[i]):
last=mp[i-1]
break
nexti = mp[i-1]
isSaved[i] = True
save.append(nexti)
s_queue.append([nexti,cnt+1])
ls = len(save)
if(k<=ls):
print((save[k-1]))
else:
for i in range(ls):
if(save[i]==last):
si = i
k -= si
save = save[si:]
ls = len(save)
amari = k%ls
print((save[amari-1]))
| p02684 |
n,k = list(map(int,input().split()))
mp = list(map(int,input().split()))
save = []
isSaved = [False]*(n+1)
s_queue = [[1,0]]
while(len(s_queue)>0):
i,cnt = s_queue.pop()
if(cnt==k):
break
if(isSaved[i]):
last=mp[i-1]
break
nexti = mp[i-1]
isSaved[i] = True
save.append(nexti)
s_queue.append([nexti,cnt+1])
ls = len(save)
if(k<=ls):
print((save[k-1]))
else:
for i in range(ls):
if(save[i]==last):
si = i
k -= si
save = save[si:]
ls = len(save)
amari = k%ls
print((save[amari-1]))
| n,k = list(map(int,input().split()))
A = [int(x)-1 for x in input().split()]
isSearched = [False]*n
isSearched[0] = True
ans = []
def f():
global k
now = 0
nex = A[0]
ans.append(now)
for i in range(k):
now = nex
ans.append(now)
isSearched[now] = True
nex = A[nex]
if(isSearched[nex]):
break
if((len(ans)-1)==k):
print((ans[-1]+1))
return
for i in range(len(ans)):
if(ans[i]==nex):
savei = i
k -= savei
mod = len(ans) - savei
print((ans[savei+k%mod]+1))
f() | p02684 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
start=1
list=[1]
kenti=[0 for i in range(n)]
kenti[0]=1
zan=-1
for i in range(k):
start-=1
next=a[start]
start=next
if kenti[start-1]!=0:
zan=k-(i+1)
inx=list.index(start)
list=list[inx:]
break
else:
list.append(start)
kenti[start-1]+=1
if zan==-1:
print((list[-1]))
exit()
elif zan==0:
print((list[0]))
exit()
#zan-=1
#print(list,zan)
zan%=len(list)
#print(zan)
'''
if zan==0:
print(list[-1])
else:
print(list[zan])
'''
print((list[zan])) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
start=1
list=[1]
kenti=[0 for i in range(n)]
kenti[0]=1
zan=-1
for i in range(k):
start-=1
next=a[start]
start=next
if kenti[start-1]!=0:
zan=k-(i+1)
inx=list.index(start)
list=list[inx:]
break
else:
list.append(start)
kenti[start-1]+=1
if zan==-1:
print((list[-1]))
exit()
elif zan==0:
print((list[0]))
exit()
zan%=len(list)
print((list[zan])) | p02684 |
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,k=nii()
a=lnii()
x=0
x_list=[1]
for i in range(k):
nx=a[x]
if nx in x_list:
inx=x_list.index(nx)
loop=x_list[inx:]
zan=k-i
q=zan%len(loop)
nx=loop[q-1]
break
else:
x=nx-1
x_list.append(nx)
print(nx) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,k=nii()
a=lnii()
x=0
x_list=[1]
x_table=[0 for i in range(n+1)]
x_table[1]=1
for i in range(k):
nx=a[x]
if x_table[nx]!=0:
inx=x_list.index(nx)
loop=x_list[inx:]
zan=k-i
q=zan%len(loop)
nx=loop[q-1]
break
else:
x=nx-1
x_list.append(nx)
x_table[nx]+=1
print(nx) | p02684 |
import sys
n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
vis=[0]
now=0
for i in range(1,k+1):
now=a[now]-1
if now in vis:
bgn=vis.index(now)
print((vis[bgn+((k-bgn)%(len(vis)-bgn))]+1))
sys.exit()
else:
vis.append(now)
print((vis[-1]+1)) | import sys
n,k=list(map(int,input().split()))
a=[int(x) for x in input().split()]
vis_ti=[-1]*n
vis_at=[0]
now=0
for i in range(1,k+1):
now=a[now]-1
if vis_ti[now]>=0:
bgn=vis_ti[now]
print((vis_at[bgn+(k-bgn)%(i-bgn)]+1))
sys.exit()
vis_ti[now]=i
vis_at.append(now)
print((vis_at[-1]+1))
| p02684 |
n, k = list(map(int, input().split()))
port = list(map(int, input().split()))
visited = [1]
current = 1
t = k
while port[current-1] not in visited and t > 0:
visited.append(port[current-1])
current = port[current-1]
t -= 1
if t > 0:
s = visited.index(port[current-1])
bubun = visited[s:]
g = (k-s) % len(bubun)
print((bubun[g]))
else:
print(current)
| n, k = list(map(int, input().split()))
port = list(map(int, input().split()))
visited = [1]
flag = [False for i in range(n)]
current = 1
t = k
while flag[port[current-1]-1] == False and t > 0:
visited.append(port[current-1])
flag[port[current-1]-1] = True
current = port[current-1]
t -= 1
if t > 0:
s = visited.index(port[current-1])
bubun = visited[s:]
g = (k-s) % len(bubun)
print((bubun[g]))
else:
print(current)
| p02684 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
genzaichi=1
rireki=[]
houmon=[0]*(N+1)
flag=0
for i in range(1,K+1):
genzaichi=A[genzaichi-1]
if genzaichi not in rireki:
houmon[genzaichi]=i
rireki.append(genzaichi)
else:
roop_from=genzaichi
x=houmon[roop_from]
roop=i-x
flag=1
break
if flag==0:
print(genzaichi)
else:
genzaichi=roop_from
K=(K-x)-((K-x)//roop)*roop
for i in range(K):
genzaichi=A[genzaichi-1]
print(genzaichi) | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
genzaichi=1
rireki=set()
houmon=[0]*(N+1)
flag=0
for i in range(1,K+1):
genzaichi=A[genzaichi-1]
if genzaichi not in rireki:
houmon[genzaichi]=i
rireki.add(genzaichi)
else:
roop_from=genzaichi
x=houmon[roop_from]
roop=i-x
flag=1
break
if flag==0:
print(genzaichi)
else:
genzaichi=roop_from
K=(K-x)-((K-x)//roop)*roop
for i in range(K):
genzaichi=A[genzaichi-1]
print(genzaichi) | p02684 |
def ma():
return list(map(int,input().split()))
y="Yes"
t="No"
n,k=ma()
A=list(ma())
ans=[]
now=1
while True:
ans.append(now)
now=A[now-1]
if now in ans:
use=ans.index(now)
tool=len(ans)-use
break
if use>=k:
print((ans[k]))
exit()
else:
p=(k-use)%tool
print((ans[use+p])) | def ma():
return list(map(int,input().split()))
def main():
n,k=ma()
A=list(ma())
ans=[]
exp=[0]*(n+1)
now=1
while True:
ans.append(now)
exp[now]=1
now=A[now-1]
if exp[now]==1:
use=ans.index(now)
tool=len(ans)-use
break
if use>=k:
print((ans[k]))
exit()
else:
p=(k-use)%tool
print((ans[use+p]))
main() | p02684 |
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
from_ = 1
way = []
way.append(1)
for i in range(K):
if(A[from_ - 1] in way):
way.append(A[from_ - 1])
break
else:
way.append(A[from_ - 1])
from_ = A[from_ - 1]
key_from = way.index(way[len(way) - 1])
key_to = len(way) - 1
if(K > key_from):
ans_loop = (K - key_from) % (key_to - key_from)
ans_num = key_from + ans_loop
print((way[ans_num]))
else:
print((way[K])) | N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
from_ = 1
way = []
way.append(1)
way_set = set([1])
for i in range(K):
s = A[from_ - 1]
if(s in way_set):
way.append(s)
break
else:
way.append(s)
way_set.add(s)
from_ = s
key_from = way.index(way[len(way) - 1])
key_to = len(way) - 1
if(K > key_from):
ans_loop = (K - key_from) % (key_to - key_from)
ans_num = key_from + ans_loop
print((way[ans_num]))
else:
print((way[K])) | p02684 |
N, K = list(map(int,input().split()))
ls_pass = [0]+list(map(int,input().split()))
a=1
b=0
c=0
d=0
ls_past=[1]
ls_cicle=[]
for i in range(1,N*3):
b=a
a=ls_pass[a]
if b==a:
print(a)
break
elif a in ls_past:
if c==0:
c=i
d=a
ls_cicle.append(d)
continue
elif a==d:
print((ls_cicle[(K-c)%(i-c)]))
break
else:
ls_cicle.append(a)
elif i==K:
print(a)
break
else:
ls_past.append(a) | N, K = list(map(int,input().split()))
ls_pass = [0]+list(map(int,input().split()))
a=1
b=0
ls=["ンゴ"]+[0]+["ンゴ"]*(N-1)
ls_past=[1]
for i in range(1,N*3):
b=a
a=ls_pass[a]
if ls[a]!="ンゴ":
ls_cicle=ls_past[ls[a]:i]
print((ls_cicle[(K-i)%len(ls_cicle)]))
break
elif i==K:
print(a)
break
else:
ls_past.append(a)
ls[a]=i | p02684 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
nw = 1
lp0 = [1]
for i in range(N):
nw = A[nw-1]
if nw in lp0:
break
else:
lp0.append(nw)
lpc = i+1 - lp0.index(nw)
lp = lp0[-lpc:]
if K<=len(lp0)-1:
print((lp0[K]))
else:
K-= len(lp0)-1
K=K%lpc - 1
print((lp[K]))
if __name__ == '__main__':
main()
| #!/usr/bin python3
# -*- coding: utf-8 -*-
import sys
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
nw = 1
lp0 = [1]
lpl = {1}
for i in range(N):
nw = A[nw-1]
if nw in lpl:
break
else:
lp0.append(nw)
lpl.add(nw)
lpc = i+1 - lp0.index(nw)
lp = lp0[-lpc:]
if K<=len(lp0)-1:
print((lp0[K]))
else:
K-= len(lp0)-1
K=K%lpc - 1
print((lp[K]))
if __name__ == '__main__':
main() | p02684 |
def parse():
N, K = list(map(int, input().split(" ")))
A = []
for a in input().split(" "):
A.append(int(a) - 1)
return N, K, A
def fast_pow(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
def fast_mod(x, N):
# return x % N
if N % 2 == 0:
return x & (N - 1)
else:
return x % N
def main():
N, K, A = parse()
# print(N, K, A)
# 移動
town = 0
route = [0]
loop_start_index = None
i = 0
for i in range(K):
# 次の町に移動
town = A[town]
if town in route:
# ループ検出
loop_start_index = route.index(town)
break
route.append(town)
if loop_start_index == None:
print((town + 1))
else:
loop_route = route[loop_start_index:]
# print(loop_route, K, i)
print((loop_route[(K - (i + 1)) % len(loop_route)] + 1))
# print(loop_route[])
# print(town)
exit(0)
# 経路の計算
route = []
next_town = A[0]
town = 0
while not (next_town in route): # 既出の町に行く場合
route.append(town)
next_town = A[town]
town = next_town
once_route = route[:route.index(next_town)]
loop_route = route[route.index(next_town):]
# print("once_route:", once_route)
# print("loop_route:", loop_route)
# print([town + 1 for town in route])
# print("K %% len(loop_route):", K % len(loop_route))
# print(route[K % len(loop_route) + len(once_route)] + 1)
if K >= len(route) and len(once_route) > 0:
# print("loop")
loop_K = K - len(route)
print((loop_route[fast_mod(loop_K, len(loop_route))] + 1))
# print(loop_route[loop_K % len(loop_route)] + 1)
else:
# print("normal")
# print(route[fast_mod(K, len(loop_route))] + 1)
# print("K:", K)
# print("K %% len(route):", K % len(route))
print((route[fast_mod(K, len(route))] + 1))
# print(route[K % len(route)] + 1)
if __name__ == "__main__":
main()
|
def parse():
N, K = list(map(int, input().split(" ")))
A = []
for a in input().split(" "):
A.append(int(a) - 1)
return N, K, A
def fast_pow(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
def fast_mod(x, N):
# return x % N
if N % 2 == 0:
return x & (N - 1)
else:
return x % N
def main():
N, K, A = parse()
# print(N, K, A)
# 移動
town = 0
route = [0]
loop_start_index = None
i = 0
visited = [False for i in range(N)]
visited[0] = True
for i in range(K):
# 次の町に移動
town = A[town]
if visited[town]:
# ループ検出
loop_start_index = route.index(town)
break
visited[town] = True
route.append(town)
if loop_start_index == None:
print((town + 1))
else:
loop_route = route[loop_start_index:]
# print(loop_route, K, i)
print((loop_route[(K - (i + 1)) % len(loop_route)] + 1))
# print(loop_route[])
# print(town)
exit(0)
# 経路の計算
route = []
next_town = A[0]
town = 0
while not (next_town in route): # 既出の町に行く場合
route.append(town)
next_town = A[town]
town = next_town
once_route = route[:route.index(next_town)]
loop_route = route[route.index(next_town):]
# print("once_route:", once_route)
# print("loop_route:", loop_route)
# print([town + 1 for town in route])
# print("K %% len(loop_route):", K % len(loop_route))
# print(route[K % len(loop_route) + len(once_route)] + 1)
if K >= len(route) and len(once_route) > 0:
# print("loop")
loop_K = K - len(route)
print((loop_route[fast_mod(loop_K, len(loop_route))] + 1))
# print(loop_route[loop_K % len(loop_route)] + 1)
else:
# print("normal")
# print(route[fast_mod(K, len(loop_route))] + 1)
# print("K:", K)
# print("K %% len(route):", K % len(route))
print((route[fast_mod(K, len(route))] + 1))
# print(route[K % len(route)] + 1)
if __name__ == "__main__":
main()
| p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
h = []
i = 0
s = 1
ans = 0
while i < k:
g = a[s-1]
if g not in h:
h.append(g)
s = g
i+=1
else:
c = h.index(g)
l = (k-1-c) % (i-c)
ans = h[c+l]
break
if ans == 0:
ans = h[-1]
print(ans) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = 1
g = 0
i = 1
history = [s]
flag = [False] * n
flag[0] = True
while True:
g = a[s-1]
if flag[g-1] == True:
break
else:
flag[g-1] = True
history.append(g)
s = g
i += 1
x = history.index(g)
if k < i:
ans = history[k]
else:
d = (k-x) % (i - x)
ans = history[x + d]
print(ans)
| p02684 |
def main():
n, k, *a = list(map(int, open(0).read().split()))
a = [0] + a
root = [1]
visited = [False for _ in range(n+1)]
nx = 1
visited[1] = True
step = 0
while True:
step += 1
now = nx
nx = a[now]
if step == k:
print(nx)
break
if visited[nx]:
end = step
start = root.index(nx)
d = end - start
r = k - step
index = start + r % d
print((root[index]))
break
visited[nx] = True
root.append(nx)
if __name__ == '__main__':
main()
| def main():
n, k, *a = list(map(int, open(0).read().split()))
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print((path[d]))
break
path.append(nx)
check[nx] = 1
nw = nx
if __name__ == '__main__':
main()
| p02684 |
def main():
n, k, *a = list(map(int, open(0).read().split()))
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print((path[d]))
break
path.append(nx)
check[nx] = 1
nw = nx
if __name__ == '__main__':
main()
| def main():
import sys
n, k, *a = list(map(int, sys.stdin.read().split()))
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print((path[d]))
break
path.append(nx)
check[nx] = 1
nw = nx
if __name__ == '__main__':
main()
| p02684 |
def main():
import sys
n, k, *a = list(map(int, sys.stdin.read().split()))
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print((path[d]))
break
path.append(nx)
check[nx] = 1
nw = nx
if __name__ == '__main__':
main()
| def main():
import sys
n, k, *a = list(map(int, sys.stdin.read().split()))
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while True:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print((path[d]))
break
path.append(nx)
check[nx] = True
nw = nx
if __name__ == '__main__':
main()
| p02684 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
route = [1]
dest = A[0]
while dest not in route:
route.append(dest)
dest = A[dest - 1]
ind = route.index(dest)
cycle = route[ind:]
if k >= ind:
ans = (k - ind) % len(cycle)
print((cycle[ans]))
else:
print((route[k])) | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
route = [1]
dest = A[0]
check = {i: False for i in range(n)}
while not check[dest - 1]:
check[dest - 1] = True
route.append(dest)
dest = A[dest - 1]
ind = route.index(dest)
cycle = route[ind:]
if k >= ind:
ans = (k - ind) % len(cycle)
print((cycle[ans]))
else:
print((route[k])) | p02684 |
n,k=list(map(int,input().split()))
a=[0]+list(map(int,input().split()))
MAX_N=2*10**5
b=[1]
visited=[-1]*(n+10)
for i in range(1,2*MAX_N+1):
nxt=a[b[-1]]
b.append(nxt)
if k<=n:
print((b[k]))
exit()
# print(b)
for i,bi in enumerate(b):
if visited[bi]==-1:
visited[bi]=i
else:
m=i-visited[bi]
l=visited[bi]
break
k=k%m
while k<n:
k+=m
print((b[k]))
| n,k,*a=list(map(int,open(0).read().split()))
now=1
if k<=n:
for i in range(k):
now=a[now-1]
print(now)
exit()
# 絶対ループする
visited=[False]*n
visited[now-1]=-1
for i in range(4*10**5):
now=a[now-1]
if visited[now-1]==False:
visited[now-1]=i
else:
c,d=visited[now-1],i
break
k=(k-c)%(d-c)+c
while k<n:
k+=(d-c)
now=1
for i in range(k):
now=a[now-1]
print(now) | p02684 |
#!/usr/bin/env python3
import itertools
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = [1]
if k > len(list(itertools.permutations(a))):
for i in range(k % n):
ans.append(a[ans[i] - 1])
print((a[-1]))
else:
for i in range(k):
ans.append(a[ans[i] - 1])
print((a[-2]))
| #!/usr/bin/env python3
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = [1]
loop_start = 0
loop = 0
for i in range(n):
ans.append(a[ans[i] - 1])
for j in ans:
if j in ans[:loop_start] or j in ans[loop_start+1:]:
break
loop_start += 1
loop = ans[loop_start+1:].index(j) + 1
ans.clear()
ans = [1]
if k < loop_start:
for l in range(k):
ans.append(a[ans[l] - 1])
print((ans[k]))
else:
for l in range(loop_start + loop):
ans.append(a[ans[l] - 1])
print((ans[((k-loop_start)%loop)+loop_start]))
| p02684 |
#!/usr/bin/env python3
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = [1]
loop_start = 0
loop = 0
for i in range(n):
ans.append(a[ans[i] - 1])
for j in ans:
if j in ans[:loop_start] or j in ans[loop_start+1:]:
break
loop_start += 1
loop = ans[loop_start+1:].index(j) + 1
ans.clear()
ans = [1]
if k < loop_start:
for l in range(k):
ans.append(a[ans[l] - 1])
print((ans[k]))
else:
for l in range(loop_start + loop):
ans.append(a[ans[l] - 1])
print((ans[((k-loop_start)%loop)+loop_start]))
| #!/usr/bin/env python3
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = [1]
c = 1
for i in range(n):
ans.append(a[ans[i] - 1])
b = ans.index(ans[n])
if k < b:
for l in range(k):
c = a[c - 1]
else:
for l in range((k-b)%(n-b)+b):
c = a[c - 1]
print(c)
| p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
memo = []
memo_cir = []
index = 0
flag = True
while flag:
if index in memo:
flag = False
else:
memo.append(index)
index = a[index] - 1
flag = False
for i_ in memo:
if i_ == index:
flag = True
if flag:
memo_cir.append(i_)
if k + 1 >= (len(memo) - len(memo_cir)):
k -= (len(memo) - len(memo_cir) - 1)
print((memo_cir[(k % len(memo_cir)) - 1] + 1))
else:
print((memo[k] + 1))
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
memo = []
memo_cir = []
visited = [False] * n
index = 0
flag = True
while flag:
if visited[index]:
flag = False
else:
memo.append(index)
visited[index] = True
index = a[index] - 1
flag = False
for i_ in memo:
if i_ == index:
flag = True
if flag:
memo_cir.append(i_)
if k + 1 >= (len(memo) - len(memo_cir)):
k -= (len(memo) - len(memo_cir) - 1)
print((memo_cir[(k % len(memo_cir)) - 1] + 1))
else:
print((memo[k] + 1))
| p02684 |
N, K = list(map(int, input().split()))
a = [i - 1 for i in list(map(int, input().split()))]
logK = 1
while ((1 << logK) < K):
logK += 1
doubling = [[-1 for _ in range(N)] for _ in range(logK)]
for i in range(N):
doubling[0][i] = a[i]
for i in range(logK - 1):
for j in range(N):
doubling[i + 1][j] = doubling[i][doubling[i][j]]
now, i = 0, 0
while K > 0:
if (K & 1):
now = doubling[i][now]
K = K >> 1
i += 1
print((now + 1))
| N, K = list(map(int, input().split()))
a = [i - 1 for i in list(map(int, input().split()))]
logK = K.bit_length()
doubling = [[-1 for _ in range(N)] for _ in range(logK)]
for i in range(N):
doubling[0][i] = a[i]
for i in range(logK - 1):
for j in range(N):
doubling[i + 1][j] = doubling[i][doubling[i][j]]
now, i = 0, 0
while K > 0:
if (K & 1):
now = doubling[i][now]
K = K >> 1
i += 1
print((now + 1))
| p02684 |
n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
cheak = [0] * (2*(10**5) + 1)
point = 1
dev = [1]
flag = 0
for i in range(1, k + 1):
if cheak[point]:
loop = i -cheak[point]
pre_loop = cheak[point]
flag = 1
break
else:
cheak[point] = i
point = a[point]
dev.append(point)
if flag:
rest = (k + 1- pre_loop) % loop
for j in range(rest):
point = a[point]
dev.append(point)
print(point) | n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
cheak = [0] * (2*(10**5) + 1)
point = 1
dev = [1]
flag = 0
for i in range(1, k + 1):
if cheak[point]:
loop = i -cheak[point]
pre_loop = cheak[point]
flag = 1
break
else:
cheak[point] = i
point = a[point]
#dev.append(point)
if flag:
rest = (k + 1- pre_loop) % loop
for j in range(rest):
point = a[point]
#dev.append(point)
print(point) | p02684 |
N, K = list(map(int, input().split()))
A_list = list(map(int, input().split()))
place = [0]
while True:
next_place = A_list[place[-1]] - 1
if next_place in place:
idx = place.index(next_place)
loop = place[idx:]
break
place.append(next_place)
if K < len(place):
print((place[K] + 1))
else:
print((loop[(K-idx)%len(loop)] + 1)) | N, K = list(map(int, input().split()))
A_list = list(map(int, input().split()))
place = [0]
table = [0] * N
table[0] = 1
while True:
next_place = A_list[place[-1]] - 1
if table[next_place] == 1:
idx = place.index(next_place)
loop = place[idx:]
break
table[next_place] = 1
place.append(next_place)
if K < len(place):
print((place[K] + 1))
else:
print((loop[(K-idx)%len(loop)] + 1)) | p02684 |
n,k = list(map(int, input().split()))
A = tuple(map(int,input().split()))
import sys
sys.setrecursionlimit(1000000000)
from collections import deque
seen = [0 for i in range(n)]
hist = deque([]) # 頂点の訪問履歴
pos = -1 # サイクルの1成分 -1はサイクル未発見
def dfs(x, p): # pはxの親
global pos # global!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
seen[x] = 1
hist.append(x) # 訪れたらhistにappend
if seen[A[x]-1] == 1:
pos = A[x]-1
return # サイクルを発見したら、即すべてのdfsを終える
# 残りはseen[x]=0のみ
dfs(A[x]-1, x)
if pos != -1: return # 帰りがけ、サイクルが検出済みなら何もしない
hist.pop() # stackの末尾を消す
# ループなく平和に終わったらpopできる
return # まあなくてもいいけどreturnは終了であることを強調
dfs(0, -1)
# この状態だと、サイクルに入る前に通った枝葉がhistに入ってる。
# 枝葉が終わったら、posからループの順番に頂点番号が入ってる。
cycle = []
while hist:
qwe = hist.pop()
cycle.append(qwe)
if qwe == pos: break
roop = len(cycle)
sen = seen.count(1)
if k<=n:
no = 0
for i in range(k):
no = A[no]-1
print((no+1))
else:
tmp = k-sen+roop
tmp%=roop
print((cycle[-tmp-1]+1))
| n,k = list(map(int ,input().split()))
A = tuple(map(int, input().split()))
seen = [-1]*n
tmp = 0
count = 0
while True:
tmp = A[tmp]-1
count +=1
if seen[tmp] != -1:
seennum = seen.count(1)
tm = tmp
se = [-1]*n
roopmem = []
while True:
if se[tm] != -1:
roop = se.count(1)
break
else:
roopmem.append(tm)
se[tm] = 1
tm = A[tm] - 1
break
else:
seen[tmp] = 1
if k<=n:
no = 0
for i in range(k):
no = A[no]-1
print((no+1))
else:
tmp = k-seennum
tmp %= roop
print((roopmem[tmp-1]+1))
| p02684 |
N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
l = [1]
now_town = 1
loop_town = 0
for i in range(N):
now_town = A[now_town-1]
if now_town in l:
loop_town = l.index(now_town)
break
else:
l.append(now_town)
loop_num = len(l)-loop_town
if K > loop_town:
num = (K - loop_town)%loop_num + loop_town
else:
num = K
#
# num = (K+1)%len(l)
# print(l)
print((l[num])) | N,K = list(map(int,input().split()))
A = list(map(int, input().split()))
l = [1]
kanryou_town = [0]*(N+1)
kanryou_town[1] = 1
now_town = 1
loop_town = 0
for i in range(N):
now_town = A[now_town-1]
if kanryou_town[now_town] == 1:
loop_town = l.index(now_town)
break
else:
kanryou_town[now_town] = 1
l.append(now_town)
loop_num = len(l)-loop_town
if K > loop_town:
num = (K - loop_town)%loop_num + loop_town
else:
num = K
#
# num = (K+1)%len(l)
# print(l)
print((l[num])) | p02684 |
data = input().split()
N, k = int(data[0]), int(data[1])
tab = []
data = input().split()
for i in range(N):
tab.append(int(data[i]) - 1)
parcour = []
position = 0
while (not (position in parcour)):
parcour.append(position)
position = tab[position]
i = 0
while parcour[i] != position:
i+= 1
sizeCycle = len(parcour) - i
#print (parcour)
if (k < len(parcour)):
print((parcour[k] + 1))
else:
print((parcour[i + ((k - i) % sizeCycle)] + 1))
|
data = input().split()
N, k = int(data[0]), int(data[1])
tab = []
data = input().split()
for i in range(N):
tab.append(int(data[i]) - 1)
parcour = []
tmp = [0] * N
position = 0
while (tmp[position] == 0):
parcour.append(position)
tmp[position] = 1
position = tab[position]
i = 0
while parcour[i] != position:
i+= 1
sizeCycle = len(parcour) - i
#print (parcour)
if (k < len(parcour)):
print((parcour[k] + 1))
else:
print((parcour[i + ((k - i) % sizeCycle)] + 1))
| p02684 |
n,k = list(map(int,input().split()))
L = list(map(int,input().split()))
X = [0]*(n+1)
X[0] = 1
for i in range(n):
if L[X[i]-1] in X:
X[i+1] = L[X[i]-1]
break
X[i+1] = L[X[i]-1]
def f(lst,value):
return [i for i,x in enumerate(lst) if x == value]
for x in X:
if X.count(x) == 2:
a = f(X,x)
X_ans = X[a[0]:a[1]]
break
if k <= a[0]:
print((X[k]))
else:
b = (k - a[0] + 1) % (a[1]-a[0])
print((X_ans[b-1]))
| n,k = list(map(int,input().split()))
lst = list(map(int,input().split()))
loop = []
mark = ['t'] *n
i = 0
loop.append(1)
mark[0] = 0
while True:
if mark[lst[i]-1] != 't':
start = mark[lst[i]-1]
last = mark[i]
break
else:
mark[lst[i]-1] = mark[i] + 1
loop.append(lst[i])
i = lst[i]-1
loop_len = last - start +1
loop_num = loop[start:last+1]
first = start-1
if k <= first:
print((loop[k]))
else:
q = (k-first) % loop_len
print((loop_num[q-1]))
| p02684 |
def roop(now, a_list):
return a_list[now-1]
if __name__ == '__main__':
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
now = 1
check = [1]
for i in range(k):
now = roop(now, a_list)
if now not in check:
check.append(now)
else:
break
point = (check.index(now))
roop_len = len(check) - point
if k <= len(check):
print((check[k]))
else:
k_ = k - point
point_ = k_ % roop_len
print((check[point+point_])) | if __name__ == '__main__':
n, k = list(map(int, input().split()))
a_list = list(map(int, input().split()))
now = 1
check = [0] * n
check[0] = 1
move = [1]
for i in range(k):
now = a_list[now-1]
move.append(now)
if check[now-1] == 0:
check[now-1] = 1
else:
break
point = (move.index(now))
roop_len = sum(check) - point
if k <= sum(check):
print((move[k]))
else:
k_ = k - point
point_ = k_ % roop_len
print((move[point+point_])) | p02684 |
import sys
input = lambda: sys.stdin.readline()
def cin_int_list():
return [int(x) for x in input().split()]
def cin_int_iter():
return (int(x) for x in input().split())
def cin_int():
return int(eval(input()))
def cout_int_iter(a):
print((' '.join(map(str, a))))
def iota(n, start=0):
return list(range(start, n))
def cin_digits_list():
return [ord(x) - ord('0') for x in eval(input())]
def main():
n, k = cin_int_iter()
g = {}
cycle_starts = None
for u, x in enumerate(cin_int_list()):
v = x - 1
g[u] = v
if v in g:
cycle_starts = v
if cycle_starts is not None:
cycle_len = 0
u = cycle_starts
cycle = []
while True:
cycle.append(u)
u = g[u]
if u == cycle_starts:
break
before_cycle = []
u = 0
while u != cycle_starts:
before_cycle.append(u)
u = g[u]
if k < len(before_cycle):
print((before_cycle[k] + 1))
return
if before_cycle:
k -= len(before_cycle)
print((cycle[k % len(cycle)] + 1))
return
u = 0
while k:
u = g[u]
k -= 1
print((u + 1))
main()
"""
6 1
6 5 2 5 3 2
6 2
6 5 2 5 3 2
6 3
6 5 2 5 3 2
6 4
6 5 2 5 3 2
6 6
6 5 2 5 3 2
6 5
6 5 2 5 3 2
no cycle
4 1
2 3 4 5
4 111111111111111111
2 3 4 1
""" | import sys
input = lambda: sys.stdin.readline()
def cin_int_list():
return [int(x) for x in input().split()]
def cin_int_iter():
return (int(x) for x in input().split())
def cin_int():
return int(eval(input()))
def cout_int_iter(a):
print((' '.join(map(str, a))))
def iota(n, start=0):
return list(range(start, n))
def cin_digits_list():
return [ord(x) - ord('0') for x in eval(input())]
def main():
n, k = cin_int_iter()
g = {}
for u, x in enumerate(cin_int_list()):
v = x - 1
g[u] = v
visited = set()
u = 0
while u not in visited:
visited.add(u)
u = g[u]
cycle_starts = u
u = cycle_starts
cycle = []
while True:
cycle.append(u)
u = g[u]
if u == cycle_starts:
break
before_cycle = []
u = 0
while u != cycle_starts:
before_cycle.append(u)
u = g[u]
if k < len(before_cycle):
print((before_cycle[k] + 1))
return
if before_cycle:
k -= len(before_cycle)
print((cycle[k % len(cycle)] + 1))
main()
"""
6 1
6 5 2 5 3 2
6 2
6 5 2 5 3 2
6 3
6 5 2 5 3 2
6 4
6 5 2 5 3 2
6 6
6 5 2 5 3 2
6 5
6 5 2 5 3 2
no cycle
4 1
2 3 4 5
4 111111111111111111
2 3 4 1
1 111111111111111111
1
2 1999999999999999999
2 1
3 99999999999999999999
2 3 2
3 99999999999999999999
2 3 4
""" | p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
towns = [0] * n
i = 0
cnt = 1
towns[0] = cnt
nums = [1]
while True:
cnt += 1
i = a[i] - 1
if towns[i] == 0:
towns[i] = cnt
nums.append(i + 1)
else:
s_loop = nums.index(i + 1)
m = len(nums)
l = m - s_loop
break
if k < len(nums):
print((nums[k]))
else:
k -= m - 1
k = (k - 1) % l
print((nums[s_loop + k])) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
flag = [0] * n
i = 0
loop = [1]
while True:
i = a[i] - 1
if flag[i] == 0:
flag[i] = 1
loop.append(i + 1)
else:
start = loop.index(i + 1)
m = len(loop)
length = m - start
break
if k < m:
print((loop[k]))
else:
k -= m - 1
k = (k - 1) % length
print((loop[start + k])) | p02684 |
n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
for i in range(n):
arr[i]-=1
flag=format(k,'b')
flag=flag[::-1]
pos=0
for i in range(len(flag)):
if flag[i]=='1':
pos=arr[pos]
tmp=[]
for j in range(n):
tmp.append(arr[arr[j]])
arr=tmp
print((pos+1)) | n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
l=[-1]*(n+1)
tmp=[]
pos=1
cnt=0
while 1:
if l[pos]!=-1:
t=cnt-l[pos]
if k<cnt:
print((tmp[k]))
else:
print((tmp[l[pos]+(k-cnt)%t]))
break
l[pos]=cnt
cnt+=1
tmp.append(pos)
pos=arr[pos-1] | p02684 |
# -*- coding: utf-8 -*-
import sys
(N, K) = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
# 一周する数を求める
have_been = [1]
now_place = 1
while True:
next_place = A[now_place - 1]
if next_place not in have_been:
have_been.append(next_place)
now_place = next_place
else:
break
#print('have_been = {}'.format(have_been))
loop_start_index = have_been.index(next_place)
loop = have_been[loop_start_index:]
#print('loop = {}'.format(loop))
left_K = K - loop_start_index
if left_K <= 0:
print((have_been[K]))
sys.exit()
mod = left_K % len(loop)
print((have_been[mod + loop_start_index])) | # -*- coding: utf-8 -*-
import sys
(N, K) = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
# 一周する数を求める
have_been = set()
have_been_list = []
have_been.add(1)
have_been_list.append(1)
now_place = 1
while True:
next_place = A[now_place - 1]
if next_place not in have_been:
have_been.add(next_place)
have_been_list.append(next_place)
now_place = next_place
else:
break
#print('have_been = {}'.format(have_been))
loop_start_index = have_been_list.index(next_place)
loop_length = len(have_been_list) - loop_start_index
#print('loop = {}'.format(loop))
left_K = K - loop_start_index
if left_K <= 0:
print((have_been_list[K]))
sys.exit()
mod = left_K % loop_length
print((have_been_list[mod + loop_start_index])) | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
index = 1
route = [index]
node = [index]
for i in range(1, K + 1):
index = A[index - 1]
if index in node:
pre = route.index(index)
loop = len(route)
route_idx = (K - pre) % (loop - pre) + pre
print((route[route_idx]))
break
else:
route.append(index)
node.append(index)
else:
print(index) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
index = 1
route = [index]
node = {index}
for i in range(1, K + 1):
index = A[index - 1]
if index in node:
pre = route.index(index)
loop = len(route)
route_idx = (K - pre) % (loop - pre) + pre
print((route[route_idx]))
break
else:
route.append(index)
node.add(index)
else:
print(index) | p02684 |
import array
n, k = list(map(int, input().split()))
tel = array.array('i', list(map(int, input().split())))
log = array.array('i', [1])
end = True
while(end):
log.append(tel[log[-1] - 1])
for i in range(len(log) - 1):
if(log[i] == log[-1]):
star = i
mod = len(log) - star - 1
end = False
if(k < len(log)):
print((log[k]))
else:
print((log[(k - star) % mod + star]))
| n, k = list(map(int, input().split()))
tel = list(map(int, input().split()))
log = [1]
record = [0] * n
while(True):
log.append(tel[log[-1] - 1])
if(record[log[-1] - 1] == 1):
break
record[log[-1] - 1] += 1
for i in range(len(log) - 1):
if(log[i] == log[-1]):
star = i
mod = len(log) - star - 1
break
if(k < len(log)):
print((log[k]))
else:
print((log[(k - star) % mod + star])) | p02684 |
import bisect
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
seen = []
seen_sort = [1]
start = 1
while True:
tmp = a[start - 1]
seen.append(start)
index = bisect.bisect_left(seen_sort, tmp)
if index >= len(seen_sort) or seen_sort[index] != tmp:
seen_sort.insert(index, tmp)
else:
repeat_index = seen.index(tmp)
repeat_len = len(seen) - repeat_index
break
start = tmp
if k <= repeat_index:
print((seen[k]))
else:
print((seen[repeat_index + ((k - repeat_index) % repeat_len)])) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
visited = []
visited_index = [-1] * n
pre = 0
while visited_index[pre] == -1:
now = a[pre]
visited.append(pre)
visited_index[pre] = len(visited)
pre = now - 1
loop = len(visited) - visited_index[pre] + 1
head = visited_index[pre] - 1
if k < head:
print((visited[k] + 1))
else:
k -= head
k %= loop
print((visited[head + k] + 1)) | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
zumi = [-1]*(2*(10**5))
ima = 1
for i in range(K):
# 行ったことある町を通る＝ループする
if ima in zumi:
zumi[i] = ima
break
# 同じ町へテレポートしている
if ima == A[ima-1]:
print(ima)
exit(0)
zumi[i] = ima
ima = A[ima-1]
else:
print(ima)
exit(0)
loop_e = zumi.index(-1)
loop_s = zumi.index(zumi[loop_e-1])
zan_loop = K-loop_s
loop = zumi[loop_s:loop_e-1]
amari = zan_loop % (len(loop))
print((loop[amari]))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
zumi_hash = {}
zumi = [-1]*(2*(10**5))
ima = 1
for i in range(K):
# 行ったことある町を通る＝ループする
if ima in zumi_hash:
zumi[i] = ima
break
# 同じ町へテレポートしている
if ima == A[ima-1]:
print(ima)
exit(0)
zumi_hash[ima] = True
zumi[i] = ima
ima = A[ima-1]
else:
print(ima)
exit(0)
loop_e = zumi.index(-1)
loop_s = zumi.index(zumi[loop_e-1])
zan_loop = K-loop_s
loop = zumi[loop_s:loop_e-1]
amari = zan_loop % (len(loop))
print((loop[amari]))
| p02684 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
loc = 1
loclog=[1]
flag = 0
for i in range(K):
loc = A[loc-1]
if loc in loclog:
roopstart = loclog.index(loc)
roopend = len(loclog)
flag = 1
break
loclog.append(loc)
if flag == 0:
ans = loc
else:
roopidx = (K+1-roopstart)%(roopend-roopstart)
if roopidx == 0:
ans = loclog[roopend-1]
else:
ans = loclog[roopstart+roopidx-1]
print(ans) | N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
loc = 1
loclog=[1]
flag = 0
hist = [0]*N
for i in range(K):
hist[loc-1] = 1
loc = A[loc-1]
if hist[loc-1] != 0:
roopstart = loclog.index(loc)
roopend = len(loclog)
flag = 1
break
loclog.append(loc)
if flag == 0:
ans = loc
else:
roopidx = (K+1-roopstart)%(roopend-roopstart)
if roopidx == 0:
ans = loclog[roopend-1]
else:
ans = loclog[roopstart+roopidx-1]
print(ans) | p02684 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dict={}
for i in range(n):
dict[i]=a[i]-1 #i番目の町からどこにつくか
tmp=0#現在知
num2city={}
city2num={}
city2num[0]=0#どのまちが何回目か
num2city[0]=0#j回目にどこにいるか
for j in range(1,k+1):
if tmp==dict[tmp]:
break
tmp=dict[tmp]#現在地更新
if tmp not in list(num2city.values()):#現在地がまだきたことない
num2city[j]=tmp
city2num[tmp]=j
else:
mae=city2num[tmp]
term=j-mae
res=k-j
r=res%term
# print(mae,term,res,r,mae+r,num2city[mae+r])
tmp=num2city[mae+r]
# print(tmp)
break
# print(tmp+1)
#print(num2city)
#print(city2num)
print((tmp+1))
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dict={}
for i in range(n):
dict[i]=a[i]-1 #i番目の町からどこにつくか
tmp=0#現在知
num2city={}
city2num={}
city2num[0]=0#どのまちが何回目か
num2city[0]=0#j回目にどこにいるか
alre=[-1]*n
alre[0]=1
for j in range(1,k+1):
if tmp==dict[tmp]:
break
tmp=dict[tmp]#現在地更新
if alre[tmp]==-1:#tmp not in num2city.values():#現在地がまだきたことない
alre[tmp]=1
num2city[j]=tmp
city2num[tmp]=j
else:
mae=city2num[tmp]
term=j-mae
res=k-j
r=res%term
# print(mae,term,res,r,mae+r,num2city[mae+r])
tmp=num2city[mae+r]
# print(tmp)
break
# print(tmp+1)
#print(num2city)
#print(city2num)
print((tmp+1))
| p02684 |
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
s = [-1] * n
c = [1]
t = 0
now = 0
while s[now] == -1:
s[now] = t
now = a[now] - 1
c.append(now+1)
t += 1
start_cycle = c.index(c[-1])
loop = c[start_cycle:-1]
cycle = len(loop)
if k < start_cycle:
print((c[k]))
else:
k -= start_cycle
k %= cycle
print((loop[k])) | n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
s = [False] * n
c = [1]
now = 0
while not s[now]:
s[now] = True
now = a[now] - 1
c.append(now+1)
start_cycle = c.index(c[-1])
loop = c[start_cycle:-1]
cycle = len(loop)
if k < start_cycle:
print((c[k]))
else:
k -= start_cycle
k %= cycle
print((loop[k])) | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
current = 1
path = [1]
while K > 0:
if A[current - 1] in path:
loop = path[path.index(A[current - 1]):]
path += [loop[(K-1) % len(loop)]]
break
path += [A[current - 1]]
current = A[current - 1]
K -= 1
print((path[-1]))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
current = 1
path = [1]
already = [False] * len(A)
while K > 0:
if already[current - 1]:
loop = path[path.index(A[current - 1]):]
current = loop[(K - 1) % len(loop)]
break
path += [A[current - 1]]
already[current - 1] = True
current = A[current - 1]
K -= 1
print(current)
| p02684 |
n,k=list(map(int,input().split()))
a=list([int(x)-1 for x in input().split()])
town=[0]
i=0
while True:
idx=town[-1]
if a[idx] in town:
s=a[idx]
i+=1
break
else:
i+=1
town.append(a[idx])
if i!=n:
idp=town.index(s)
chain=len(town[:idp])
cycle=len(town[idp:])
if k<=chain:
print((town[k]+1))
else:
p=(k-chain)%cycle + chain
print((town[p]+1))
else:
print((town[k%n]+1)) | n,k=list(map(int,input().split()))
a=list([int(x)-1 for x in input().split()])
town=[0]
set={0}
i=0
while True:
idx=town[-1]
if a[idx] in set:
s=a[idx]
i+=1
break
else:
i+=1
town.append(a[idx])
set.add(a[idx])
if i!=n:
idp=town.index(s)
chain=len(town[:idp])
cycle=len(town[idp:])
if k<=chain:
print((town[k]+1))
else:
p=(k-chain)%cycle + chain
print((town[p]+1))
else:
print((town[k%n]+1)) | p02684 |
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
import bisect
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False
def main():
n,k=ints()
a=ints()
passed=[]
flg=0
p=0
while flg==0:
if p in passed:
flg=1
s=passed.index(p)
break
else:
passed.append(p)
p=a[p]-1
l=len(passed)
if k<l:
print(passed[k]+1)
else:
print(passed[(k-s)%(l-s)+s]+1)
if __name__ == '__main__':
main()
| import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
import bisect
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False
def main():
n,k=ints()
a=ints()
passed=[]
flg=0
p=0
while flg==0:
if a[p] == 'passed':
flg=1
s=passed.index(p)
break
else:
passed.append(p)
pp=p
p=a[pp]-1
a[pp]='passed'
l=len(passed)
if k<l:
print(passed[k]+1)
else:
print(passed[(k-s)%(l-s)+s]+1)
if __name__ == '__main__':
main()
| p02684 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K=list(map(int,readline().split()))
A=list([int(x)-1 for x in readline().split()])
visited=[True]*N
visitednum=[]
now=0
cnt=0
while True:
if visited[now]==False:
break
else:
visited[now]=False
visitednum.append(now)
now=A[now]
cnt+=1
loop=[]
while True:
if now in loop:
break
loop.append(now)
now=A[now]
if K<cnt:
print((visitednum[K]+1))
else:
t=(K-(len(visitednum)+len(loop)))%len(loop)
print((loop[t]+1)) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
num = 1
li = [1]
flag = [True] * n
flag[0] = False
for i in range(k):
num = a[num-1]
if flag[num-1]:
li.append(num)
flag[num-1] = False
else:
break
d = li.index(num)
ans = (k-d)%(len(li)-d)+d
print((li[ans])) | p02684 |
def ans(n, k, list_a):
i=0
list_memo=[1]
while i<k:
next = list_a[list_memo[i]-1]
if next not in list_memo:
list_memo.append(next)
else:
num=list_memo.index(next)
len_list=len(list_memo)
i+=1
x = len_list-num
k=k-num
#print(k)
k%=x
return list_memo[num+k]
#return 50000
i+=1
return list_memo[i]
n, k = (int(x) for x in input().split())
list_a = list(map(int, input().split()))
print((ans(n, k, list_a))) | def ans(n, k, list_a):
i=0
dic={}
dic[1]=1
list_memo=[1]
while i<k:
next = list_a[list_memo[i]-1]
if next not in dic:
list_memo.append(next)
dic[next]=1
else:
num=list_memo.index(next)
len_list=len(list_memo)
i+=1
x = len_list-num
k=k-num
#print(k)
k%=x
return list_memo[num+k]
#return 50000
i+=1
return list_memo[i]
n, k = (int(x) for x in input().split())
list_a = list(map(int, input().split()))
print((ans(n, k, list_a))) | p02684 |
n, k = list(map(int, input().split()))
A=list(map(int, input().split()))
c=1
path=[]
d={}
l=0
while l<=k:
if c in path:
p=d[c]
#print(p, path)
pattern_l = l-p
k-=((k-p)//pattern_l)*pattern_l
path.append(c)
l+=1
d[c]=l-1
c=A[c-1]
print((path[k]))
| n, k = list(map(int, input().split()))
A=list(map(int, input().split()))
c=1
path=[]
d={}
l=0
while l<=k:
if c in d:
p=d[c]
#print(p, path)
pattern_l = l-p
k-=((k-p)//pattern_l)*pattern_l
path.append(c)
l+=1
d[c]=l-1
c=A[c-1]
print((path[k]))
| p02684 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
cnt=0
s=1
M=[0]
B=[0]*(n+1)
while cnt<n:
s=A[s-1]
if B[s-1]==0:
B[s-1]+=1
else:
imp=s-1
break
M.append(s-1)
cnt+=1
x=M.index(imp)
y=len(M)-x
if k<=x:
print((M[k]+1))
else:
N=M[x:]
print((N[(k-x)%y]+1)) | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
cnt=0
s=1
M=[0]
B=[False]*(n+1)
while cnt<n:
s=A[s-1]
if not B[s-1]:
B[s-1]=True
else:
break
M.append(s-1)
cnt+=1
x=M.index(s-1)
y=len(M)-x
if k<=x:
print((M[k]+1))
else:
N=M[x:]
print((N[(k-x)%y]+1)) | p02684 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.