input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
route = [1]
index = k
for i in range(n+1):
_next = a[route[-1]]
if _next in route:
route.append(_next)
index -= (i+1)
brea... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
route = [1]
index = k
hit = set([1])
for i in range(n+1):
_next = a[route[-1]]
if _next in hit:
route.append(_next)
index -= (i+1)... | p02684 |
#!/usr/bin/env python3
import math
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
dv = []
... | #!/usr/bin/env python3
import math
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
dv = []
... | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
v = []
now = 0
for i in range(K):
p = A[now]
now = p-1
if p in v:
j = v.index(p)
df = i-j
Kn = (K-i-1) % df
p = v[j+Kn]
break
else:
v.append(p)
print(p) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
v = []
w = {}
now = 0
for i in range(K):
p = A[now]
now = p-1
if p in w:
j = v.index(p)
df = i-j
Kn = (K-i-1) % df
p = v[j+Kn]
break
else:
v.append(p)
w[p] = p
print(p) | p02684 |
n, k = list(map(int, input().split()))
L= list(map(int, input().split()))
S=[]
S.append(1)
p=0
cnt=0
for i in range(n):
if L[p] in S:
cnt+=1
S.append(L[p])
break
else:
cnt+=1
S.append(L[p])
p=L[p]-1
cnt2=0
for i in range(n):
if S[i]!=L[p]:
cnt2+=1
else:
S2=S[i:]
break
loop=... | n, k = list(map(int, input().split()))
L= list(map(int, input().split()))
S=[]
S.append(1)
Q=set()
Q.add(1)
p=0
cnt=0
for i in range(n):
if L[p] in Q:
cnt+=1
S.append(L[p])
break
else:
cnt+=1
S.append(L[p])
Q.add(L[p])
p=L[p]-1
cnt2=0
for i in range(n):
if S[i]!=L[p]:
cnt2+=1
... | p02684 |
import sys
def input():
return sys.stdin.readline().strip()
N, K = list(map(int, input().split()))
k_bitlen = K.bit_length()
dp = [[0] * N for _ in range(k_bitlen + 1)]
dp[0] = list([int(x) - 1 for x in input().split()])
for k in range(k_bitlen):
for i in range(N):
dp[k + 1][i] = dp[k... | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(v):
path.append(v)
visited[v] = 1
nv = A[v]
if visited[nv] == 1:
return nv
return dfs(nv)
N, K = list(map(int, input().split()))
A = list([int(x) - 1 for x in input().split()])
visited = [0] * N
path = []
cycle_start ... | p02684 |
import sys
from collections import deque
N, K = list(map(int, input().split()))
graph = {}
count = 1
for value in input().split():
graph[count] = int(value)
count += 1
queue = deque()
queue.append(1)
now_pos = 1
start = 0
for i in range(N + 1):
next_pos = graph[now_pos]
if not next... | import sys
import time
N, K = list(map(int, input().split()))
town_list = list(map(int, input().split()))
queue = {}
start = -1
count = 1
now_town = 1
for i in range(K):
if town_list[now_town - 1] in queue:
start = town_list[now_town - 1]
break
queue[town_list[now_town - 1]... | p02684 |
def f():
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
now=1
for i in range(k.bit_length()):
if k%2:now=l[now-1]
l=[l[l[i]-1]for i in range(n)]
k//=2
print(now)
if __name__ == "__main__":
f() | def f():
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
now=1
for i in range(k.bit_length()):
if k%2:now=l[now-1]
l=tuple(l[l[i]-1]for i in range(n))
k//=2
print(now)
if __name__ == "__main__":
f() | p02684 |
def f():
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
now=1
for i in range(k.bit_length()):
if k%2:now=l[now-1]
l=tuple(l[l[i]-1]for i in range(n))
k//=2
print(now)
if __name__ == "__main__":
f() | def f():
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
now=1
for d in range(k.bit_length()):
if k%2:now=l[now-1]
l=tuple(l[i-1]for i in l)
k//=2
print(now)
if __name__ == "__main__":
f()
| p02684 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
C=[0]+[-1]*(n-1)
p=1
c=0
s=-1
e=-1
for i in range(n):
p=A[p-1]
c+=1
if C[p-1]==-1:
C[p-1]=c
else:
s=C[p-1]
e=c
break
P=1
if s!=-1 and e!=-1:
if k<=s:
while k>0:
... | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
p=1
if k<=n:
for i in range(k):
p=A[p-1]
print(p)
else:
D=[0]+[-1]*(n-1)
for i in range(n):
p=A[p-1]
if D[p-1]==-1:
D[p-1]=i+1
else:
l=D[p-1]
r=i+1-D[p-1... | p02684 |
from collections import deque
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
T = set([0]) # 0-indexed
c = 0 # 0-indexed
for i in range(N + 1):
c = A[c] - 1
# print('c', c)
if c not in T:
T.add(c)
else:
break
C = deque([c])
T = set([c]) # 0-... | import sys
input = sys.stdin.buffer.readline
N, K = list(map(int, input().split()))
A = [-1] + list(map(int, input().split()))
I = [-1] * (N + 1)
S = []
idx = 1
while I[idx] == -1:
S.append(idx)
I[idx] = len(S)
idx = A[idx]
# print(f'{S=}, {idx=}, {I[idx]=}')
start_idx = I[idx] - 1
num_circ... | p02684 |
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
time=0
color=["white" for _ in range(n+1)]
D=[-1 for _ in range(n+1)]
C,s=[],A[0]
point=0
while 1:
if color[s]=="white":
color[s]="gray"
C.append(s)
D[s]=time
time +=1
s=A[s-1]
else:
... | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
time=0
color=["white" for _ in range(n+1)]
D=[-1 for _ in range(n+1)]
C,s=[],A[0]
point=0
while 1:
if color[s]=="white":
color[s]="gray"
C.append(s)
D[s]=time
time +=1
s=A[s-1]
else:
... | p02684 |
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
to = [[None]*n for _ in range(60)]
to[0] = a
for i in range(1, 60):
for j in range(n):
to[i][j] = to[i-1][to[i-1][j]-1]
p = 1
for i in range(59, -1, -1):
num = 1 << i
... | def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
to = [[None]*n for _ in range(60)]
to[0] = a[:]
for i in range(1, 60):
for j in range(n):
to[i][j] = to[i-1][to[i-1][j]-1]
p = 1
for i in range(59, -1, -1):
num = 1 <<... | p02684 |
n,k = list(map(int, input().split()))
d={}
l = list(map(int, input().split()))
for i in range(len(l)):
d[i+1] = l[i]
city = 1
l2 = [1]
while True:
city = d[city]
if city in l2:
break
l2.append(city)
first = l2.index(city)
if len(l2) <= k:
if city == l2[-1]:
print(c... | n,k = list(map(int, input().split()))
l = [0]+list(map(int, input().split()))
journey = [1]
for i in range(2*n):
next = l[journey[-1]]
journey.append(next)
if k <= n+1:
print((journey[k]))
exit()
end = n
start = n-1
while journey[start] != journey[end]:
start -= 1
period = end... | p02684 |
from collections import deque
def main():
N,K=list(map(int,input().split()))
A=list([int(x)-1 for x in input().split()])
loop=[]
slack_que=deque([])
flag=0
t=0
start=0
while flag==0:
slack_que.append(t)
t=A[t]
slack_que.append(t)
ind=s... | from collections import deque
def main():
N,K=list(map(int,input().split()))
A=list([int(x)-1 for x in input().split()])
FootPrintA=A[:]
loop=[]
slack_que=deque([])
flag=0
t=0
start=0
while flag==0:
slack_que.append(t)
t_ = FootPrintA[t]
F... | p02684 |
N, K= list(map(int, input().split()))
A_list = list(map(int, input().split()))
loop = []
trace = [0] * (N+1)
ai = 1
for i in range(N+1):
if ai in trace:
ind = trace.index(ai)
loop = trace[ind:i]
trace = trace[:ind]
break
trace[i] = ai # ??
ai = A_list[ai-1... |
N, K= list(map(int, input().split()))
A_list = list(map(int, input().split()))
loop = []
trace = [0] * (N+1)
visited = set()
ai = 1
for i in range(N+1):
if ai in visited:
ind = trace.index(ai)
loop = trace[ind:i]
trace = trace[:ind]
break
visited.add(ai)
... | p02684 |
N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
now = 1
visited = []
visited_set = set()
for i in range(1, N+1):
visited.append(now)
visited_set.add(now)
now = A[now]
if now in visited_set:
loop_start = visited.index(now)
loop_length = i - ... | N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
now = 1
visited = []
visited_set = set()
flag = False
for i in range(1, K+1):
visited.append(now)
visited_set.add(now)
now = A[now]
if now in visited_set:
loop_start = visited.index(now)
loop... | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def func1(lst, value):
return [i for i, x in enumerate(lst) if x == value]
temp=1
trace=[1]
circle=[]
for i in range(K):
temp=A[temp-1]
ans=func1(trace,temp)
if len(ans)==1:
circle.append(i-ans[0]+1)
#print(c... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
check=[-1 for i in range(N)]
temp=1
circle=[]
for i in range(K):
temp=A[temp-1]
if check[temp-1]==-1:
check[temp-1]=i
else:
circle.append(i-check[temp-1])
#print(circle)
break
#print("temp",temp)
#pri... | p02684 |
import sys
readline = sys.stdin.readline
N,K = list(map(int,readline().split()))
A = [0] + list(map(int,readline().split()))
now = 1
while K > 0:
if K & 1:
now = A[now]
A = [A[A[i]] for i in range(len(A))]
K >>= 1
print(now) | import sys
readline = sys.stdin.readline
N,K = list(map(int,readline().split()))
A = [0] + list(map(int,readline().split()))
pos = 1
while K:
if K & 1:
pos = A[pos]
A = [A[A[i]] for i in range(N + 1)]
K >>= 1
print(pos) | p02684 |
line1 = input().split()
n = int(line1[0])
k = int(line1[1])
a = [int(ai) for ai in input().split()]
route = [0]
for j in range(k):
now = a[route[j]] - 1
if now in route:
break
else:
route.append(now)
l_start = route.index(now)
print((route[l_start + ((k - l_start) % (len(route) - l_start))... | line1 = input().split()
n = int(line1[0])
k = int(line1[1])
a = [int(ai) for ai in input().split()]
route = [0]
use = {0}
for j in range(k):
now = a[route[j]] - 1
if now in use:
break
else:
route.append(now)
use.add(now)
l_start = route.index(now)
print((route[l_start + ((k - l_start... | p02684 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=[]
s.append(1)
a1=1
a2 = a[a1-1]
while a2 not in s:
s.append(a2)
a1 = a2
a2 = a[a1-1]
loop_num=s.index(a2)
loop=s[loop_num:]
cnt=len(loop)
if k<len(s):
print((s[k]))
else:
ans = (k-loop_num)%cnt
print((l... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=[]
s.append(1)
a1=1
a2 = a[a1-1]
l=[0]*n
l[0]=1
while l[a2-1] != 1:
s.append(a2)
a1 = a2
a2 = a[a1-1]
l[a1-1] = 1
loop_num=s.index(a2)
loop=s[loop_num:]
cnt=len(loop)
if k<len(s):
print((s[k]))
else:
a... | p02684 |
def d_teleporter():
N, K = [int(i) for i in input().split()]
A = [int(i) - 1 for i in input().split()] # 0-origin
from collections import defaultdict
visit = [0]
visit_dict = defaultdict(list)
visit_dict[0] = [0]
current = 0
is_found_first = False
for i in range(N):
... | def d_teleporter():
N, K = [int(i) for i in input().split()]
A = [int(i) - 1 for i in input().split()] # 0-origin
visit_list, visit_dict = list(), dict()
current_city = 0
for i in range(min(K, N)): # N 回移動すればループはわかる
current_city = A[current_city]
if current_city in visit_d... | p02684 |
n, k = list(map(int, input().split()))
a = [int(x)-1 for x in input().split()]
v = []
b = 0
for i in range(n):
if b not in v:
v.append(b)
b = a[b]
else:
stop = v.index(b)
j = i
break
if k>j:
r = (k-stop)%(j-stop)
print((v[stop+r]+1))
else:... | n, k = list(map(int, input().split()))
a = [int(x)-1 for x in input().split()]
v = []
vc = [0]*n
b = 0
c = 0
while True:
if vc[b]>0:
stop = v.index(b)
break
v.append(b)
vc[b] += 1
b = a[b]
c += 1
if k>stop:
r = (k-stop)%(c-stop)
print((v[stop+r]+1)... | p02684 |
nk = input().split()
n , k = int(nk[0]), int(nk[1])
a = [int(i) for i in input().split()]
t = 1
tl = [1]
flg = False
for i in range(len(a)):
flg = t > a[t-1]
t = a[t-1]
stl = sorted(tl)
if flg and t in stl:
break
else:
tl.append(t)
tl2 = tl[tl.index(t):len(tl)]
... | nk = input().split()
n , k = int(nk[0]), int(nk[1])
a = [int(i) for i in input().split()]
t = 1
tl = [1]
ts = {1}
for i in range(len(a)):
t = a[t-1]
if t in ts:
break
else:
tl.append(t)
ts.add(t)
tl2 = tl[tl.index(t):len(tl)]
# print(tl)
# prin... | p02684 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
D = 60 #10**18は60桁なので2の59乗まで見る
MAX_N = 200005 #頂点番号
to = [[0 for _ in range(MAX_N)] for _ in range(D)]
#to[i][j]:jから2^i個先の頂点
for i in range(n):
to[0][i] = A[i]
to[0][i] -= 1
#ダブリングの表
for i in range(D-1):
for j in ran... | def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n, k = 4, 5
A = [3, 2, 4, 1]
else:
##INPUT
#n = input()
n... | p02684 |
#Doubling O(log k)
def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n, k = 4, 5
A = [3, 2, 4, 1]
else:
##INPUT
... | #1 Doubling: O(log k)
# Python (3.8.2): TLE
# PyPy3
def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n, k = 4, 5
A = [3, 2, ... | p02684 |
import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
A = list(map(int, readline().rstrip().split()))
d = {i+1: a for i, a in enumerate(A)}
if K <= N:
pre = 1
for _ in range(K):
pre = d[pre]
print(pre)
... | import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
d = list(map(int, readline().rstrip().split()))
# d = {i+1: a for i, a in enumerate(A)}
if K <= N:
pre = 1
for _ in range(K):
pre = d[pre-1]
print(pre)
... | p02684 |
n, k = list(map(int, input().strip().split()))
L = list(map(int, input().strip().split()))
L = [v - 1 for v in L]
seen = set()
cur = 0
untillBackToIntersec = 0
while cur not in seen:
seen.add(cur)
untillBackToIntersec += 1
cur = L[cur]
intersec = cur
cur = 0
beforeLoop = 0
while cur != ... | n, k = list(map(int, input().strip().split()))
L = list(map(int, input().strip().split()))
L = [v - 1 for v in L]
seen = set()
intersec = 0
route=[]
while intersec not in seen:
seen.add(intersec)
route.append(intersec)
intersec = L[intersec]
intersecInd = route.index(intersec)
if k<=inters... | p02684 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
route = [0]
now_i = 0
loop_len = 0
for i in range(1, N):
next_i = A[now_i]-1
if next_i in route:
loop_len = i - route.index(next_i)
break
route.append(next_i)
now_i = next_i
base = len(route) -... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
route = [0]
routeset = {0}
now_i = 0
loop_len = 0
for i in range(1, N):
next_i = A[now_i]-1
if next_i in routeset:
loop_len = i - route.index(next_i)
break
routeset.add(next_i)
route.append(next_i)
... | p02684 |
import time
N,K=list(map(int,input().split()))
array=list(map(int,input().split()))
A=list(array)
A.insert(0,0)
visit=[]
visited=1
once=0
while True:
visit.append(visited)
once+=1
if A[visited] in visit:
break
visited=A[visited]
roop=visit[visit.index(A[visited]):]
if K<on... | N,K=list(map(int,input().split()))
array=list(map(int,input().split()))
A=list(array)
A.insert(0,0)
visit=0
root=[]
visited=1
once=0
while True:
if visit & (0b1<<visited):
break
root.append(visited)
visit|=0b1<<visited
once+=1
visited=A[visited]
roop=root[root.index(vi... | p02684 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [i-1 for i in a]
p = 0
b = []
while p not in b:
b.append(p)
p = a[p]
avant = b.index(p)
loop_count = len(b) - avant
c = b[avant:]
if k <= avant:
print((b[k]+1))
else:
k -= avant
k %= loop_count
p... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [i-1 for i in a]
d = [1]*n
p = 0
b = []
while d[p]:
b.append(p)
d[p] = 0
p = a[p]
avant = b.index(p)
loop_count = len(b) - avant
c = b[avant:]
if k <= avant:
print((b[k]+1))
else:
k -= avant
k %... | p02684 |
import sys
import math
import itertools
def main():
n,k = list(map(int, input().split()))
a = list(map(int,sys.stdin.readline().split()))
now = 0
times = 0
visit =[[0],[0]]
for _ in range(k):
times += 1
now = a[now] - 1
roop = 0
roop_start = 0
if now in visit[0]:
... | import sys
import math
import itertools
def main():
n,k = list(map(int, input().split()))
a = list(map(int,sys.stdin.readline().split()))
now = 0
times = 0
visit =[[0],[-1 for _ in range(n)]]
visit[1][0] = 0
roop = 0
roop_start = 0
for _ in range(k):
times += 1
now = a[now]... | p02684 |
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
N, K = [int(x) for x in stdin.readline().rstrip().split()]
A = [0] + [int(x) for x in stdin.readline().rstrip().split()]
stack = [1]
nextt = A[1]
while Tru... | from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools
INF = 10 ** 10
N, K = [int(x) for x in stdin.readline().rstrip().split()]
A = [0] + [int(x) for x in stdin.readline().rstrip().split()]
stack = [1]
nextt = A[1]
visited_dic... | p02684 |
n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
a1 = [0] * (n+1)
step = 1
start = 0
while(True):
start += 1
a1[step] += 1
step = a[step]
if a1[step] == 1:
break
c = step
gap = 0
while(True):
gap += 1
step = a[step]
if step == c:
... | n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
repeat = [0] * (n+1)
circle = [1]
point = 1
flag = 0
for _ in range(k):
circle.append(a[point])
repeat[point] = 1
point = a[point]
if(repeat[point] == 1):
flag = 1
break
if flag == 0:
p... | p02684 |
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n,k = list(map(int,stdin.readline().rstrip().split()))
a = list(map(int,stdin.readline().rstrip().split()))
a = [0]+a
bunki = 0
now = a[1]
lip = [1]
while True:
bunki += 1
if now in lip:
break
lip.appen... | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n,k = list(map(int,stdin.readline().rstrip().split()))
a = list(map(int,stdin.readline().rstrip().split()))
a = [0]+a
bunki = 0
now = a[1]
lip = [1]
se = set()
while True:
bunki += 1
if now in se:
break
... | p02684 |
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
l = [-1]*n
now = 0
l[0] = 0
ans = -100
for i in range(n):
a[i] -= 1
for i in range(n*3):
k -= 1
now = a[now] #転送された場所
... | import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
l = [-1]*n
now = 0
order = 0
l[0] = 0
s = {}
ans = -100
for i in range(n):
a[i] -= 1
while k > 0:
k -= 1
now =... | p02684 |
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
to[i][j+1] = to[to[i][j]][j]
v = 0
for i in reversed(list(range(D))):
if (K >> i) & ... | def main():
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
to[i][j+1] = to[to[i][j]][j]
v = 0
f... | p02684 |
n, k = list(map(int, input().split()))
*A, = list(map(int, input().split()))
A = [0] + A
DP = [[None for j in range(60)] for i in range(n + 1)]
for i in range(n + 1):
DP[i][0] = A[i]
for j in range(1, 60):
for i in range(n + 1):
DP[i][j] = DP[DP[i][j - 1]][j - 1]
K = list(bin(k)[2:][::-1])
i =... | n, k = list(map(int, input().split()))
*A, = list(map(int, input().split()))
A = [0] + A
bit = list(bin(k)[2:][::-1])
m = len(bit)
DP = [[None for j in range(m)] for i in range(n + 1)]
for i in range(n + 1):
DP[i][0] = A[i]
for j in range(1, m):
for i in range(n + 1):
DP[i][j] = DP[DP[i][j - 1... | p02684 |
import math
from collections import deque
import sys
sys.setrecursionlimit(10**9)
def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
graph = [0] * (N+1)
for i in range(N+1): #1-indexed
f = i
t = A[i-1]
graph[f] = t
def solv... | from collections import deque
import sys
sys.setrecursionlimit(10**9)
def main():
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
graph = [0] * (N+1)
for i in range(N+1): #1-indexed
f = i
t = A[i-1]
graph[f] = t
def solve():
... | p02684 |
#!/usr/bin/env python3
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tele = [1,A[0]]
B = [0]
z = 0
s = 0
for i in range(N):
if z in B and len(B) != 1:
s = B.index(z)
break
tele.append(A[tele[-1]-1])
B.append(tele[-2]-1)
z = tele[-1]-1
if K... | #!/usr/bin/env python3
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N):
A[i] -= 1
tele = [0]
#tele = [0,A[0]-1]
z = 0
s = 0
#B = {0:0,A[0]-1:1}
B = {0:0}
for i in range(N):
if A[tele[-1]] in B and len(B) != 1:
s = B[A[tele[-1]]]
br... | p02684 |
def factors(n):
sieve = [1]*(n+10)
ret = []
m = 1
while m*7-1 <= n:
for p in [m*7-1,m*7+1]:
if sieve[p] == 0: continue
if n%p == 0:
ret.append(p)
for pp in range(2*p,n+1,p):
sieve[pp] = 0
m += 1
return(re... | MAXN = 300010
sieve = [1]* MAXN
primes = []
for n in range(7,MAXN,7):
for m in [n-1,n+1]:
if sieve[m] == 0: continue
primes.append(m)
for l in range(2*m,MAXN,m):
sieve[l] = 0
def solve(n):
ret = []
for p in primes:
if p > n: break
if n%p == ... | p00735 |
p = [1]*300003
p[0] = p[1] = 0
for i in range(2,300003):
if p[i] and i%7 in (1,6):
p[2*i::i] = [0]*len(p[2*i::i])
else:
p[i] = 0
prime = [i for i in range(2,300003) if p[i]]
while 1:
N = int(input())
if N == 1: break
ans = [p for p in prime if N%p == 0]
print("%d: %... | from bisect import *
p = [1]*300003
p[0] = p[1] = 0
for i in range(2,300003):
if p[i] and i%7 in (1,6):
p[2*i::i] = [0]*len(p[2*i::i])
else:
p[i] = 0
p = [i for i in range(2,300003) if p[i]]
while 1:
N = int(input())
if N == 1: break
ans = [i for i in p[:bisect(p,N+1)] ... | p00735 |
import sys
import math
def sieve (n):
ms_prime = [0,0,0,0,0,0]
ms_prime += [1 for i in range(n-5)]
ub = math.sqrt(n) + 1
d = 6
while d <= ub:
if ms_prime[d] == 0:
d += 1
continue
if d % 7 != 1 and d % 7 != 6:
ms_prime[d] = 0
d += 1
continue
prod = 2
while d * prod <= n:
m... | import sys
def sieve (n):
ms_sieve = [0,0,0,0,0,0]
ms_sieve += [1 for i in range(n-5)]
ms_prime = []
d = 6
while d <= n:
if ms_sieve[d] == 0:
d += 1
continue
if d % 7 != 1 and d % 7 != 6:
ms_sieve[d] = 0
d += 1
continue
ms_prime.append(d)
prod = 2
while d * prod <= n:
m... | p00735 |
class BIT():
def __init__(self,size):
self.size=size
self.node=[0]*(size+1)
def sum(self,idx):
ret=0
while idx>0:
ret+=self.node[idx]
idx-=idx&(-idx)
return ret
def add(self,idx,x):
while idx<=self.size:
self... | class BIT():
def __init__(self,size):
self.size=size
self.node=[0]*(size+1)
def sum(self,idx):
ret=0
while idx>0:
ret+=self.node[idx]
idx-=idx&(-idx)
return ret
def add(self,idx,x):
while idx<=self.size:
self... | p03819 |
import sys
from collections import Counter
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG: {} -> {}'.format(name, val), file=sys.stderr)
return None
N, M = map(int, input().split())
L = {}
R = {}
for i in range(N):
left, right = ma... | import sys
from operator import itemgetter
mod = 10**9 + 7
inf = 1<<30
def solve():
N, M = list(map(int, sys.stdin.readline().split()))
sects = []
for i in range(N):
li, ri = list(map(int, sys.stdin.readline().split()))
sects.append((li - 1, ri, ri - li + 1))
sects.so... | p03819 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p03819 |
N, M = map(int, input().split())
L = []
for i in range(N):
l, r = map(int, input().split())
L.append((r-l+1, l, r+1))
L.sort()
class Bit:
"""
0-indexed
# 使用例
bit = Bit(10) # 要素数
bit.add(2, 10)
print(bit.sum(5)) # 10
"""
def __init__(self, n):
self.siz... | import sys
def input():
return sys.stdin.readline()[:-1]
N, M = map(int, input().split())
L = []
for i in range(N):
l, r = map(int, input().split())
L.append((r-l+1, l, r+1))
L.sort()
class Bit:
"""
0-indexed
# 使用例
bit = Bit(10) # 要素数
bit.add(2, 10)
print(bit.sum(... | p03819 |
N, M = map(int, input().split())
L = []
for i in range(N):
l, r = map(int, input().split())
L.append((r-l+1, l, r+1))
L.sort()
class Bit:
"""
0-indexed
# 使用例
bit = Bit(10) # 要素数
bit.add(2, 10)
print(bit.sum(5)) # 10
"""
def __init__(self, n):
self.siz... | import sys
def input():
return sys.stdin.readline()[:-1]
N, M = map(int, input().split())
L = []
for i in range(N):
l, r = map(int, input().split())
L.append((r - l + 1, l, r + 1))
L.sort()
class Bit:
"""
0-indexed
# 使用例
bit = Bit(10) # 要素数
bit.add(2, 10)
print(... | p03819 |
class BIT():
def __init__(self,n):
self.BIT=[0]*(n+1)
self.num=n
def query(self,idx):
res_sum = 0
while idx > 0:
res_sum += self.BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def update(self,idx,x):
whil... | class BIT():
def __init__(self,n):
self.BIT=[0]*(n+1)
self.num=n
def query(self,idx):
res_sum = 0
while idx > 0:
res_sum += self.BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def update(self,idx,x):
whil... | p03819 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI(): return list(map(int, input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main(... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
... | p03819 |
import sys
input = sys.stdin.readline
from itertools import accumulate
class Segtree:
def __init__(self, original, func, element):
self.n = len(original)
self.element = element
self.func = func
self.N0 = 1 << (self.n-1).bit_length()
self.seg = [element]*(self.N0 <<... | import sys
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(n)]
BIT = [0]*(m+2)
def add(i, a):
while i <= m+1:
BIT[i] += a
i += i&(-i)
def bit_sum(i):
res = 0
while i > 0:
res += BIT[i]... | p03819 |
import sys
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(n)]
BIT = [0]*(m+2)
def add(i, a):
while i <= m+1:
BIT[i] += a
i += i&(-i)
def bit_sum(i):
res = 0
while i > 0:
res += BIT[i]... | import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().split()))
S = [[] for _ in range(m+1)]
for _ in range(n):
l, r = list(map(int, input().split()))
S[r-l+1].append((l, r))
BIT = [0]*(m+2)
def add(i, a):
while i <= m+1:
BIT[i] += a
i += i&(-... | p03819 |
from operator import itemgetter
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
i -= i & -i
def get_val(self, i):
... | from operator import itemgetter
import sys
input = sys.stdin.readline
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
i -= i ... | p03819 |
from operator import itemgetter
import sys
input = sys.stdin.readline
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
i -= i ... | from operator import itemgetter
import sys
input = sys.stdin.readline
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
i -= i ... | p03819 |
from operator import itemgetter
import sys
input = sys.stdin.readline
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
i -= i ... | from operator import itemgetter
import sys
input = sys.stdin.buffer.readline
class BIT:
"""区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _add(self, i, val):
while i > 0:
self.bit[i] += val
... | p03819 |
import sys
input=sys.stdin.readline
#区間[L,R]に1を加えていく
def seg_tree_update(L,R):
L,R=2**m-1+L,2**m-1+R
while L<R:
if L%2==0:
tree[L]+=1
if R%2==1:
tree[R]+=1
L//=2
R=R//2-1
if L==R:
tree[L]+=1
#数直線xでの和を求める
def seg_tree_sumarize... | """
BIT
区間[L,R]にxを加える。
座標Xでの値を求める。
"""
import sys
input=sys.stdin.readline
def bit_add(i,x):
while i<=M:
tree[i]+=x
i+=i&(-i)
def bit_sum(i):
s=0
while i>0:
s+=tree[i]
i-=i&(-i)
return s
N,M=list(map(int,input().split()))
data=[]
for i in range(... | p03819 |
def bitadd(a,w,bit): #aにwを加える(1-origin)
x = a
while x <= (len(bit)-1):
bit[x] += w
x += x & (-1 * x)
def bitsum(a,bit): #ind 1～aまでの和を求める
ret = 0
x = a
while x > 0:
ret += bit[x]
x -= x & (-1 * x)
return ret
#区間更新BIT(BITを2つ用意し、BITの長さをN+2で... |
def bitadd(a,w,bit): #aにwを加える(1-origin)
x = a
while x <= (len(bit)-1):
bit[x] += w
x += x & (-1 * x)
def bitsum(x,bit): #ind 1～aまでの和を求める
ret = 0
while x:
ret += bit[x]
x -= x & (-1 * x)
return ret
#区間更新BIT(BITを2つ用意し、BITの長さをN+2で初期化しておくべし)
d... | p03819 |
a,b,c,d,e,f=[int(eval(input())) for _ in range(6)]
print((sum([a,b,c,d,max(e,f)])-min([a,b,c,d]))) | print((sum(sorted(int(eval(input())) for _ in range(4))[1:])+max([int(eval(input())) for _ in range(2)]))) | p00542 |
N = int(eval(input()))
print(((N - 1) // 2)) |
N = int(eval(input()))
print((N // 2 - int(N % 2 == 0)))
| p02865 |
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
def main():
n = int(input().strip())
ans = 0
for i in range(1, n):
j = n - i
if i == j:
continue
ans += 1
print((ans // 2))
if __name__ == '__main_... |
# ..
# .gMMN;
# .HMMMR ....-, .gggggggJJ...
# .J,. TMMN; ..JgNMMMMMMM{dMMMMMMMMMMMMNNgJ..
# .MMMNx. ?MMb .JNMMMMMMMMMMMMrJMMMMMMMMMMMMMMMMMNmJ.
# ?MMMMMNe. ?MN,... | p02865 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines
#rstrip().decode('utf-8')
import math
#import numpy as np
#import operator
#import bisect
#from heapq import heapify,heappop,heappush
#from math import gcd
#from fractions import gcd
#from collecti... | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int,in... | p02865 |
N=int(eval(input()))
S=set()
for i in range(1,N):
x=i
y=N-i
if x<y:
S.add(x)
print((len(S)))
| print(((int(eval(input()))-1)//2)) | p02865 |
N=int(eval(input()))
S=set()
for i in range(1,N):
x=i
y=N-i
if x<y:
S.add(x)
print((len(S)))
| print(((int(eval(input()))-1)//2))
| p02865 |
a=int(eval(input()))
if a%2==0:
print((a//2-1))
else:
print((a//2)) | print(((int(eval(input()))-1)//2)) | p02865 |
print(((int(eval(input()))-1)//2)) | N = int(eval(input()))
if N%2==0:
print((N//2-1))
else:
print((N//2)) | p02865 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.st... | n = int(eval(input()))
print(((n-1)//2)) | p02865 |
N = int(eval(input()))
if N % 2 == 0:
print((N//2-1))
else:
print((N//2)) | # coding: utf-8
N= int(eval(input()))
if N%2 == 0:
print((N//2-1))
else:
print((N//2)) | p02865 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
cnt = 0
for i in range(1, n // 2 + 1):
if n - i != i:
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
cnt = 0
for i in range(1, n // 2 if n % 2 == 0 else n // 2 + 1):
if n - i <= n:
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| p02865 |
n=int(eval(input()))-1
print((n//2)) | print(((int(eval(input()))-1)//2)) | p02865 |
def main():
while True:
N = eval(input())
if N == 0:
break
points = [Vector(list(map(int, input().split()))) for _ in range(N)]
seq = [Vector([0, -1]), Vector([0, 0])]
while len(points) != 0:
pre = seq[-1] - seq[-2]
points.sort... | def main():
while True:
N = eval(input())
if N == 0:
break
points = [Vector(list(map(int, input().split()))) for _ in range(N)]
seq = [Vector([0, -1]), Vector([0, 0])]
while len(points) != 0:
pre = seq[-1] - seq[-2]
points.sort... | p00689 |
from bisect import insort, bisect
N = int(eval(input()))
P = list(map(int, input().split()))
I = [0] * N
for i in range(N):
I[P[i]-1] = i
ans = 0
memo = [I[N-1]]
for p in range(N-1, 0, -1):
i = I[p-1]
b = bisect(memo, i)
l1 = memo[b-1] if b > 0 else -1
l2 = memo[b-2] if b > 1 else ... | N = int(eval(input()))
P = list(map(int, input().split()))
I = [0] * N
for i in range(N):
I[P[i]-1] = i
ans = 0
L = [i for i in range(-1, N-1)]
R = [i for i in range(1, N+1)]
for p in range(1,N+1):
i = I[p-1]
if R[i] < N:
L[R[i]] = L[i]
if L[i] >= 0:
R[L[i]] = R[i]
... | p02919 |
# maspyさんのコード参照
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
P = [None] + [int(x) for x in input().split()]
p_to_i = [None] * (N+1)
for i,x in enumerate(P[1:],1):
p_to_i[x] = i
# 大きい数から挿入していく
# 左隣にあるインデックスを取得できるようにしておく
# そのために、[1,i]内で書き込んだ数の個数を獲得できるBITを持... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
P = [None] + [int(x) for x in input().split()]
p_to_i = [None] * (N+1)
for i,x in enumerate(P[1:],1):
p_to_i[x] = i
# 大きい数から挿入していく
# 左隣にあるインデックスを取得できるようにしておく
# そのために、[1,i]内で書き込んだ数の個数を獲得できるBITを持つ
# BITは一番最後... | p02919 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter
from bisect import bisect,insort
def solve(n, ppp):
q = sorted(enumerate(ppp),key=itemgetter(1),reverse=True)
le = [-1,-1,q[0][0],n,n]
ans = 0
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter
n = int(readline())
ppp = list(map(int,readline().split()))
def BIT_add(i,x):
while i <= n:
tree[i] += x
i += i&(-i)
def BIT_sum(i):
... | p02919 |
import itertools
n = int(eval(input()))
p = list(map(int, input().split(' ')))
combi = list(itertools.combinations(list(range(n)), 2))
ans = 0
def second_max(ls):
ls.sort()
return ls[len(ls) - 2]
for i in range(len(combi)):
ans += second_max(p[combi[i][0]:combi[i][1] + 1])
print(ans) | n = int(eval(input()))
p = list(map(int, input().split(' ')))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if j == i + 1:
first_max = max(p[i], p[i + 1])
second_max = min(p[i], p[i + 1])
else:
if p[j] > first_max:
second_ma... | p02919 |
#incited from https://juppy.hatenablog.com/entry/2019/02/26/python_AVL%E6%9C%A8_%E9%85%8D%E5%88%97ver_%E7%AB%B6%E6%8A%80%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0_Atcoder_
#AVL-Tree code by juppy
#AVL
##search(0,x):O(logN)
# xがある場合indexを、ない場合Noneを返す
def search(root,key):
if avl_key[ro... | #incited from https://juppy.hatenablog.com/entry/2019/02/26/python_AVL%E6%9C%A8_%E9%85%8D%E5%88%97ver_%E7%AB%B6%E6%8A%80%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0_Atcoder_
#AVL-Tree code by edamat
class Avltree:
"""
AVL木
Methods
-------
search(x: int) -> Union(in... | p02919 |
class Node:
def __init__(self, key):
self.key = key
self.lch = None
self.rch = None
self.bias = 0
self.size = 1
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rch
u.size = v.size
... | class Node:
def __init__(self, key):
self.key = key
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rch
v.rch = u.lch
u.lch = v
if u... | p02919 |
N = int(eval(input()))
*P, = list(map(int, input().split()))
N += 1
data = [0]*(N+1)
def add(k, x):
while k <= N:
data[k] += x
k += k & -k
def get(k):
s = 0
while k:
s += data[k]
k -= k & -k
return s
N0 = 2**(N-1).bit_length()
def lower_bound(x):
... | N = int(eval(input()))
*P, = list(map(int, input().split()))
LL = [0] + [i for i in range(N+1)]
RR = [i+1 for i in range(N+1)] + [N+1]
E = [(v, i+1) for i, v in enumerate(P)]
E.sort()
ans = 0
for v, i in E:
l0 = LL[i]; l1 = LL[l0]
r0 = RR[i]; r1 = RR[r0]
LL[RR[i]], RR[LL[i]] = LL[i], RR[... | p02919 |
N = int(eval(input()))
P = [int(i) for i in input().split()]
ans = 0
for l in range(N-1):
for r in range(l+1,N):
ans += sorted(P[l:r+1])[-2]
print(ans) | N = int(eval(input()))
P = [int(i) for i in input().split()]
ind = [0]*(N+1)
for i in range(N):
ind[P[i]] = i+1
ans = 0
l = [0] + [f for f in range(N+1)]
r = [f + 1 for f in range((N+1))] + [N+1]
for j in range(1,N+1):
f = ind[j]
l1 = l[f]
l2 = l[l1]
r1 = r[f]
r2 = r[r1]
... | p02919 |
n = int(eval(input()))
p = list(map(int, input().split()))
dp = [[None]*(n+1) for _ in range(n)]
ans = 0
for i in range(n-1):
for j in range(i+1, n):
if i+1 == j:
a, b = p[i], p[j]
if a > b: a ,b = b, a
dp[i][j] = (a, b)
ans += a
else:
... | n = int(eval(input()))
p = list(map(int, input().split()))
dp = [[None]*(n) for _ in range(n-1)]
ans = 0
for i in range(n-1):
for j in range(i+1, n):
if i+1 == j:
a, b = p[i], p[j]
if a > b: a ,b = b, a
dp[i][j] = (a, b)
ans += a
else:
... | p02919 |
import sys
def main():
input = sys.stdin.readline
N = int(input().strip())
P = list(map(int,input().strip().split()))
ips = [0]*(N)
for i, val in enumerate(P):
ips[val-1] = i
P.sort(reverse=True)
x = 0
largeind = [-1,-1,N,N]
for i in range(N):
target = ips[P[i]-1]
larger = len(la... | import sys
def main():
input = sys.stdin.readline
N = int(input().strip())
P = list(map(int,input().strip().split()))
RR = [i+1 for i in range(N)]
LL = [i-1 for i in range(N)]
ips = [0]*(N)
for i, val in enumerate(P):
ips[val-1] = i
P.sort()
x = 0
for i in range(N):
target = ips[P[i... | p02919 |
class Node:
def __init__(self, key=None):
self.key = key
self.height = 1
self.parent = None
self.left = None
self.right = None
def update_height(t):
if t.left is not None:
l = t.left.height
else:
l = 0
if t.right is not None:
... | class Node:
def __init__(self, key=None):
self.key = key
self.balance = 'E'
self.parent = None
self.left = None
self.right = None
class AVL:
def __init__(self):
self.root = Node()
self.root.parent = Node('nil')
def insert(self, key):
... | p02919 |
class BinaryIndexedTree:
def __init__(self, size):
size = 1 << (size-1).bit_length()
self.data = [0] * (size+1)
self.size = size
def add(self, i, w):
i += 1
while i <= self.size:
self.data[i] += w
i += i & -i
def sum(self, i... | class BinaryIndexedTree:
def __init__(self, size):
self.data = [0] * (size+1)
self.msb = 1 << (size.bit_length()-1)
def add(self, i, w):
i += 1
while i < len(self.data):
self.data[i] += w
i += i & -i
def get_sum(self, i):
... | p02919 |
class SegmentTree:
def __init__(self, n, init_value):
self.n = n
n2 = 1 # nより大きい2の冪数
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [[init_value, init_value] for _ in range(n2 << 1)]
self.ini = init_value
def update(self, i, x):
#... | class SegmentTree:
def __init__(self, n, init_value):
self.n = n
n2 = 1 # nより大きい2の冪数
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [[init_value, init_value] for _ in range(n2 << 1)]
self.ini = init_value
def update(self, i, x):
#... | p02919 |
import sys
from bisect import *
input=sys.stdin.readline
def main():
n = int(input()[:-1])
aa = list(map(int, input().split()))
ans = 0
pos = [0] * n
for i, a in enumerate(aa):
pos[a - 1] = i
# print(pos)
fin = [-1, -1, n, n]
for a in range(n - 1, -1, -1):
... | # 参考 https://atcoder.jp/contests/abc140/submissions/7411285
import sys
input = sys.stdin.readline
def main():
n = int(input()[:-1])
aa = list(map(int, input().split()))
ans = 0
pos = [0] * (n + 1)
for i, a in enumerate(aa):
pos[a] = i + 2
Lnext = [1, 1] + list(range(1, n + 1)... | p02919 |
def main():
import sys
input = sys.stdin.readline
import bisect
n = int(eval(input()))
l = list(map(int,input().split()))
l1 = [0]*n
for i in range(n):
l1[l[i]-1] = i
ans = 0
s = [-1,-1,l1[-1],n,n]
for i in range(n-2,-1,-1):
c = l1[i]
now =... | n=int(eval(input()))
p=list(map(int,input().split()))
id=[0]*(n+1)
for i,p_i in enumerate(p):
id[p_i]=i
r = list(range(1,n+1))+[n,n]
l = list(range(-1,n-1))+[-1,-1]
ans=0
for p in range(1,n+1):
x=id[p]
r1=r[x]
r2=r[r1]
l1=l[x]
l2=l[l1]
ans+=p*((x-l1)*(r2-r1) + (l1-l2)*(r1-x))... | p02919 |
import bisect
N = int(eval(input()))
P = []
for i, p in enumerate(map(int, input().split())):
P.append([p, i])
P = sorted(P, reverse = True)
A = [- 1, - 1, P[0][1], N, N]
res = 0
for p, i in P[1:]:
j = bisect.bisect_left(A, i)
A.insert(j, i)
res += p*((A[j] - A[j - 1])*(A[j + 2] - ... | import bisect
import array
N = int(eval(input()))
P = list(map(int, input().split()))
P_id = [0]*(N + 1)
for i in range(N):
P_id[P[i]] = i
A = array.array('i', [- 1, P_id[N], N])
res = 0
for i in range(N - 1, 0, - 1):
j = bisect.bisect_left(A, P_id[i])
A.insert(j, P_id[i])
l1 = A[j -... | p02919 |
import bisect
import array
N = int(eval(input()))
P = list(map(int, input().split()))
P_id = [0]*(N + 1)
for i in range(N):
P_id[P[i]] = i
A = array.array('i', [- 1, P_id[N], N])
res = 0
for i in range(N - 1, 0, - 1):
j = bisect.bisect_left(A, P_id[i])
A.insert(j, P_id[i])
l1 = A[j -... | N = int(eval(input()))
P_id = [0]*(N + 1) # P_id[i]は順列Pに置けるiのindex, P[0]は無視
for index, p in enumerate(map(int, input().split())):
P_id[p] = index
left_next_index = list(range(- 1, N - 1)) + ['うんこ', - 1] # + [- 1]ではないことに注意, left_next_index[r1] = l1においてr1 = Nの場合があるから
right_next_index = list(range(1, N + 1)) + ... | p02919 |
class BIT(object):
from operator import add
def __init__(self,A,f=add):
N=len(A)
self.__len=N
self.__f=f
# built (O(N))
self.__bit=A[:] # shallow copy
for i in range(N):
j=i+((i+1)&-(i+1))
if j<N: self.tree[j]=self.func(self.tree[... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
class BIT(object):
def __init__(self,A,dot,e,inv=None):
n=len(A)
self.__n=n
self.__dot=dot
self.__e=e
self.__inv=inv
self.__node=['$']+A #... | p02919 |
#!/usr/bin/python3
import math
import os
import sys
DEBUG = 'DEBUG' in os.environ
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, P):
revp = [-1] * (N + 1)
for i, p in enum... | #!/usr/bin/python3
import math
import os
import sys
DEBUG = 'DEBUG' in os.environ
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, P):
revp = [-1] * (N + 1)
for i, p in enum... | p02919 |
#!/usr/bin/python3
import math
import os
import sys
DEBUG = 'DEBUG' in os.environ
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, P):
revp = [-1] * (N + 1)
for i, p in enum... | #!/usr/bin/python3
import math
import os
import sys
DEBUG = 'DEBUG' in os.environ
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, P):
revp = [-1] * (N + 1)
for i, p in enum... | p02919 |
N = int(eval(input()))
P = list(map(int, input().split()))
class segMax:
inf = 0
def __init__(s, num):
s.N = 1
while s.N < num:
s.N *= 2
s.T = [s.inf] * (2 * s.N - 1)
def do(s, l, r):
#最大値
return max(l, r)
def set(s, L):
for i in range(len(L)):
s.update(i, L[i... | N = int(eval(input()))
P = list(map(int, input().split()))
class BIT:
ini = 0
def __init__(s, num):
s.N = 1
while s.N <= num:
s.N *= 2
s.T = [s.ini] * s.N
def set(s, L):
for i in range(len(L)):
s.update(i, L[i])
def update(s, x, v):
k = x + 1
s.T[k - 1] = max(... | p02919 |
N = int(eval(input()))
P = list(map(int, input().split()))
R = list(range(N))
L = list(range(N))
I = [-1] * (N+1)
for i, p in enumerate(P):
I[p] = i
ans = 0
for n, idx in enumerate(I[1:], 1):
l = idx-1
while l>=0 and l!=L[l]:
l = L[l]
r = idx+1
while r<N and r!=R[r]:
... | N = int(eval(input()))
P = list(map(int, input().split()))
R = list(range(N))
L = list(range(N))
I = [-1] * (N+1)
for i, p in enumerate(P):
I[p] = i
ans = 0
for n, idx in enumerate(I[1:], 1):
l = idx-1
if l>=0:
l = L[l]
r = idx+1
if r<N:
r = R[r]
L[r-1] = l
... | p02919 |
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y... | from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (データ構造): https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (Exclusive OR Queries): https://atcoder.jp/contests/cpsco2019-s1/submissions/7479914
# ... | p02919 |
from bisect import bisect_left, bisect_right, insort_right
class CubeSkipList:
# SkipList の層数を 3 にした感じの何か
# std::multiset の代用になる
def __init__(self, values=None, sorted_=False, cube=100, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: ... | from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (データ構造): https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (Exclusive OR Queries): https://atcoder.jp/contests/cpsco2019-s1/submissions/7482199
# ... | p02919 |
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# s... | # 勝てない つらい
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (データ構造): https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (Exclusive OR Queries): https://atcoder.jp/contests/cpsco2019-s1/submissions/748... | p02919 |
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (データ構造): https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (Exclusive OR Queries): https://atcoder.jp/contests/cpsco2019-s1/submissions/7482199
# ... | # 勝てない つらい
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (add, pop) データ構造: https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (init, add, remove, search_higher_equal) Exclusive OR Queries: https://... | p02919 |
# 勝てない つらい
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (add, pop) データ構造: https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (init, add, remove, search_higher_equal) Exclusive OR Queries: https://... | # 勝てない つらい seedで変わったりしませんか
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (add, pop) データ構造: https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (init, add, remove, search_higher_equal) Exclusive OR Q... | p02919 |
# 勝てない つらい
# Python の bit 演算は遅い（本当に？）
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (add, pop) データ構造: https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (init, add, remove, search_higher_equal) Ex... | # 勝てない つらい
# Python の bit 演算は遅い（本当に？）
from bisect import bisect_left, bisect_right, insort_right
class SquareSkipList:
# SkipList の層数を 2 にした感じの何か
# std::multiset の代用になる
# 検証1 (add, pop) データ構造: https://atcoder.jp/contests/arc033/submissions/7480578
# 検証2 (init, add, remove, search_higher_equal) Ex... | p02919 |
class BIT:
def __init__(self, n):
self.N = n
self.tree = [0]*(n+1)
def BIT_add(self, i):
while i <= self.N:
self.tree[i] += 1
i += i&(-i)
def BIT_sum(self, i):
s = 0
while i:
s += self.tree[i]
i -= i&(-i)
return s
def BIT_search(self, x):... | class BIT:
def __init__(self, N):
self.n = N
self.tree = [0]*(self.n+1)
def bsum(self, i):
s = 0
while i:
s += self.tree[i]
i -= i&(-i)
return s
def badd(self, i, x):
while i<=self.n:
self.tree[i] += x
i += i&(-i)
def bsearch(self, ... | p02919 |
import heapq
n = int(eval(input()))
li = [-1 * int(i) for i in input().split()]
ans = 0
for a in range(len(li)):
li2 = li[a:]
for b in range(len(li2)):
li3 = li2[:b+1]
li4 = heapq.heapify(li3)
if len(li3) >= 2:
heapq.heappop(li3)
ans += ((-1)*heapq.heappop(li3))
print(ans) | n = int(eval(input()))
aa = list(map(int, input().split()))
ans = 0
pos = [0] * (n + 1)
for i, a in enumerate(aa):
pos[a] = i + 2
Lnext = [1, 1] + list(range(1, n + 1)) + [n, n]
Rnext = [3, 3] + list(range(3, n + 3)) + [n + 2, n + 2]
for a in range(1,n + 1):
i = pos[a]
l0 = Lnext[i]
l1 = Ln... | p02919 |
'''
[Bit]
'''
class Bit:
""" used for only int(>=0)
1-indexed (ignore 0-index)
"""
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
self.depth = n.bit_length()
def sum(self, i):
s = 0
while i > 0:
s += sel... |
'''
[Bit]
'''
class Bit:
""" used for only int(>=0)
1-indexed (ignore 0-index)
"""
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
self.depth = n.bit_length()
def sum(self, i):
s = 0
while i > 0:
s += sel... | p02919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.