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)
break
route.append(_next)
if index <= 0:
print((route[k]))
else:
route = route[route.index(route[-1]):-1]
print((route[index % len(route)]))
| 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)
break
route.append(_next)
hit.add(_next)
if index <= 0:
print((route[k]))
else:
route = route[route.index(route[-1]):-1]
print((route[index % len(route)]))
| 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 = []
for _ in range(int(math.log2(K)) + 1):
l = [0] * N
dv.append(l)
for n in range(N):
dv[0][n] = A[n] - 1
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]]
a = []
for i in range(60):
if K>>i & 1:
a.append(i)
now = 0
for i in reversed(a):
now = dv[i][now]
print((now + 1))
pass
if __name__ == '__main__':
main()
| #!/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 = []
for _ in range(60):
l = [0] * N
dv.append(l)
for n in range(N):
dv[0][n] = A[n] - 1
for k in range(1, 60):
for n in range(N):
dv[k][n] = dv[k - 1][dv[k - 1][n]]
a = []
for i in range(60):
if K>>i & 1:
a.append(i)
now = 0
for i in a:
now = dv[i][now]
print((now + 1))
return
if __name__ == '__main__':
main()
| 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=len(S)-cnt2-1
if cnt>=k:
print((S[k]))
else:
print((S2[(k-cnt)%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
else:
S2=S[i:]
break
loop=len(S)-cnt2-1
if cnt>=k:
print((S[k]))
else:
print((S2[(k-cnt)%loop]))
| 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][dp[k][i]]
pos = 0
for k in range(k_bitlen):
if K >> k & 1:
pos = dp[k][pos]
print((pos + 1)) | 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 = dfs(0)
cycle_len = len(path) - path.index(cycle_start)
head_len = len(path) - cycle_len
if K <= head_len:
print((path[K] + 1))
else:
K -= head_len
print((path[head_len + K % cycle_len] + 1))
| 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_pos in queue:
queue.append(next_pos)
now_pos = next_pos
# 循環した
else:
start = next_pos
break
if K <= N:
print((queue[K]))
sys.exit()
before_len = queue.index(start)
roop = len(queue) - before_len
print((queue[before_len + (K - before_len) % roop]))
| 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]] = count
now_town = town_list[now_town - 1]
count += 1
if start == -1:
print(now_town)
sys.exit()
roop = len(queue) - (queue[start] - 1)
before_len = queue[start]
print((list(queue.keys())[(K - before_len) % roop + before_len - 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:
P=A[P-1]
k-=1
print(P)
else:
l=(k-s)%(e-s)
k=s+l+1
while k>1:
P=A[P-1]
k-=1
print(P)
else:
if k<=n:
while k>0:
P=A[P-1]
k-=1
print(P)
else:
while n>0:
P=A[P-1] | 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]
m=(k-l)%r+l
break
p=1
for i in range(m):
p=A[p-1]
print(p) | 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-indexed
for i in range(N + 1):
c = A[c] - 1
# print('c', c)
if c not in T:
T.add(c)
C.append(c)
else:
break
c2 = 0 # 0-indexed
S = deque([0])
for i in range(N + 1):
c2 = A[c2] - 1
if c2 == c:
break
else:
S.append(c2)
# print('C', C)
# print('S', S)
# print('len(C), len(S)', len(C), len(S))
if C[0] == 0:
mod = K % len(C)
ans = C[mod]
else:
if len(S) > K:
ans = S[K]
else:
mod = (K - len(S)) % len(C)
ans = C[mod]
print((ans + 1))
| 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_circles = len(S) - start_idx
# print(f'{start_idx=}, {num_circles=}')
if K < len(S) - 1:
ans = S[K]
else:
K -= start_idx
div, mod = divmod(K, num_circles)
ans = S[start_idx + mod]
print(ans)
| 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:
point=D[s]
break
loop=C[point:]
if k>len(C):
k -=point+1
print((loop[k%len(loop)]))
else:print((C[k-1])) | 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:
point=D[s]
break
loop=C[point:]
if k>len(C):
k -=point
print((loop[k%len(loop)-1]))
else:print((C[k-1])) | 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
if k >= num:
k -= num
p = to[i][p-1]
print(p)
if __name__ == "__main__":
main() | 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
if k >= num:
k -= num
p = to[i][p-1]
print(p)
if __name__ == "__main__":
main() | 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(city)
else:
l2 = l2[first:]
print((l2[(k-first)%(len(l2))]))
else:
print((l2[k])) | 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 - start
k %= period
while k < n:
k += period
print((journey[k])) | 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=slack_que.index(t)
if (ind!=len(slack_que)-1):
start=ind
flag=1
slack_que.pop()
slack=list(slack_que)
slack_num=start
loop_num=len(slack)-slack_num
# print(slack)
# print(start)
# print(slack_num)
# print(loop_num)
#
loop=slack[start:]
# print(loop)
if (K-slack_num)<0:
res=slack[K]+1
else:
tele_num=((K-slack_num)%loop_num)
town=loop[tele_num]
res=town+1
print(res)
if __name__=="__main__":
main()
| 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]
FootPrintA[t]=-1
if t_==-1:
start=slack_que.index(t)
flag=1
slack_que.pop()
t = A[t]
slack=list(slack_que)
slack_num=start
loop_num=len(slack)-slack_num
# print(slack)
# print(start)
# print(slack_num)
# print(loop_num)
#
loop=slack[start:]
# print(loop)
if (K-slack_num)<0:
res=slack[K]+1
else:
tele_num=((K-slack_num)%loop_num)
town=loop[tele_num]
res=town+1
print(res)
if __name__=="__main__":
main()
| 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]
if len(trace) > K:
print((trace[K]))
else:
ind = K - len(trace)
ind = ind % len(loop)
print((loop[ind]))
|
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)
trace[i] = ai # ??
ai = A_list[ai-1]
if len(trace) > K:
print((trace[K]))
else:
ind = K - len(trace)
ind = ind % len(loop)
print((loop[ind]))
| 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 - loop_start
break
if K >= loop_start:
print((visited[loop_start + (K - loop_start) % loop_length]))
else:
print((visited[K]))
| 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_length = i - loop_start
flag = True
break
else:
print(now)
if flag:
print((visited[loop_start + (K - loop_start) % loop_length]))
| 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(circle)
break
trace.append(temp)
#print("temp",temp)
#print((K-i)%len(circle)-1)
if len(circle)!=0:
amari=(K-i)%circle[0]
temp=1
for j in range(i+amari):
temp=A[temp-1]
print(temp) | 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)
#print((K-i)%len(circle)-1)
if len(circle)!=0:
amari=(K-i)%circle[0]
temp=1
for j in range(i+amari):
temp=A[temp-1]
print(temp) | 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))] + 1)) | 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) % (len(route) - l_start))] + 1)) | 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((loop[ans])) | 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:
ans = (k-loop_num)%cnt
print((loop[ans])) | 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):
current = A[current]
if len(visit_dict[current]) == 1 and not is_found_first:
count_to_loop = visit_dict[current][0]
loop_length = i - visit_dict[current][0] + 1
is_found_first = True
visit.append(current)
visit_dict[current].append(i + 1)
if K <= N:
return visit[K] + 1
net_moving_time = ((K - count_to_loop) % loop_length) + count_to_loop
# 上の visit に必要な分だけ付け足してもいいが，実行時間は変わらなかった
current = 0
for _ in range(net_moving_time):
current = A[current]
return current + 1
print((d_teleporter())) | 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_dict: # ループを検出した
j = visit_list.index(current_city) # ここからループ
current_city = visit_list[j + (K - j - 1) % (i - j)]
return current_city + 1
else:
visit_list.append(current_city)
visit_dict[current_city] = current_city
return current_city + 1
print((d_teleporter())) | 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:
print((v[k]+1))
| 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))
else:
print((v[k]+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)]
# print(tl)
# print(tl2)
ans = 0
if k <= len(tl):
ans = tl[k]
else:
k = k - len(tl)
j = k % len(tl2)
ans = tl2[j]
print(ans) | 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)
# print(tl2)
ans = 0
if k < len(tl):
ans = tl[k]
else:
k = k - len(tl)
j = k % len(tl2)
ans = tl2[j]
print(ans) | 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 range(n):
to[i+1][j] = to[i][to[i][j]]
v = 0
for i in range(D-1, -1, -1):
l = 1<<i #2^i個先を見る
if l <= k:
v = to[i][v]
k -= l
print((v+1)) | 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, k = list(map(int, input().split()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
Town = []
rec = [-1] * (n+1) # The town we haven't visited yet is -1
idx = 1
# Loop to the cycle
while (rec[idx] == -1):
rec[idx] = len(Town)
Town.append(idx)
idx = A[idx-1]
# Pre-cycle
Exce = rec[idx]
# Intra-cycle
Cycl = len(Town) - Exce
if Exce > k:
print((Town[k]))
else:
Warp = (k - Exce) % Cycl
print((Town[Exce+Warp]))
main() | 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
#n = input()
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
D = 60 # 10^18 is 60 digits, so we'll see to the 59th power of 2.
MAX_N = 200005 #Namber of nodes
to = [[0 for _ in range(MAX_N)] for _ in range(D)]
# to[i][j]:nodes to 2^i away from j
for i in range(n):
to[0][i] = A[i]
to[0][i] -= 1
# Doubling matrix
for i in range(D-1):
for j in range(n):
to[i+1][j] = to[i][to[i][j]]
v = 0
for i in range(D-1, -1, -1):
l = 1<<i # Look go to 2^i
if l <= k:
v = to[i][v]
k -= l
print((v+1))
main() | #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, 4, 1]
else:
##INPUT
#n = input()
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
D = 60 # 10^18 is 60 digits, so we'll see to the 59th power of 2.
MAX_N = 200005 #Namber of nodes
to = [[0 for _ in range(MAX_N)] for _ in range(D)]
# to[i][j]:nodes to 2^i away from j
for i in range(n):
to[0][i] = A[i]
to[0][i] -= 1
# Doubling matrix
for i in range(D-1):
for j in range(n):
to[i+1][j] = to[i][to[i][j]]
v = 0
for i in range(D-1, -1, -1):
l = 1<<i # Look go to 2^i
if l <= k:
v = to[i][v]
k -= l
print((v+1))
main() | 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)
return
pre = 1
visited = set([1])
visited_l = [1]
for i in range(N):
pre = d[pre]
if pre in visited:
break
visited.add(pre)
visited_l.append(pre)
loop_start = visited_l.index(pre)
loop = i - loop_start + 1
num_loop = (K - loop_start) // loop
now = loop_start + num_loop * loop
for i in range(now+1, K+1):
pre = d[pre]
print(pre)
if __name__ == '__main__':
main() | 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)
return
pre = 1
visited = set([1])
visited_l = [1]
for i in range(N):
pre = d[pre-1]
if pre in visited:
break
visited.add(pre)
visited_l.append(pre)
loop_start = visited_l.index(pre)
loop = i - loop_start + 1
num_loop = (K - loop_start) // loop
now = loop_start + num_loop * loop
for i in range(now+1, K+1):
pre = d[pre-1]
print(pre)
if __name__ == '__main__':
main() | 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 != intersec:
cur = L[cur]
beforeLoop += 1
if k<=beforeLoop:
proceed=k
else:
loopSize = untillBackToIntersec - beforeLoop
proceed=(k - beforeLoop) % (loopSize) + beforeLoop
ans = 0
for _ in range(proceed):
ans = L[ans]
print((ans + 1)) | 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<=intersecInd:
ans=route[k]
else:
loopSize = len(route) - intersecInd
ans = route[(k - intersecInd) % (loopSize) + intersecInd]
print((ans + 1)) | 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) - loop_len
if K < len(route):
print((route[K]+1))
else:
K -= base
m = K % loop_len
idx = route[base:][m]
print((idx+1))
| 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)
now_i = next_i
base = len(route) - loop_len
if K < len(route):
print((route[K]+1))
else:
K -= base
m = K % loop_len
idx = route[base:][m]
print((idx+1))
| 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<once:
print((visit[K]))
else:
order=K-once
print((roop[order%len(roop)])) | 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(visited):]
if K<once:
print((root[K]))
else:
order=K-once
print((roop[order%len(roop)])) | 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
print((c[k]+1))
| 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 %= loop_count
print((c[k]+1))
| 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]:
roop_start = visit[1][visit[0].index(now)] #ループが始めった待ちの最初に訪れた時に何回ループしていたかをroop_startに代入
roop = times - roop_start #何個の町でループしてるかをroopに代入
break
else:
visit[0].append(now)
visit[1].append(times)
if roop > 0:
k = (k - roop_start) % roop
# print(roop_start)
# print(roop)
# print(k)
# print(visit[0])
print((visit[0][roop_start + k] + 1))
# now = 0
# for _ in range(roop_start):
# now = a[now] - 1
# for _ in range(k):
# now = a[now] -1
# print(now+1)
if __name__ == '__main__':
main() | 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] - 1
if visit[1][now] != -1:
roop_start = visit[1][now] #ループが始めった待ちの最初に訪れた時に何回ループしていたかをroop_startに代入
roop = times - roop_start #何個の町でループしてるかをroopに代入
break
else:
visit[0].append(now)
visit[1][now] = len(visit[0]) - 1
if roop > 0:
k = (k - roop_start) % roop
# print(roop_start)
# print(roop)
# print(k)
# print(visit[0])
print((visit[0][roop_start + k] + 1))
# now = 0
# for _ in range(roop_start):
# now = a[now] - 1
# for _ in range(k):
# now = a[now] -1
# print(now+1)
if __name__ == '__main__':
main() | 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 True:
if not nextt in stack:
stack.append(nextt)
else:
stack.append(nextt)
break
nextt = A[nextt]
if len(stack) > K:
print((stack[K]))
exit()
num1 = stack.pop()
length = len(stack)
tmp = []
while True:
num2 = stack.pop()
if num1 != num2:
tmp.append(num2)
else:
tmp.append(num2)
break
tmp = tmp[::-1]
index = (K - length) % len(tmp)
print((tmp[index]))
| 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_dict = {1: True}
while True:
if not visited_dict.get(nextt, False):
stack.append(nextt)
visited_dict[nextt] = True
else:
stack.append(nextt)
break
nextt = A[nextt]
if len(stack) > K:
print((stack[K]))
exit()
num1 = stack.pop()
length = len(stack)
tmp = []
while True:
num2 = stack.pop()
if num1 != num2:
tmp.append(num2)
else:
tmp.append(num2)
break
tmp = tmp[::-1]
index = (K - length) % len(tmp)
print((tmp[index]))
| 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:
break
result = 1
if k > start:
k = (k-start) % gap
result = c
for _ in range(k):
result = a[result]
print(result)
| 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:
print((circle[-1]))
else:
index = circle.index(point)
circle_cut = circle[index:-1]
k = (k-index) % len(circle_cut)
print((circle_cut[k]))
| 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.append(now)
now = a[now]
tenki = lip.index(now)
lis = lip[tenki:]
roop = bunki-tenki
if k < tenki:
print((lip[k]))
exit()
k -= tenki
print((lis[k%roop])) | 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
se.add(now)
lip.append(now)
now = a[now]
tenki = lip.index(now)
lis = lip[tenki:]
roop = bunki-tenki
if k < tenki:
print((lip[k]))
exit()
k -= tenki
print((lis[k%roop])) | 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] #転送された場所
l[now] += 1
if l[now] == 2: #3ループ目の頭
loop = l.count(1) + 1
k %= loop
if k == 0:
ans = now + 1
break
print((max(ans, -1)))
main() | 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 = a[now]
order += 1
if l[now] != -1: #既に訪問済の場合
loop = order - l[now]
k %= loop
if k == 0:
ans = now + 1
break
l[now] = order #転送順で何番目の町かを記録
print((max(ans, -1)))
main() | 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) & 1:
v = to[v][i]
print((v + 1)) | 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
for i in reversed(list(range(D))):
if (K >> i) & 1:
v = to[v][i]
print((v + 1))
if __name__ == "__main__":
main() | 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 = 1
for j, b in enumerate(K):
if b == '1':
i = DP[i][j]
print(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]][j - 1]
i = 1
for j, b in enumerate(bit):
if b == '1':
i = DP[i][j]
print(i)
| 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 solve():
visited = []
stack = deque([1])
x = 1
count = 0
while len(stack) > 0:
x = stack.pop()
if x in visited:
break
visited.append(x)
stack.append(graph[x])
count += 1
if count == K:
print((stack.pop()))
exit()
loop_head = x
head_index = visited.index(loop_head)
loop_len = len(visited) - head_index
r = (K-head_index)%loop_len
print((visited[head_index:][r]))
solve()
if __name__ == "__main__":
main()
| 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():
visited_set = set([])
visited = []
stack = deque([1])
x = 1
count = 0
while len(stack) > 0:
x = stack.pop()
if x in visited_set:
break
visited_set.add(x)
visited.append(x)
stack.append(graph[x])
count += 1
if count == K:
print((stack.pop()))
exit()
loop_head = x
head_index = visited.index(loop_head)
loop_len = len(visited) - head_index
r = (K-head_index)%loop_len
print((visited[head_index:][r]))
solve()
if __name__ == "__main__":
main() | 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 <= s:
print((tele[K]))
else:
K -= s
amari = K%(len(tele[s:len(tele)-1]))
tele = tele[s:len(tele)-1]*2
print((tele[amari]))
| #!/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]]]
break
B[A[tele[-1]]] = i+1
tele.append(A[tele[-1]])
z = tele[-1]
if K <= s:
print((tele[K]+1))
else:
K -= s
amari = K%(len(tele[s:len(tele)]))
tele = tele[s:len(tele)]*2
print((tele[amari]+1))
| 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(ret)
while True:
N = int(eval(input()))
if N == 1: break
ans = ' '.join(list(map(str,factors(N))))
print(('{0}: {1}'.format(N,ans))) | 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 == 0:
ret.append(p)
return ret
while True:
N = int(eval(input()))
if N == 1: break
ans = ' '.join(list(map(str,solve(N))))
print(('{0}: {1}'.format(N,ans))) | 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: %s"%(N," ".join(map(str,ans)))) | 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)] if N%i == 0]
print("%d: %s"%(N," ".join(map(str,ans)))) | 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:
ms_prime[d*prod] = 0
prod += 1
d += 1
return ms_prime
ms_prime = sieve(300000)
while 1:
n = int(input())
if n == 1:
break
sys.stdout.write("%d:" % n)
msp_factor = set()
for i in range(6, n+1):
tmp_factor = 0
if ms_prime[i] == 1 and n % i == 0 and ((n / i) % 7 == 1 or (n / i) % 7 == 6):
sys.stdout.write(" %d" % i)
else :
print("") | 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:
ms_sieve[d*prod] = 0
prod += 1
d += 1
return ms_prime
ms_prime = sieve(300000)
while 1:
n = int(input())
if n == 1:
break
sys.stdout.write("%d:" % n)
for msp in ms_prime:
if msp > n:
break
quot, rem = divmod(n,msp)
if rem != 0:
continue
rem2 = quot % 7
if rem2 == 1 or rem2 == 6:
sys.stdout.write(" %d" % msp)
print("") | 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.node[idx]+=x
idx+=idx&(-idx)
n,m=list(map(int,input().split()))
L=[[] for _ in range(m+1)]
for i in range(n):
l,r=list(map(int,input().split()))
r+=1
L[r-l].append(l)
bit=BIT(m+1)
ans=n
total=0
for d in range(1,m+1):
for l in L[d]:
r=l+d
bit.add(l,1)
bit.add(r,-1)
total+=len(L[d])
ans=n-total
now=0
while now<=m:
ans+=bit.sum(now)
now+=d
print(ans) | 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.node[idx]+=x
idx+=idx&(-idx)
n,m=list(map(int,input().split()))
L=[[] for _ in range(m+1)]
for i in range(n):
l,r=list(map(int,input().split()))
r+=1
L[r-l].append(l)
bit=BIT(m+1)
total=0
for d in range(1,m+1):
for l in L[d]:
r=l+d
bit.add(l,1)
bit.add(r,-1)
total+=len(L[d])
ans=n-total
now=0
while now<=m:
ans+=bit.sum(now)
now+=d
print(ans) | 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 = map(int, input().split())
if left in L:
L[left].add(i)
else:
L[left] = {i}
if (right + 1) in R:
R[right + 1].add(i)
else:
R[right + 1] = {i}
# debug(L, locals())
# debug(R, locals())
eki_kaeru = [set()] * (M + 1)
tmp = set()
for eki in range(M + 1):
if eki in L:
eki_kaeru[eki] = tmp.union(L[eki])
else:
eki_kaeru[eki] = tmp.copy()
if eki in R:
eki_kaeru[eki] -= R[eki]
tmp = eki_kaeru[eki]
# debug(tmp, locals())
# debug(eki_kaeru, locals())
ans = []
for d in range(1, M + 1):
buy = set()
for i in range(0, M + 1, d):
buy = buy.union(eki_kaeru[i])
ans.append(len(buy))
print(*ans, sep='\n')
| 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.sort(key=itemgetter(2))
# print(sects)
print(N)
left = 0
ft = FenwickTree([0]*(M + 1))
for d in range(2, M + 1):
for j in range(left, N):
if sects[j][2] >= d:
left = j
break
else:
ft.add(sects[j][0], 1)
ft.add(sects[j][1], -1)
else:
left = N
# print('left', left)
# print(ft.data)
ans = N - left + sum(ft.get_sum(j) for j in range(d, M + 1, d))
print(ans)
class FenwickTree:
def __init__(self, a):
self.n = len(a)
self.data = [0] + a[:]
for i in range(1, self.n + 1):
if i + (i & (-i)) <= self.n:
self.data[i + (i & (-i))] += self.data[i]
def add(self, i, x):
''' a[i] += x '''
i += 1 # 0-oringn -> 1-origin
while i <= self.n:
self.data[i] += x
i += i & (-i)
def get_sum(self, r):
''' sum[a_0 .. a_r) '''
res = 0
while r > 0:
res += self.data[r]
r -= r & (-r)
return res
if __name__ == '__main__':
solve() | 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 range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
# 内部で1-indexedに変えるので入力は0-indexedでよい
# i項目までの和（i含む）
class BitSum:
def __init__(self, n):
self.n = n + 3
self.table = [0] * (self.n + 1)
def add(self, i, x):
i += 1
while i <= self.n:
self.table[i] += x
i += i & -i
def sum(self, i):
i += 1
res = 0
while i > 0:
res += self.table[i]
i -= i & -i
return res
def main():
n,m=MI()
dlr=[]
for _ in range(n):
l,r=MI()
dlr.append((r-l+1,l,r+1))
dlr.sort()
ans=[0]*(m+1)
bit=BitSum(m+1)
i=0
for k in range(1,m+1):
while i<n and dlr[i][0]<=k:
d,l,r=dlr[i]
bit.add(l,1)
bit.add(r,-1)
i+=1
ans[k]=n-i+sum(bit.sum(a) for a in range(k,m+1,k))
print(*ans[1:],sep="\n")
main()
| 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 range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
# 内部で1-indexedに変えるので入力は0-indexedでよい
# i項目までの和（i含む）
class BitSum:
def __init__(self, n):
self.n = n + 3
self.table = [0] * (self.n + 1)
def add(self, i, x):
i += 1
while i <= self.n:
self.table[i] += x
i += i & -i
def sum(self, i):
i += 1
res = 0
while i > 0:
res += self.table[i]
i -= i & -i
return res
def main():
n,m=MI()
dlr=[]
for _ in range(n):
l,r=MI()
dlr.append((r-l+1,l,r+1))
dlr.sort()
bit=BitSum(m+1)
i=0
for k in range(1,m+1):
while i<n and dlr[i][0]<=k:
d,l,r=dlr[i]
bit.add(l,1)
bit.add(r,-1)
i+=1
print(n-i+sum(bit.sum(a) for a in range(k,m+1,k)))
main()
| 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.size = n
self.tree = [0]*(n+1)
def sum(self, i):
# [0, i) の要素の総和を返す
if not (0 <= i <= self.size): raise ValueError("error!")
s = 0
while i>0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
if not (0 <= i < self.size): raise ValueError("error!")
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
class BitImos:
"""
・範囲すべての要素に加算
・ひとつの値を取得
の2種類のクエリをO(logn)で処理
"""
def __init__(self, n):
self.bit = Bit(n+1)
def add(self, s, t, x):
# [s, t)にxを加算
self.bit.add(s, x)
self.bit.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
# 位置iの値を取得
return self.bit.sum(key+1)
imos = BitImos(M+1)
il = 0
a = N
A = [0]*M
for i in range(1, M+1):
while il<N:
ra, l, r = L[il]
if i < ra:
break
il+=1
a-=1
imos.add(l, r, 1)
ans = 0
for j in range(i, M+1, i):
ans += imos[j]
A[i-1] = ans + a
print(*A, sep="\n")
| 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(5)) # 10
"""
def __init__(self, n):
self.size = n
self.tree = [0]*(n+1)
def sum(self, i):
s = 0
while i>0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
class BitImos:
"""
・範囲すべての要素に加算
・ひとつの値を取得
の2種類のクエリをO(logn)で処理
"""
def __init__(self, n):
self.bit = Bit(n+1)
def add(self, s, t, x):
# [s, t)にxを加算
self.bit.add(s, x)
self.bit.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
# 位置iの値を取得
return self.bit.sum(key+1)
imos = BitImos(M+1)
il = 0
a = N
A = [0]*M
for i in range(1, M+1):
while il<N:
ra, l, r = L[il]
if i < ra:
break
il+=1
a-=1
imos.add(l, r, 1)
ans = 0
for j in range(i, M+1, i):
ans += imos[j]
A[i-1] = ans + a
print(*A, sep="\n")
| 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.size = n
self.tree = [0]*(n+1)
def sum(self, i):
s = 0
while i>0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
class BitImos:
"""
・範囲すべての要素に加算
・ひとつの値を取得
の2種類のクエリをO(logn)で処理
"""
def __init__(self, n):
self.bit = Bit(n+1)
def add(self, s, t, x):
# [s, t)にxを加算
self.bit.add(s, x)
self.bit.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
# 位置iの値を取得
return self.bit.sum(key+1)
imos = BitImos(M+1)
il = 0
a = N
A = [0]*M
for i in range(1, M+1):
while il<N:
ra, l, r = L[il]
if i < ra:
break
il+=1
a-=1
imos.add(l, r, 1)
ans = 0
for j in range(i, M+1, i):
ans += imos[j]
A[i-1] = ans + a
print(*A, sep="\n")
| 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(5)) # 10
"""
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
# [0, i) の要素の総和を返す
if not (0 <= i <= self.size): raise ValueError("error!")
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
if not (0 <= i < self.size): raise ValueError("error!")
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
class BitImos:
"""
・範囲すべての要素に加算
・ひとつの値を取得
の2種類のクエリをO(logn)で処理
"""
def __init__(self, n):
self.bit = Bit(n + 1)
def add(self, s, t, x):
# [s, t)にxを加算
self.bit.add(s, x)
self.bit.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
# 位置iの値を取得
return self.bit.sum(key + 1)
imos = BitImos(M + 1)
il = 0
a = N
A = [0] * M
for i in range(1, M + 1):
while il < N:
ra, l, r = L[il]
if i < ra:
break
il += 1
a -= 1
imos.add(l, r, 1)
ans = 0
for j in range(i, M + 1, i):
ans += imos[j]
A[i - 1] = ans + a
print(*A, sep="\n")
| 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):
while idx <= self.num:
self.BIT[idx] += x
idx += idx&(-idx)
return
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
q={i:[] for i in range(1,M+1)}
for i in range(N):
l,r=list(map(int,input().split()))
q[l].append(r)
query={i:[] for i in range(1,M+1)}
qans={}
for i in range(1,M+1):
for j in range(1,M//i):
query[i*j].append(i*j+i)
qans[(i*j,i*j+i)]=0
bit=BIT(M)
for i in range(1,M+1):
for r in q[i]:
bit.update(r,1)
for r in query[i]:
qans[(i,r)]=bit.query(r-1)-bit.query(i-1)
imos=[0 for i in range(M+2)]
for i in range(1,M+1):
for r in q[i]:
imos[i]+=1
imos[r+1]-=1
for i in range(1,M+1):
imos[i]+=imos[i-1]
for i in range(1,M+1):
res=imos[i*(M//i)]
for j in range(M//i,1,-1):
res+=qans[(i*j-i,i*j)]
print(res) | 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):
while idx <= self.num:
self.BIT[idx] += x
idx += idx&(-idx)
return
import sys
input=sys.stdin.readline
N,M=list(map(int,input().split()))
q={i:[] for i in range(1,M+1)}
imos=[0 for i in range(M+2)]
for i in range(N):
l,r=list(map(int,input().split()))
q[l].append(r)
imos[l]+=1
imos[r+1]-=1
for i in range(1,M+1):
imos[i]+=imos[i-1]
res={i:imos[i*(M//i)] for i in range(1,M+1)}
query={i:[] for i in range(1,M+1)}
for i in range(1,M+1):
for j in range(1,M//i):
query[i*j].append(i*j+i)
bit=BIT(M)
for i in range(1,M+1):
for r in q[i]:
bit.update(r,1)
for r in query[i]:
res[r-i]+=bit.query(r-1)-bit.query(i-1)
for i in range(1,M+1):
print((res[i])) | 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():
n,m = LI()
d = [LI() for _ in range(n)]
a = [1] * (10001)
t = [set([1]),set([1])]
for i in range(2,10001):
if a[i] == 1:
t.append(set([1,i]))
else:
ti = t[a[i]]
c = i//a[i]
ti = ti | set(c*_ for _ in ti)
t.append(ti)
ai = i*2
while ai <= 10000:
a[ai] = i
ai += i
e = [0] * 10001
for l,r in d:
if l*2 < r:
for i in range(1,r+1):
e[i] += 1
continue
s = t[r]
for i in range(l,r):
s = s | t[i]
for c in s:
e[c] += 1
for i in range(1,m+1):
print((e[i]))
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()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
class BIT():
def __init__(self, n):
i = 1
while 2**i <= n:
i += 1
self.H = i
self.N = 2**i
self.A = [0] * self.N
def find(self, i):
r = 0
while i:
r += self.A[i]
i -= i & (i-1) ^ i
return r
def update(self, i, x):
while i < self.N:
self.A[i] += x
i += i & (i-1) ^ i
def query(self, a, b):
return self.find(b-1) - self.find(a-1)
def main():
n,m = LI()
d = collections.defaultdict(list)
for _ in range(n):
l,r = LI()
d[r-l+1].append((l,r))
r = [n]
bit = BIT(m+3)
c = n
for i in range(2,m+1):
for a,b in d[i-1]:
c -= 1
bit.update(a,1)
bit.update(b+1,-1)
t = c
for j in range(i,m+1,i):
t += bit.find(j)
r.append(t)
return '\n'.join(map(str,r))
print(main())
| 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 << 1)
for i, j in enumerate(original, self.N0):
self.seg[i] = j
for i in range(self.N0-1, 0, -1):
self.seg[i] = func(self.seg[2*i], self.seg[2*i+1])
def get(self, i):
return self.seg[i+self.N0]
def update(self, i, x):
i += self.N0
self.seg[i] = x
while i > 1:
y = self.seg[i ^ 1]
i >>= 1
x = self.func(x, y)
self.seg[i] = x
def add(self, i, d):
self.update(i, self.get(i)+d)
def query(self, l, r):
l += self.N0
r += self.N0
nl = self.element
nr = self.element
while l < r:
if l & 1:
nl = self.func(nl, self.seg[l])
l += 1
if r & 1:
nr = self.func(nr, self.seg[r-1])
l >>= 1
r >>= 1
return self.func(nl, nr)
def main():
n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(n)]
A = [0]*(m+2)
for l, r in LR:
A[l] += 1
A[r+1] -= 1
L = Segtree(A, lambda x, y:x+y, 0)
S = sorted([(r-l+1, l, r) for l, r in LR])
cnt = 0
A = []
for i in range(m, 0, -1):
while S and S[-1][0] == i:
c, l, r = S.pop()
cnt += 1
L.add(l, -1)
L.add(r+1, 1)
res = cnt
for j in range(0, m+1, i):
res += L.query(0, j+1)
A.append(res)
print(*A[::-1], sep="\n")
if __name__ == "__main__":
main()
| 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]
i -= i&(-i)
return res
for l, r in LR:
add(l, 1)
add(r+1, -1)
S = sorted([(r-l+1, l, r) for l, r in LR])
cnt = 0
L = []
for i in range(m, 0, -1):
while S and S[-1][0] == i:
c, l, r = S.pop()
cnt += 1
add(l, -1)
add(r+1, 1)
res = cnt
for j in range(0, m+1, i):
res += bit_sum(j)
L.append(res)
print(*L[::-1], sep="\n")
if __name__ == "__main__":
main()
| 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]
i -= i&(-i)
return res
S = sorted([(r-l+1, l, r) for l, r in LR], reverse=True)
cnt = n
L = []
for i in range(1, m+1):
while S and S[-1][0] == i:
c, l, r = S.pop()
cnt -= 1
add(l, 1)
add(r+1, -1)
res = cnt
for j in range(0, m+1, i):
res += bit_sum(j)
L.append(res)
print(*L, sep="\n")
if __name__ == "__main__":
main()
| 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&(-i)
def bit_sum(i):
res = 0
while i > 0:
res += BIT[i]
i -= i&(-i)
return res
cnt = n
for i in range(1, m+1):
for l, r in S[i]:
cnt -= 1
add(l, 1)
add(r+1, -1)
res = cnt
for j in range(0, m+1, i):
res += bit_sum(j)
print(res)
if __name__ == "__main__":
main() | 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):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
if d == 1:
print(n)
continue
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
print(cnt) | 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 & -i
def get_val(self, i):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
if d == 1:
print(n)
continue
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
print(cnt) | 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 & -i
def get_val(self, i):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
print(cnt) | 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 & -i
def get_val(self, i):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = map(int, input().split())
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
res = [0] * m
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
res[d - 1] = cnt
print('\n'.join(map(str, res)), end='\n')
| 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 & -i
def get_val(self, i):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = map(int, input().split())
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
res = [0] * m
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
res[d - 1] = cnt
print('\n'.join(map(str, res)), end='\n')
| 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
i -= i & -i
def get_val(self, i):
"""i番目の値を求める"""
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def add(self, l, r, val):
"""区間[l, r)にvalを加える"""
self._add(r, val)
self._add(l, -val)
n, m = map(int, input().split())
info = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
info[i] = info[i][0], info[i][1], info[i][1] - info[i][0] + 1
info = sorted(info, key=itemgetter(2))
bit = BIT(m + 1)
l_info = 0
ans = n
res = [0] * m
for d in range(1, m + 1):
while True:
if l_info < n and info[l_info][2] < d:
l, r, _ = info[l_info]
bit.add(l, r + 1, 1)
l_info += 1
ans -= 1
else:
break
cnt = ans
for i in range(0, m + 1, d):
cnt += bit.get_val(i)
res[d - 1] = cnt
print('\n'.join(map(str, res)), end='\n')
| 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(x):
ind=2**m-1+x
SUM=0
while ind>=0:
SUM+=tree[ind]
ind=(ind-1)//2
return SUM
N,M=list(map(int,input().split()))
data=[]
for i in range(N):
l,r=list(map(int,input().split()))
data.append([r-l, l, r])
data.sort()
m=0
while pow(2,m)<M+1:
m+=1
tree=[0]*(pow(2,m+1)-1)
i=0
for d in range(1,M+1):
#間隔の長さがd以下の区間だけ考えれば良い。
while i<N and data[i][0]<d:
seg_tree_update(data[i][1],data[i][2])
i+=1
ans=0
for j in range((M+1)//d+1):
if d*j>M:
break
ans+=seg_tree_sumarize(d*j)
print((ans+N-i)) | """
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(N):
l,r=list(map(int,input().split()))
data.append([r-l, l, r])
data.sort()
k=0
tree=[0]*(M+1)
for d in range(1,M+1):
#間隔の長さがd以下の区間だけ考えれば良い。
while k<N and data[k][0]<d:
bit_add(data[k][1],1)
bit_add(data[k][2]+1,-1)
k+=1
ans=0
for j in range(1,M//d+1):
ans+=bit_sum(d*j)
print((ans+N-k)) | 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 bitaddR(l,r,w,bit1,bit2): #半開区間[l,r)にwを加える
bitadd(l,-1*w*l,bit1)
bitadd(r,w*r,bit1)
bitadd(l,w,bit2)
bitadd(r,-1*w,bit2)
def bitsumR(r,bit1,bit2): #半開区間[1,r)の区間和
return bitsum(r,bit1) + r * bitsum(r,bit2)
N,M = list(map(int,input().split()))
bitA = [0] * (M+2)
bitB = [0] * (M+2)
len_LR = []
for i in range(N):
l,r = list(map(int,input().split()))
len_LR.append([r-l,l,r])
len_LR.sort()
len_LR.append([float("inf"),0,float("inf")])
ind = 0
ns = N
ans = []
for d in range(M):
d += 1
while len_LR[ind][2]-len_LR[ind][1]+1 < d:
bitaddR(len_LR[ind][1] , len_LR[ind][2]+1 , 1 ,bitA,bitB)
ns -= 1
ind += 1
np = 0
for i in range(d,M+1,d):
np += bitsumR(i+1,bitA,bitB) - bitsumR(i,bitA,bitB)
ans.append(ns + np)
print(("\n".join(map(str,ans))))
|
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で初期化しておくべし)
def bitaddR(l,r,w,bit1,bit2): #半開区間[l,r)にwを加える
bitadd(l,-1*w*l,bit1)
bitadd(r,w*r,bit1)
bitadd(l,w,bit2)
bitadd(r,-1*w,bit2)
def bitsumR(r,bit1,bit2): #半開区間[1,r)の区間和
return bitsum(r,bit1) + r * bitsum(r,bit2)
N,M = list(map(int,input().split()))
BIT = [0] * (M+1)
dic = {}
for i in range(N):
l,r = list(map(int,input().split()))
if r-l+1 not in dic:
dic[r-l+1] = []
dic[r-l+1].append([l,r])
ind = 0
ns = N
ans = []
for d in range(M):
d += 1
if d in dic:
for L,R in dic[d]:
bitadd(L , 1 ,BIT)
bitadd(R+1 , -1 , BIT)
ns -= 1
nm = 0
for i in range(d,M+1,d):
nm += bitsum(i,BIT)
ans.append(nm+ns)
print(("\n".join(map(str,ans))))
| 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__':
main()
|
# ..
# .gMMN;
# .HMMMR ....-, .gggggggJJ...
# .J,. TMMN; ..JgNMMMMMMM{dMMMMMMMMMMMMNNgJ..
# .MMMNx. ?MMb .JNMMMMMMMMMMMMrJMMMMMMMMMMMMMMMMMNmJ.
# ?MMMMMNe. ?MN, .iMMMMMMMMMMMMMMMMP(MMMMMMMMMMMMMMMMMMMMMb .`(zvvvvrOO+. .(wvO- _(vvvvvrOz+. _(ro _(rl
# ?THMMNm. -"!.NMMMMMMMMMMMMMMMMMH%.WHHMMMMMMMMMMMMMMMMMM^ ~ zvC~~~?<?Ovo. !(rrrI `_(vO!~~?<1Oro. _(vI _(rI
# ..... ~7W$ ...MMMMMMMMMMMMB0C1????> dZZZZZZZZZWHMMMMMMMB! ~ zv> _ Orl -.vvrrv; _(vI _(Ov{ _(rI _(rI
# dMMMMMNNNme .jMMNmTMMMMMMMBC?????????> duZuZuZZuZZZZZXHMMY ~ zv> _ zvI ~jvv<?vw. _(rI .zr{ _(rI _(rI
# dMMMMBY"=!`.MMMMMMNmTMMM6????????????z_jZuZZuZuZuZuZZZZC` ~ zv> ._JvZ! _-vI` _jv> _(vI _(rr! _(rO-....(-JrI
# (MMMMMMMMMD ?1??=?=??=???=?=_(ZZZuZZZZZuZuZV! ~ zvw&+xzzwOC! ._zv: _.ww_ _(vr&J+xzzrC! _(rrrrrrvrrrrI
# .dMMMMMMMMMD_.- ?1?=?????=???=_(ZZuZZuZuZZZX=` ~ zvZ7I1vv> _(vv&..-(rro _(rvC777<<` _(vZ!````~_jrI
# .dMMMMMMMMM=.....- ?1??=??????=<(SZZuZZuZZZV! ~ zv> _.1rO- ..wrOOOOOOOrw- _(vZ _(vI _(vI
# (MMMMMMMM#!........- <?=???=??=:.SZuZZuZZ0> ~ zv> -?ww- ~jvv ~(vO _(rI _(rI _(rI
# .MMMMMMMM#!......_(J-.-.<?=?????>.ZZZuZZZC` ~ zv> _(Or+ _.rZ` -zv{ _(rI _(vI _(rI
# dMMMMMMMMt.......(TMNm,.-.<=??=?> XZZZZV! ~ zv> _(Or+..~zv> _(vw._(vI _(rI _(rI
# .MMMMMMMM#_.........?WMNm,.--<=??z_dZZ0=` ~ zw: _.OO>_.rC` _jr>_(rC _(rC _(rC
# (MMMMMMMMD.......-gNNMMMM$...--<?v`dZV~...
# dX0vrOz<_``. -7Y=<~_....... <gMMMMNNmgJJ... <-. (<
# jMMMMMMMNZ???>>+++++(((((----... dMMMMMMMMMMMMMMNNagJ... (<z!
# dMMMMMMMMR??>??>?>??>?>??>?????< ?MMMMMMMMMMMMMMMMMMMMMMNNm, .+>?1.
# JMMMMMMMMK>?????>??>??>?>???<<_(+_ (,?HMMMMMMMMMMMMMMMMMMMMMMMMm. ` `
# (MMMMMMMMN+?>>?>??>?>????<<_(;::<_Jyyx?rttrZVVHMMMMMMMMMMMMMMMMMb ...-....... .... ..-....... .... ...
# .MMMMMMMMNy?>?>?>????<<~_(;::;:;!.Xyyy+(rrtrtrttrrZUWMMMMMMMMMMMM; _.vrOOOOOwvO+. ~(rrw_ _jrrOOOOrvO- - jv> _ wv:
# dMMMMMMMMN+??????<<~-(;;::;;:;< jVyyyWo(trtrrtrtttrtrwMMMMMMMMMM] _.vZ~ ~_zvI. ..wrrvl _jv> ~?Oro -`jr> ~ Ov:
# .MMMMMMMMMR>??<<_-(;;::;;:;:;;!.XyyyyyWo(OrttrtrrtrttrdMMMMMMMMM\ _.vZ_ ~.vv> .~jvOOvr- _jv{ ~(vr_-`jv> ~ Or:
# (MMMMMMMMMC!_-(;;::;:;::;:;;< dVyyyyyyy+(OrrtrtrrtrtrdMMMMMMMMM! _.vZ_ ~.vr: _.vI`~(vI. _jv{ ~-vr!-`jv> _ wr:
# ?MMMMM#5uJ+;;;;:;;:;:;:;::;~.XyyyyyyyyV+(OrtrttrtrrdMMMMMMMMM@ _.vw- ..-(rr> ._zv: -zv: _jvl ..(zvC -`jvO((((J+Jrv:
# ?YY1(gMMMMN+::;:;:;:;;:;;< dyyyyyyyyyyW+.OrtrrtrwdMMMMMMMMMM\ _.vrrrrrrrZ<` _(vI ~(rO. _jrrrrrrvOC! -`jrOCCCCOCOrr:
# dMMMMMMMMNm+;::;:;::;:;`.VyyyyyyyyyyyWo.OrttrQMMMMMMMMMMMF _.vO><~jrw_ .-wrrOzzzwrvl _jvZ!!!~` -`jv> ~ Ov: . d=7n v=7h .d=7h.
# ?MMMMMMMMMMMmx+;:;:;:;< dyyyyyyyyyyyyVy{.zrQNMMMMMMMMMMMF _.vZ_ -.?rw- _(vZ<<<<<71ww_ _jv{ -`jv> ~ Or: (h (3dIJR.W=! .(= .(= ,$ d{
# .TMMMMMMMMMMMMNma+<;<`(yyyyyyyyyyyyyyyV{.dMMMMMMMMMMMMD _.vZ_ _?wr- _.rZ` _jvl _jv{ -`jv> ~ Or: (m$ 4,.,.V .,.(R-... .R-. ..W..f`
# (TMMMMMMMMMMMMMMMN;.dkkWWWWWWkQQQNNMMMm(MMMMMMMMMM#^ _.vZ_ _(wv+ ._jv> __Ov- _jr{ -`jv> ~ Or: `
# .TMMMMMMMMMMMMMM<dMMMMMMMMMMMMMMMMMMMN,HMMMMMM#= _.vZ_ _.Oro._.rZ` _(rI._jv{ -`jv> ~ Ov:
# _THMMMMMMMMMF(MMMMMMMMMMMMMMMMMMMMMN,WMMMD! _.CC` ~.7C`~?C! _7C`_?C! _?7! _.?C!
# _?TMMMMM1MMMMMMMMMMMMMMMMMMMMMMMF `
# ` THMMMMMMMMMMMMMMMB9""!`
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__':
main()
| 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 collections import deque
#from collections import defaultdict
#from collections import Counter
#from itertools import accumulate
#from itertools import groupby
#from itertools import permutations
#from itertools import combinations
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import floyd_warshall
#from scipy.sparse.csgraph import csgraph_from_dense
#from scipy.sparse.csgraph import dijkstra
#sys.setrecursionlimit(10**7)
#map(int,input().split())
def main():
n=int(eval(input()))
print(((n-1)//2))
if __name__ == '__main__':
main() | 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,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
def main():
n=II()
print(((n-1)//2))
if __name__ == "__main__":
main()
| 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.stdin.readline()) for i in range(n))
n = inp()
if n%2:
print((n//2))
else:
print((n//2-1)) | 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(key=lambda x: abs(x-seq[-1]), reverse=True)
points.sort(key=lambda x: (x-seq[-1]).norm() * pre.norm())
p = [(x-seq[-1]).norm() * pre.norm() for x in points]
seq += [points.pop()]
print(round(sum(abs(v2 - v1) for v1, v2 in zip(seq[1:], seq[2:])), 1))
class Vector(tuple):
def __neg__(self):
return Vector([-x for x in self])
def __abs__(self):
return sum(x ** 2 for x in self) ** 0.5
def __add__(self, v):
if len(self) != len(v):
raise ValueError("Same dimension is required.")
return Vector([x1 + x2 for x1, x2 in zip(self, v)])
def __sub__(self, v):
return self.__add__(-v)
def norm(self):
a = self.__abs__()
return Vector([x / a for x in self])
def __mul__(self, v):
"""dot product"""
if len(self) != len(v):
raise ValueError("Same dimension is required.")
# sum(x1 * x2 for x1, x2 in zip(self, v))
return round(sum(x1 * x2 for x1, x2 in zip(self, v)), 14)
if __name__ == "__main__":
main() | 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(key=lambda x: abs(x-seq[-1]), reverse=True)
points.sort(key=lambda x: (x-seq[-1]).norm() * pre.norm())
seq += [points.pop()]
print(round(sum(abs(v2 - v1) for v1, v2 in zip(seq[1:], seq[2:])), 1))
class Vector(tuple):
def __neg__(self):
return Vector([-x for x in self])
def __abs__(self):
return sum(x ** 2 for x in self) ** 0.5
def __add__(self, v):
if len(self) != len(v):
raise ValueError("Same dimension is required.")
return Vector([x1 + x2 for x1, x2 in zip(self, v)])
def __sub__(self, v):
return self.__add__(-v)
def norm(self):
a = self.__abs__()
return Vector([x / a for x in self])
def __mul__(self, v):
"""dot product"""
if len(self) != len(v):
raise ValueError("Same dimension is required.")
return round(sum(x1 * x2 for x1, x2 in zip(self, v)), 14)
if __name__ == "__main__":
main() | 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 -1
r1 = memo[b+0] if b < N-p else N
r2 = memo[b+1] if b < N-p-1 else N
ans += p * ((r1-i)*(l1-l2) + (i-l1)*(r2-r1))
insort(memo, i)
print(ans)
| 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]
l1 = L[i]
l2 = L[l1] if l1 >= 0 else -1
r1 = R[i]
r2 = R[r1] if r1 < N else N
ans += p * ((r1-i)*(l1-l2) + (i-l1)*(r2-r1))
print(ans)
| 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を持つ
# BITは一番最後の1ビットの位置が重要なので0ではなく1始まり。そのためNまでループする
def BIT_add(i):
while i <= N:
tree[i] += 1
i += i&(-i)
def BIT_sum(i):
s = 0
while i:
s += tree[i]
i -= i&(-i)
return s
def BIT_search(x):
# 二分探索。和がx以上となる最小のインデックス(>= 1)を返す
# i = 0
# s = 0
# step = 1<<(N.bit_length()-1)
# while step:
# if i+step <= N and s + tree[i+step] < x:
# i += step
# s += tree[i]
# step >>= 1
# return i+1
left = 0
right = N
while right - left > 1:
mid = (left + right) // 2
if BIT_sum(mid) >= x:
right = mid
else:
left = mid
return right
tree = [0] * (N+1)
answer = 0
for x in range(N,0,-1):
c = p_to_i[x]
L = BIT_sum(c) # 左にある既に書き込んだ数の個数
BIT_add(c)
R = N-x-L # 右にある既に書き込んだ数の個数
a = BIT_search(L-1) if L >= 2 else 0
b = BIT_search(L) if L >= 1 else 0
d = BIT_search(L+2) if R >= 1 else N+1
e = BIT_search(L+3) if R >= 2 else N+1
coef = 0
if b != 0:
# [b,c]を含むようにする。(a,b) と(c,d)が自由
coef += (b-a) * (d-c)
if d != 0:
# [c,d]を含むようにする。
coef += (e-d) * (c-b)
answer += x * coef
print(answer)
|
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は一番最後の1ビットの位置が重要なので0ではなく1始まり。そのためNまでループする
def BIT_add(i):
while i <= N:
tree[i] += 1
i += i&(-i)
def BIT_sum(i):
s = 0
while i:
s += tree[i]
i -= i&(-i)
return s
def BIT_search(x):
# 二分探索。和がx以上となる最小のインデックス(>= 1)を返す
# i = 0
# s = 0
# step = 1<<(N.bit_length()-1)
# while step:
# if i+step <= N and s + tree[i+step] < x:
# i += step
# s += tree[i]
# step >>= 1
# return i+1
left = 0
right = N
while right - left > 1:
mid = (left + right) // 2
if BIT_sum(mid) >= x:
right = mid
else:
left = mid
return right
tree = [0] * (N+1)
answer = 0
for x in range(N,0,-1):
c = p_to_i[x]
L = BIT_sum(c) # 左にある既に書き込んだ数の個数
BIT_add(c)
R = N-x-L # 右にある既に書き込んだ数の個数
a = BIT_search(L-1) if L >= 2 else 0
b = BIT_search(L) if L >= 1 else 0
d = BIT_search(L+2) if R >= 1 else N+1
e = BIT_search(L+3) if R >= 2 else N+1
coef = 0
if b != 0:
# [b,c]を含むようにする。(a,b) と(c,d)が自由
coef += (b-a) * (d-c)
if d != 0:
# [c,d]を含むようにする。
coef += (e-d) * (c-b)
answer += x * coef
print(answer)
| 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
cnt = 3
for i, p in q[1:]:
l_i = bisect(le,i,2,cnt)
LL = le[l_i-2]
LR = le[l_i-1]
RL = le[l_i]
RR = le[l_i+1]
ans += p*((LR-LL)*(RL-i)+(RR-RL)*(i-LR))
insort(le,i)
cnt += 1
return ans
n = int(readline())
ppp = list(map(int,readline().split()))
print((solve(n, ppp))) | 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):
s = 0
while i:
s += tree[i]
i -= i&(-i)
return s
def BIT_search(x):
# 二分探索。和がx以上となる最小のインデックス(>= 1)を返す
i = 0
s = 0
step = 1<<(n.bit_length()-1)
while step:
if i+step <= n and s + tree[i+step] < x:
i += step
s += tree[i]
step >>= 1
return i+1
q = sorted(enumerate(ppp,1),key=itemgetter(1),reverse=True)
tree = [0]*(n+1)
ans = 0
for i, p in q:
L = BIT_sum(i) # 左にある既に書き込んだ数の個数
BIT_add(i,1)
R = n-p-L # 右にある既に書き込んだ数の個数
LL = BIT_search(L-1) if L >= 2 else 0
LR = BIT_search(L) if L >= 1 else 0
RL = BIT_search(L+2) if R >= 1 else n+1
RR = BIT_search(L+3) if R >= 2 else n+1
ans += p*((LR-LL)*(RL-i)+(RR-RL)*(i-LR))
print(ans) | 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_max = first_max
first_max = p[j]
elif p[j] > second_max:
second_max = p[j]
ans += second_max
print(ans)
| 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[root] > key:
if avl_left[root] == None:
return None
else:
return search(avl_left[root],key)
if avl_key[root] < key:
if avl_right[root] == None:
return None
else:
return search(avl_right[root],key)
return root
##end_lower/higher:search_lower/higherで使用
def end_lower(root):
if avl_left[root] == None:
return avl_key[root]
else:
return end_lower(avl_left[root])
def end_higher(root):
if avl_right[root] == None:
return avl_key[root]
else:
return end_higher(avl_right[root])
##search_lower(0,x,None):O(logN)
# xより小さいものの中で最も大きいものを出力。ない場合はNoneを出力
def search_lower(root,key,lower_key):
if avl_key[root] > key:
if avl_left[root] == None:
return lower_key
else:
return search_lower(avl_left[root],key,lower_key)
if avl_key[root] < key:
lower_key = avl_key[root]
if avl_right[root] == None:
return lower_key
else:
return search_lower(avl_right[root],key,lower_key)
# ==
if avl_left[root] == None:
return lower_key
else:
if lower_key == None:
return end_higher(avl_left[root])
else:
return max(lower_key,end_higher(avl_left[root]))
##search_higher(0,x,None):O(logN)
# xより大きいものの中で最も小さいものを出力。ない場合はNoneを出力
def search_higher(root,key,higher_key):
if avl_key[root] > key:
higher_key = avl_key[root]
if avl_left[root] == None:
return higher_key
else:
return search_higher(avl_left[root],key,higher_key)
if avl_key[root] < key:
if avl_right[root] == None:
return higher_key
else:
return search_higher(avl_right[root],key,higher_key)
# ==
if avl_right[root] == None:
return higher_key
else:
if higher_key == None:
return end_lower(avl_right[root])
else:
return min(higher_key,end_lower(avl_right[root]))
##Rotation,replace,insertx:insertで使用
def DoubleRightRotation(x):
tl = avl_left[x]
avl_left[x] = avl_right[avl_right[tl]]
avl_right[avl_right[tl]] = x
tlr = avl_right[tl]
avl_right[tl] = avl_left[tlr]
avl_left[tlr] = tl
if balance[tlr] == -1:
balance[avl_right[tlr]] = 1
balance[avl_left[tlr]] = 0
elif balance[tlr] == 1:
balance[avl_right[tlr]] = 0
balance[avl_left[tlr]] = -1
else:
balance[avl_right[tlr]] = 0
balance[avl_left[tlr]] = 0
balance[tlr] = 0
return tlr
def DoubleLeftRotation(x):
tr = avl_right[x]
avl_right[x] = avl_left[avl_left[tr]]
avl_left[avl_left[tr]] = x
trl = avl_left[tr]
avl_left[tr] = avl_right[trl]
avl_right[trl] = tr
if balance[trl] == 1:
balance[avl_right[trl]] = 0
balance[avl_left[trl]] = -1
elif balance[trl] == -1:
balance[avl_left[trl]] = 0
balance[avl_right[trl]] = 1
else:
balance[avl_right[trl]] = 0
balance[avl_left[trl]] = 0
balance[trl] = 0
return trl
def SingleLeftRotation(x):
tr = avl_right[x]
balance[tr] = 0
balance[x] = 0
avl_right[x] = avl_left[tr]
avl_left[tr] = x
return tr
def SingleRightRotation(x):
tl = avl_left[x]
balance[tl] = 0
balance[x] = 0
avl_left[x] = avl_right[tl]
avl_right[tl] = x
return tl
def replace(x,p,v):
if avl_left[p] == x:
avl_left[p] = v
else:
avl_right[p] = v
def insertx(root,p,key):
if avl_key[root] > key:
if avl_left[root] == None:
avl_key.append(key)
avl_left[root] = len(avl_key)-1
else:
if not insertx(avl_left[root],root,key):
return False
if balance[root] == 1:
balance[root] = 0
return False
elif balance[root] == 0:
balance[root] = -1
return True
else:
if balance[avl_left[root]] == 1:
replace(root,p,DoubleRightRotation(root))
elif balance[avl_left[root]] == -1:
replace(root,p,SingleRightRotation(root))
return False
if avl_key[root] < key:
if avl_right[root] == None:
avl_key.append(key)
avl_right[root] = len(avl_key)-1
else:
if not insertx(avl_right[root],root,key):
return False
if balance[root] == -1:
balance[root] = 0
return False
elif balance[root] == 0:
balance[root] = 1
return True
else:
if balance[avl_right[root]] == -1:
replace(root,p,DoubleLeftRotation(root))
elif balance[avl_right[root]] == 1:
replace(root,p,SingleLeftRotation(root))
return False
return False
##insert(0,x):O(logN)
#x追加
def insert(root,key):
if key < avl_key[root]:
if avl_left[root] == None:
avl_key.append(key)
avl_left[root] = len(avl_key)-1
else:
insertx(avl_left[root],root,key)
elif key > avl_key[root]:
if avl_right[root] == None:
avl_key.append(key)
avl_right[root] = len(avl_key)-1
else:
insertx(avl_right[root],root,key)
else:
pass
n=int(eval(input()))
arr=list(map(int,input().split()))
arr2=[[arr[i],i+1] for i in range(n)]
arr2=sorted(arr2,reverse=True,key=lambda x:x[0])
avl_key=[0]
avl_left=[None]*(n+2)
avl_right=[None]*(n+2)
balance=[0]*(n+2)
ans=0
insert(0,n+1)
for val,pos in arr2:
fl=search_lower(0,pos,None)
if fl==0:
sl=0
else:
sl=search_lower(0,fl,None)
fr=search_higher(0,pos,None)
if fr==n+1:
sr=n+1
else:
sr=search_higher(0,fr,None)
cnt=(fl-sl)*(fr-pos)+(pos-fl)*(sr-fr)
ans+=cnt*val
insert(0,pos)
print(ans) | #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(int)
◯.data == x のものが存在するある場合それを出力、ない場合 None を返す
insert(x: int) -> None
◯.data == x がない場合 ◯.data == x なる頂点を作る。ある場合はなにもしない（上書きしない）
y.to_s() -> int
頂点yのdataを返す
y.left_s() -> Union(int, key=None)
頂点yのleftを返す(ない場合は key)
search_lower(x: int, key_lower) -> int
○.data が x より小さいものの中で最も大きいものを出力、ない場合 key_lower を返す
search_higher(x:int , key_higher) -> int
○.data が x より大きいものの中で最も小さいものを出力、ない場合 key_higher を返す
"""
def __init__(self, key=None):
self.key = key
self.left = None
self.right = None
self.balance = "Even"
def search(self, key):
node = self
while node is not None:
if node.key == key:
return node # node.key == keyの場合
if node.key > key:
node = node.left
elif node.key < key:
node = node.right
return None
def search_lower(self, key, key_lower):
node = self
if node.key is None:
return key_lower
ans = key_lower
while node is not None:
if node.key < key:
if ans < node.key:
ans = node.key
node = node.right
elif node.key >= key:
node = node.left
return ans
def search_higher(self, key, key_higher):
node = self
if node.key is None:
return key_higher
ans = key_higher
while node is not None:
if node.key > key:
if ans > node.key:
ans = node.key
node = node.left
elif node.key <= key:
node = node.right
return ans
def end_lower(self, end_lower_key):
node = self
while node.left is not None:
node = node.left
return node.key
def end_higher(self, end_higher_key):
node = self
while node.right is not None:
node = node.right
return node.key
def DoubleRightRotation(self):
tl = self.left
self.left = tl.right.right
tl.right.right = self # selfはそのノード
tlr = tl.right
tl.right = tlr.left
tlr.left = tl
if tlr.balance == "Left":
tlr.right.balance = "Right"
tlr.left.balance = "Even"
elif tlr.balance == "Right":
tlr.right.balance = "Even"
tlr.left.balance = "Left"
elif tlr.balance == "Even":
tlr.right.balance = "Even"
tlr.left.balance = "Even"
tlr.balance = "Even"
return tlr
def DoubleLeftRotation(self):
tr = self.right
self.right = tr.left.left
tr.left.left = self
trl = tr.left
tr.left = trl.right
trl.right = tr
if trl.balance == "Right":
trl.left.balance = "Left"
trl.right.balance = "Even"
elif trl.balance == "Left":
trl.left.balance = "Even"
trl.right.balance = "Right"
elif trl.balance == "Even":
trl.left.balance = "Even"
trl.right.balance = "Even"
trl.balance = "Even"
return trl
def SingleLeftRotation(self):
tr = self.right
tr.balance = "Even"
self.balance = "Even"
self.right = tr.left
tr.left = self
return tr
def SingleRightRotation(self):
tl = self.left
tl.balance = "Even"
self.balance = "Even"
self.left = tl.right
tl.right = self
return tl
def replace(self, p, v): # 親ノードpの下にある自分(self)をvに置き換える。
if p.left == self:
p.left = v
else:
p.right = v
def insert(self, key): # rootでのみ呼ばれる挿入
if self.key is None: # rootを含むrotationはしないことにする。
self.key = key
return self
if key < self.key:
if self.left is None:
self.left = Avltree(key)
else:
self.left.insertx(self, key)
elif key > self.key:
if self.right is None:
self.right = Avltree(key)
else:
self.right.insertx(self, key)
else: # key == self.key:
pass # do not overwrite
def insertx(self, p, key): # replaceを呼ぶために一つ上の親を持っているinsert
node = self
s = []
while True:
if node.key > key:
s.append((node, -1))
if node.left is None:
node.left = Avltree(key)
node = node.left
break
else:
node = node.left
elif node.key < key:
s.append((node, 1))
if node.right is None:
node.right = Avltree(key)
node = node.right
break
else:
node = node.right
while len(s) != 0:
node, direct = s.pop()
if len(s) != 0:
par = s[-1][0]
else:
par = p
if direct == -1:
if node.balance == "Right":
node.balance = "Even"
break
elif node.balance == "Even":
node.balance = "Left"
elif node.balance == "Left":
if node.left.balance == "Right":
node.replace(par, node.DoubleRightRotation())
elif node.left.balance == "Left":
node.replace(par, node.SingleRightRotation())
break
elif direct == 1:
if node.balance == "Left":
node.balance = "Even"
break
elif node.balance == "Even":
node.balance = "Right"
elif node.balance == "Right":
if node.right.balance == "Left":
node.replace(par, node.DoubleLeftRotation())
elif node.right.balance == "Right":
node.replace(par, node.SingleLeftRotation())
break
def to_s(self):
return self.key
def left_s(self):
if self.left is None:
return None
return (self.left).key
def right_s(self):
if self.right is None:
return None
return (self.right).key
n=int(eval(input()))
arr=list(map(int,input().split()))
arr2=[[arr[i],i+1] for i in range(n)]
arr2=sorted(arr2,reverse=True,key=lambda x:x[0])
avl=Avltree()
ans=0
avl.insert(0)
avl.insert(n+1)
for val,pos in arr2:
fl=avl.search_lower(pos,0)
if fl==0:
sl=0
else:
sl=avl.search_lower(fl,0)
fr=avl.search_higher(pos,n+1)
if fr==n+1:
sr=n+1
else:
sr=avl.search_higher(fr,n+1)
cnt=(fl-sl)*(fr-pos)+(pos-fl)*(sr-fr)
ans+=cnt*val
avl.insert(pos)
print(ans) | 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
v.size -= u.rch.size + 1 if u.rch is not None else 1
v.rch = u.lch
u.lch = v
if u.bias == -1:
u.bias = v.bias = 0
else:
u.bias = 1
v.bias = -1
return u
def rotate_right(self, v):
u = v.lch
u.size = v.size
v.size -= u.lch.size + 1 if u.lch is not None else 1
v.lch = u.rch
u.rch = v
if u.bias == 1:
u.bias = v.bias = 0
else:
u.bias = -1
v.bias = 1
return u
def rotateLR(self, v):
u = v.lch
t = u.rch
t.size = v.size
v.size -= u.size - (t.rch.size if t.rch is not None else 0)
u.size -= t.rch.size + 1 if t.rch is not None else 1
u.rch = t.lch
t.lch = u
v.lch = t.rch
t.rch = v
self.update_bias_double(t)
return t
def rotateRL(self, v):
u = v.rch
t = u.lch
t.size = v.size
v.size -= u.size - (t.lch.size if t.lch is not None else 0)
u.size -= t.lch.size + 1 if t.lch is not None else 1
u.lch = t.rch
t.rch = u
v.rch = t.lch
t.lch = v
self.update_bias_double(t)
return t
def update_bias_double(self, v):
if v.bias == 1:
v.rch.bias = -1
v.lch.bias = 0
elif v.bias == -1:
v.rch.bias = 0
v.lch.bias = 1
else:
v.rch.bias = 0
v.lch.bias = 0
v.bias = 0
def add(self, key):
if self.root is None:
self.root = Node(key)
return
v = self.root
history = []
while v is not None:
if key < v.key:
history.append((v, 1))
v = v.lch
elif v.key < key:
history.append((v, -1))
v = v.rch
else:
return
p, pdir = history[-1]
if pdir == 1:
p.lch = Node(key)
else:
p.rch = Node(key)
while history:
v, direction = history.pop()
v.bias += direction
v.size += 1
new_v = None
b = v.bias
if b == 0:
break
if b == 2:
u = v.lch
if u.bias == -1:
new_v = self.rotateLR(v)
else:
new_v = self.rotate_right(v)
break
if b == -2:
u = v.rch
if u.bias == 1:
new_v = self.rotateRL(v)
else:
new_v = self.rotate_left(v)
break
if new_v is not None:
if len(history) == 0:
self.root = new_v
return
p, pdir = history.pop()
p.size += 1
if pdir == 1:
p.lch = new_v
else:
p.rch = new_v
while history:
p, pdir = history.pop()
p.size += 1
def remove(self, key):
v = self.root
history = []
while v is not None:
if key < v.key:
history.append((v, 1))
v = v.lch
elif v.key < key:
history.append((v, -1))
v = v.rch
else:
break
else:
return False
if v.lch is not None:
history.append((v, 1))
lmax = v.lch
while lmax.rch is not None:
history.append((lmax, -1))
lmax = lmax.rch
v.key = lmax.key
v = lmax
c = v.rch if v.lch is None else v.lch
if history:
p, pdir = history[-1]
if pdir == 1:
p.lch = c
else:
p.rch = c
else:
self.root = c
return True
while history:
new_p = None
p, pdir = history.pop()
p.bias -= pdir
p.size -= 1
b = p.bias
if b == 2:
if p.lch.bias == -1:
new_p = self.rotateLR(p)
else:
new_p = self.rotate_right(p)
elif b == -2:
if p.rch.bias == 1:
new_p = self.rotateRL(p)
else:
new_p = self.rotate_left(p)
elif b != 0:
break
if new_p is not None:
if len(history) == 0:
self.root = new_p
return True
gp, gpdir = history[-1]
if gpdir == 1:
gp.lch = new_p
else:
gp.rch = new_p
if new_p.bias != 0:
break
while history:
p, pdir = history.pop()
p.size -= 1
return True
def member(self, key):
v = self.root
while v is not None:
if key < v.key:
v = v.lch
elif v.key < key:
v = v.rch
else:
return True
return False
def lower_bound(self, key):
ret = None
v = self.root
while v is not None:
if v.key >= key:
if ret is None or ret > v.key:
ret = v.key
v = v.lch
else:
v = v.rch
return ret
def upper_bound(self, key):
ret = None
v = self.root
while v is not None:
if v.key <= key:
if ret is None or ret < v.key:
ret = v.key
v = v.rch
else:
v = v.lch
return ret
def find_kth_element(self, k):
"""0オリジン
"""
v = self.root
s = 0
while v is not None:
t = s+v.lch.size if v.lch is not None else s
if t == k:
return v.key
elif t < k:
s = t+1
v = v.rch
else:
v = v.lch
return None
def __contains__(self, key): return self.member(key)
def __delitem__(self, key): return self.remove(key)
def __bool__(self): return self.root is not None
def __len__(self): return self.root.size if self.root is not None else 0
if __name__ == '__main__':
N = int(eval(input()))
P = [(p, i) for i, p in enumerate(map(int, input().split()))]
P.sort()
T = AVLTree()
_, i = P.pop()
T.add(i)
ans = 0
while P:
p, i = P.pop()
T.add(i)
r = T.lower_bound(i+1)
if r is None:
r = N
rr = T.lower_bound(r+1)
if rr is None:
rr = N
l = T.upper_bound(i-1)
if l is None:
l = -1
ll = T.upper_bound(l-1)
if ll is None:
ll = -1
ans += p*((l-ll)*(r-i) + (rr-r)*(i-l))
print(ans)
| 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.bias == -1:
u.bias = v.bias = 0
else:
u.bias = 1
v.bias = -1
return u
def rotate_right(self, v):
u = v.lch
v.lch = u.rch
u.rch = v
if u.bias == 1:
u.bias = v.bias = 0
else:
u.bias = -1
v.bias = 1
return u
def rotateLR(self, v):
u = v.lch
t = u.rch
u.rch = t.lch
t.lch = u
v.lch = t.rch
t.rch = v
self.update_bias_double(t)
return t
def rotateRL(self, v):
u = v.rch
t = u.lch
u.lch = t.rch
t.rch = u
v.rch = t.lch
t.lch = v
self.update_bias_double(t)
return t
def update_bias_double(self, v):
if v.bias == 1:
v.rch.bias = -1
v.lch.bias = 0
elif v.bias == -1:
v.rch.bias = 0
v.lch.bias = 1
else:
v.rch.bias = 0
v.lch.bias = 0
v.bias = 0
def add(self, key):
if self.root is None:
self.root = Node(key)
return
v = self.root
history = []
while v is not None:
if key < v.key:
history.append((v, 1))
v = v.lch
elif v.key < key:
history.append((v, -1))
v = v.rch
else:
return
p, pdir = history[-1]
if pdir == 1:
p.lch = Node(key)
else:
p.rch = Node(key)
while history:
v, direction = history.pop()
v.bias += direction
new_v = None
b = v.bias
if b == 0:
break
if b == 2:
u = v.lch
if u.bias == -1:
new_v = self.rotateLR(v)
else:
new_v = self.rotate_right(v)
break
if b == -2:
u = v.rch
if u.bias == 1:
new_v = self.rotateRL(v)
else:
new_v = self.rotate_left(v)
break
if new_v is not None:
if len(history) == 0:
self.root = new_v
return
p, pdir = history.pop()
if pdir == 1:
p.lch = new_v
else:
p.rch = new_v
def lower_bound(self, key):
ret = None
v = self.root
while v is not None:
if v.key >= key:
if ret is None or ret > v.key:
ret = v.key
v = v.lch
else:
v = v.rch
return ret
def upper_bound(self, key):
ret = None
v = self.root
while v is not None:
if v.key <= key:
if ret is None or ret < v.key:
ret = v.key
v = v.rch
else:
v = v.lch
return ret
if __name__ == '__main__':
N = int(eval(input()))
P = [(p, i) for i, p in enumerate(map(int, input().split()))]
P.sort()
T = AVLTree()
_, i = P.pop()
T.add(i)
T.add(-1)
T.add(N)
ans = 0
while P:
p, i = P.pop()
l = T.upper_bound(i)
r = T.lower_bound(i)
ll = T.upper_bound(l-1)
if ll is None:
ll = -1
rr = T.lower_bound(r+1)
if rr is None:
rr = N
ans += p*((l-ll)*(r-i) + (rr-r)*(i-l))
T.add(i)
print(ans) | 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):
w = i = 0
k = N0
while k:
if i+k <= N and w + data[i+k] <= x:
w += data[i+k]
i += k
k >>= 1
return i+1
E = [(v, i) for i, v in enumerate(P)]
E.sort(reverse=1)
add(1, 1)
add(N+1, 1)
ans = 0
for v, i in E:
k = get(i+2)
l1 = lower_bound(k-2)
l0 = lower_bound(k-1)
r0 = lower_bound(k)
r1 = lower_bound(k+1)
if l0 > 1:
ans += (l0-l1) * (r0 - (i+2)) * v
if r0 < N+2:
ans += (r1-r0) * (i+2 - l0) * v
add(i+2, 1)
print(ans) | 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[i]
ans += ((r1 - r0) * (i - l0) + (r0 - i) * (l0 - l1)) * v
print(ans) | 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]
ans += ((l1-l2)*(r1-f) + (f-l1)*(r2-r1))*j
l[r1] = l1
r[l1] = r1
print(ans) | 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:
c = p[j]
if dp[i][j-1][0] < c:
if dp[i][j-1][1] < c:
dp[i][j] = (dp[i][j-1][1], c)
else:
dp[i][j] = (c, dp[i][j-1][1], c)
else:
dp[i][j] = dp[i][j-1]
ans += dp[i][j][0]
print(ans)
| 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:
c = p[j]
if dp[i][j-1][0] < c:
if dp[i][j-1][1] < c:
dp[i][j] = (dp[i][j-1][1], c)
else:
dp[i][j] = (c, dp[i][j-1][1])
else:
dp[i][j] = dp[i][j-1]
ans += dp[i][j][0]
print(ans)
| 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(largeind)-2
smaller = 1
while larger-smaller!=1:
medium = int((larger+smaller)/2)
if largeind[medium]>target:
larger = medium
else:
smaller = medium
# largeind.insert(larger,target)
largeind[larger:larger]=[target]
L1ind = largeind[larger-1]
L2ind = largeind[larger-2]
R1ind = largeind[larger+1]
R2ind = largeind[larger+2]
x += ((L1ind-L2ind)*(R1ind-target) + (target-L1ind)*(R2ind-R1ind))*P[i]
print(x)
if __name__ == "__main__":
main()
| 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]-1]
R1ind = RR[target]
R2ind = RR[ min(R1ind,N-1) ]
L1ind = LL[target]
L2ind = LL[ max(L1ind,0) ]
x += ((L1ind-L2ind)*(R1ind-target) + (target-L1ind)*(R2ind-R1ind))*P[i]
if L1ind!=-1:
RR[L1ind] = R1ind
if R1ind!=N:
LL[R1ind] = L1ind
print(x)
if __name__ == "__main__":
main()
| 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:
r = t.right.height
else:
r = 0
if l >= r:
t.height = l + 1
else:
t.height = r + 1
class AVL:
def __init__(self):
self.root = Node()
def insert(self, key):
#値の挿入
if self.root.key is None:
self.root.key = key
return
cursor = self.root
while cursor:
p = cursor
if key == cursor.key:
return
elif key < cursor.key:
cursor = cursor.left
else:
cursor = cursor.right
new_node = Node(key)
new_node.parent = p
if key < p.key:
p.left = new_node
else:
p.right = new_node
#バランスの確認
cursor = p
while cursor:
if cursor.left is not None:
l = cursor.left.height
else:
l = 0
if cursor.right is not None:
r = cursor.right.height
else:
r = 0
balance = l - r
if balance == 0:
break
elif balance == 2:
if key < cursor.left.key:
self.rotate_r(cursor)
else:
self.rotate_lr(cursor)
break
elif balance == -2:
if key > cursor.right.key:
self.rotate_l(cursor)
else:
self.rotate_rl(cursor)
break
else:
update_height(cursor)
cursor = cursor.parent
def rotate_r(self, n):
p = n.parent
c = n.left
gc = n.left.right
if gc is not None:
n.left = gc
gc.parent = n
else:
n.left = None
c.right = n
n.parent = c
if p is not None:
if p.right == n:
p.right = c
else:
p.left = c
c.parent = p
else:
self.root = c
self.root.parent = None
update_height(n)
update_height(c)
def rotate_l(self, n):
p = n.parent
c = n.right
gc = n.right.left
if gc is not None:
n.right = gc
gc.parent = n
else:
n.right = None
c.left = n
n.parent = c
if p is not None:
if p.left == n:
p.left = c
else:
p.right = c
c.parent = p
else:
self.root = c
self.root.parent = None
update_height(n)
update_height(c)
def rotate_rl(self, n):
p = n.parent
c = n.right
gc = n.right.left
if gc.left and gc.right:
n.right = gc.left
c.left = gc.right
gc.left.parent = n
gc.right.parent = c
elif gc.left:
n.right = gc.left
gc.left.parent = n
c.left = None
elif gc.right:
c.left = gc.right
gc.right.parent = c
n.right = None
else:
n.right = None
c.left = None
gc.left = n
gc.right = c
n.parent = gc
c.parent = gc
if p is not None:
if p.left == n:
p.left = gc
else:
p.right = gc
gc.parent = p
else:
self.root = gc
self.root.parent = None
update_height(n)
update_height(c)
update_height(gc)
def rotate_lr(self, n):
p = n.parent
c = n.left
gc = n.left.right
if gc.left and gc.right:
c.right = gc.left
n.left = gc.right
gc.left.parent = c
gc.right.parent = n
elif gc.left:
c.right = gc.left
gc.left.parent = c
n.left = None
elif gc.right:
n.left = gc.right
gc.right.parent = n
c.right = None
else:
n.left = None
c.right = None
gc.left = c
gc.right = n
c.parent = gc
n.parent = gc
if p is not None:
if p.left == n:
p.left = gc
else:
p.right = gc
gc.parent = p
else:
self.root = gc
self.root.parent = None
update_height(n)
update_height(c)
update_height(gc)
def find(self, key):
cursor = self.root
while cursor:
if cursor.key == key:
return cursor
if key < cursor.key:
cursor = cursor.left
else:
cursor = cursor.right
return None
def next_greater_key(self, cursor):
if cursor is None:
return None
if cursor.right:
cursor = cursor.right
while cursor.left:
cursor = cursor.left
return cursor
elif cursor.parent.left == cursor:
return cursor.parent
elif cursor.parent.right == cursor:
while cursor.parent and cursor.parent.right == cursor:
cursor = cursor.parent
if cursor.parent:
return cursor.parent
else:
return None
def next_smaller_key(self, cursor):
if cursor is None:
return None
if cursor.left:
cursor = cursor.left
while cursor.right:
cursor = cursor.right
return cursor
elif cursor.parent.right == cursor:
return cursor.parent
elif cursor.parent.left == cursor:
while cursor.parent and cursor.parent.left == cursor:
cursor = cursor.parent
if cursor.parent:
return cursor.parent
else:
return None
def get_smaller_key(self, key):
cursor = self.find(key)
l1 = self.next_smaller_key(cursor)
l2 = self.next_smaller_key(l1)
if l2 is None:
l2 = 0
else:
l2 = l2.key
return l1.key, l2
def get_greater_key(self, key):
cursor = self.find(key)
r1 = self.next_greater_key(cursor)
r2 = self.next_greater_key(r1)
if r2 is None:
r2 = 0
else:
r2 = r2.key
return r1.key, r2
def main():
N = int(eval(input()))
P = list(map(int, input().split()))
idx = [-1] * (N + 1)
for i, v in enumerate(P, 1):
idx[v] = i
avl = AVL()
for i in [0, idx[N], N+1]:
avl.insert(i)
total = 0
for j in range(N - 1, 0, -1):
n = idx[j]
avl.insert(n)
l1_idx , l2_idx = avl.get_smaller_key(n)
l1 = n - l1_idx
if l1_idx != 0:
l2 = l1_idx - l2_idx
else:
l2 = 0
r1_idx, r2_idx = avl.get_greater_key(n)
r1 = r1_idx - n
if r1_idx != N + 1:
r2 = r2_idx - r1_idx
else:
r2 = 0
cnt = (l1 * r2 + r1 * l2) * j
total += cnt
print(total)
if __name__ == '__main__':
main() | 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):
if self.root.key is None:
self.root.key = key
return
cursor = self.root
while cursor:
p = cursor
if key == cursor.key:
return
elif key < cursor.key:
cursor = cursor.left
else:
cursor = cursor.right
new_node = Node(key)
new_node.parent = p
if key < p.key:
p.left = new_node
else:
p.right = new_node
return self.rebalance(p, new_node, key)
def rebalance(self, u, v, key):
while u.key != 'nil':
if u.key > v.key:
if u.balance == 'R':
u.balance = 'E'
return
elif u.balance == 'L':
if v.balance == 'L':
self.rotate_R(u, v)
return
elif v.balance == 'R':
self.rotate_LR(u, v)
return
else:
u.balance = 'L'
v = u
u = u.parent
else:
if u.balance == 'L':
u.balance = 'E'
return
elif u.balance == 'R':
if v.balance == 'R':
self.rotate_L(u, v)
return
elif v.balance == 'L':
self.rotate_RL(u, v)
return
else:
u.balance = 'R'
v = u
u = u.parent
def replace(self, u, v):
if u.parent.left == u:
u.parent.left = v
else:
u.parent.right = v
v.parent = u.parent
if v.parent.key == 'nil':
self.root = v
def rotate_R(self, u, v):
w = v.right
self.replace(u, v)
v.right = u
u.parent = v
u.left = w
if w:
w.parent = u
u.balance = 'E'
v.balance = 'E'
def rotate_L(self, u, v):
w = v.left
self.replace(u, v)
v.left = u
u.parent = v
u.right = w
if w:
w.parent = u
u.balance = 'E'
v.balance = 'E'
def rotate_LR(self, u, v):
w = v.right
self.replace(u, w)
if w.left:
v.right = w.left
v.right.parent = v
else:
v.right = None
if w.right:
u.left = w.right
u.left.parent = u
else:
u.left = None
v.parent = w
w.left = v
u.parent = w
w.right = u
if w.balance == 'R':
u.balance = 'E'
v.balance = 'L'
elif w.balance == 'L':
u.balance ='R'
v.balance = 'E'
else:
u.balance = 'E'
v.balance = 'E'
w.balance = 'E'
def rotate_RL(self, u, v):
w = v.left
self.replace(u, w)
if w.left:
w.left.parent = u
u.right = w.left
else:
u.right = None
if w.right:
w.right.parent = v
v.left = w.right
else:
v.left = None
u.parent = w
w.left = u
v.parent = w
w.right = v
if w.balance == 'R':
u.balance = 'L'
v.balance = 'E'
elif w.balance == 'L':
u.balance ='E'
v.balance = 'R'
else:
u.balance = 'E'
v.balance = 'E'
w.balance = 'E'
def find(self, key):
cursor = self.root
while cursor:
if cursor.key == key:
return cursor
if key < cursor.key:
cursor = cursor.left
else:
cursor = cursor.right
return None
def next_greater_key(self, cursor):
if cursor is None:
return
if cursor.right:
cursor = cursor.right
while cursor.left:
cursor = cursor.left
return cursor
elif cursor.parent.left == cursor:
return cursor.parent
elif cursor.parent.right == cursor:
while cursor.parent.key != 'nil' and cursor.parent.right == cursor:
cursor = cursor.parent
if cursor.parent.key != 'nil':
return cursor.parent
else:
return None
def next_smaller_key(self, cursor):
if cursor is None:
return
if cursor.left:
cursor = cursor.left
while cursor.right:
cursor = cursor.right
return cursor
elif cursor.parent.right == cursor:
return cursor.parent
elif cursor.parent.left == cursor:
while cursor.parent.key != 'nil' and cursor.parent.left == cursor:
cursor = cursor.parent
if cursor.parent.key != 'nil':
return cursor.parent
def get_smaller_key(self, key):
cursor = self.find(key)
l1 = self.next_smaller_key(cursor)
l2 = self.next_smaller_key(l1)
if l2 is None:
l2 = 0
else:
l2 = l2.key
return l1.key, l2
def get_greater_key(self, key):
cursor = self.find(key)
r1 = self.next_greater_key(cursor)
r2 = self.next_greater_key(r1)
if r2 is None:
r2 = 0
else:
r2 = r2.key
return r1.key, r2
def main():
# import random
import sys
# N = 100000
# P = list(range(1, N + 1))
# random.shuffle(P)
input = sys.stdin.readline
N = int(eval(input()))
P = list(map(int, input().split()))
idx = [-1] * (N + 1)
for i, v in enumerate(P, 1):
idx[v] = i
avl = AVL()
for i in [0, idx[N], N+1]:
avl.insert(i)
total = 0
for j in range(N - 1, 0, -1):
n = idx[j]
avl.insert(n)
l1_idx , l2_idx = avl.get_smaller_key(n)
l1 = n - l1_idx
if l1_idx != 0:
l2 = l1_idx - l2_idx
else:
l2 = 0
r1_idx, r2_idx = avl.get_greater_key(n)
r1 = r1_idx - n
if r1_idx != N + 1:
r2 = r2_idx - r1_idx
else:
r2 = 0
cnt = (l1 * r2 + r1 * l2) * j
total += cnt
print(total)
if __name__ == '__main__':
main() | 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):
"""
[0,i)
"""
result = 0
while i > 0:
result += self.data[i]
i -= i & -i
return result
__getitem__ = sum
def lower_bound(self, v):
"""
return smallest i such that v < sum(data[:i])
"""
s,pos = 0,0
N = self.size
k = N
while k > 0:
i = pos+k
if i <= N:
x = s+self.data[i]
if x < v:
s = x
pos = i
k >>= 1
return pos
def naive(P):
def it():
for i in range(len(P)-1):
for j in range(i+1,len(P)):
yield sorted(P[i:j+1])[-2]
return sum(it())
def solve(P):
def it():
bit = BinaryIndexedTree(len(P))
for cnt, (v,i) in enumerate(sorted(((v,i) for i,v in enumerate(P)), reverse=True)):
bit.add(i,1)
c = bit.sum(i)
low1 = -1 if c <= 0 else bit.lower_bound(c)
low2 = -1 if c <= 1 else bit.lower_bound(c-1)
up1 = len(P) if c > cnt-1 else bit.lower_bound(c+2)
up2 = len(P) if c > cnt-2 else bit.lower_bound(c+3)
yield v*((up1-i)*(low1-low2)+(i-low1)*(up2-up1))
return sum(it())
if __name__ == '__main__':
N = int(eval(input()))
P = list(map(int,input().split()))
print((solve(P))) | 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):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def __getitem__(self, i):
"""
[0,i)
"""
if isinstance(i, slice):
return self.get_sum(i.stop) if i.start is None else self.get_sum(i.stop) - self.get_sum(i.start)
else:
return 0 # fake value
__setitem__ = add
def bisect_left(self, v):
"""
return smallest i s.t v <= sum[:i]
"""
i = 0
k = self.msb
while k > 0:
i += k
if i < len(self.data) and self.data[i] < v:
v -= self.data[i]
else:
i -= k
k >>= 1
return i
def bisect_right(self, v):
"""
return smallest i s.t v < sum[:i]
"""
i = 0
k = self.msb
while k > 0:
i += k
if i < len(self.data) and self.data[i] <= v:
v -= self.data[i]
else:
i -= k
k >>= 1
return i
bisect = bisect_right
def naive(P):
def it():
for i in range(len(P)-1):
for j in range(i+1,len(P)):
yield sorted(P[i:j+1])[-2]
return sum(it())
def solve(P):
def it():
bit = BinaryIndexedTree(len(P))
for cnt, (v,i) in enumerate(sorted(((v,i) for i,v in enumerate(P)), reverse=True)):
bit[i] += 1
c = bit.get_sum(i)
low1 = -1 if c <= 0 else bit.bisect_left(c)
low2 = -1 if c <= 1 else bit.bisect_left(c-1)
up1 = len(P) if c > cnt-1 else bit.bisect_left(c+2)
up2 = len(P) if c > cnt-2 else bit.bisect_left(c+3)
yield v*((up1-i)*(low1-low2)+(i-low1)*(up2-up1))
return sum(it())
if __name__ == '__main__':
N = int(eval(input()))
P = list(map(int,input().split()))
print((solve(P))) | 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):
# 注: 同じiへのクエリは複数来ないことを利用して単純化
i += self.n2
self.tree[i][0] = x
while i > 1:
i >>= 1
sti = self.tree[i]
if sti[0] > x:
sti[1] = sti[0]
sti[0] = x
elif sti[1] > x:
sti[1] = x
def get(self, a, b):
result = [self.ini, self.ini]
self._get(a, b, 1, 0, self.n2, result)
return result
def _get(self, a, b, k, l, r, result):
"""
[a, b)の最小値を得る内部関数
:param k: 現在調べている区間のtree内index
:param l, r: kが表す区間の左右端index [l, r)
"""
# 範囲外ならINF
if r <= a or b <= l:
return
# [a,b)が完全に[l,r)を包含するならtree[k]の値を採用
if a <= l and r <= b:
stk = self.tree[k]
if result[0] > stk[0]:
result[1] = min(result[0], stk[1])
result[0] = stk[0]
elif result[1] > stk[0]:
result[1] = stk[0]
return
# 一部だけ範囲内なら2つに分けて再帰的に調査
m = (l + r) // 2
self._get(a, b, k << 1, l, m, result)
self._get(a, b, (k << 1) + 1, m, r, result)
def solve(n, ppp):
str = SegmentTree(n, n)
right = []
for i in range(n - 1, -1, -1):
p = ppp[i]
right.append(str.get(p, n))
str.update(p - 1, i)
right.reverse()
ans = 0
stl = SegmentTree(n, 1)
for i in range(n):
p = ppp[i]
l1, l2 = stl.get(p, n)
l1, l2 = -l1, -l2
r1, r2 = right[i]
ans += p * ((l1 - l2) * (r1 - i) + (r2 - r1) * (i - l1))
stl.update(p - 1, -i)
return ans
n = int(eval(input()))
ppp = list(map(int, input().split()))
print((solve(n, ppp)))
| 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):
# 注: 同じiへのクエリは複数来ないことを利用して単純化
i += self.n2
self.tree[i][0] = x
while i > 1:
i >>= 1
sti = self.tree[i]
if sti[0] > x:
sti[1] = sti[0]
sti[0] = x
elif sti[1] > x:
sti[1] = x
def get(self, a, b):
result = [self.ini, self.ini]
q = [(1, 0, self.n2)]
while q:
k, l, r = q.pop()
if a <= l and r <= b:
stk = self.tree[k]
if result[0] > stk[0]:
result[1] = min(result[0], stk[1])
result[0] = stk[0]
elif result[1] > stk[0]:
result[1] = stk[0]
continue
m = (l + r) // 2
k <<= 1
if a < m and l < b:
q.append((k, l, m))
if a < r and l < m:
q.append((k + 1, m, r))
return result
def solve(n, ppp):
str = SegmentTree(n, n)
right = []
for i in range(n - 1, -1, -1):
p = ppp[i]
right.append(str.get(p, n))
str.update(p - 1, i)
right.reverse()
ans = 0
stl = SegmentTree(n, 1)
for i in range(n):
p = ppp[i]
l1, l2 = stl.get(p, n)
l1, l2 = -l1, -l2
r1, r2 = right[i]
ans += p * ((l1 - l2) * (r1 - i) + (r2 - r1) * (i - l1))
stl.update(p - 1, -i)
return ans
n = int(eval(input()))
ppp = list(map(int, input().split()))
print((solve(n, ppp)))
| 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):
i = pos[a]
insort(fin,i)
j = bisect_left(fin, i)
ans += (a + 1) * ((fin[j - 1] - fin[j - 2]) * (fin[j + 1] - fin[j])
+ (fin[j] - fin[j - 1]) * (fin[j + 2] - fin[j + 1]))
# print(a, ans, fin)
print(ans)
main()
| # 参考 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)) + [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 = Lnext[l0]
r0 = Rnext[i]
r1 = Rnext[r0]
ans += a * ((l0 - l1) * (r0 - i) + (i - l0) * (r1 - r0))
Lnext[r0] = l0
Rnext[l0] = r0
print(ans)
main()
| 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 = bisect.bisect_right(s,c)
a = s[now-2]
b = s[now-1]
d = s[now]
e = s[now+1]
count = (b-a)*(d-c) + (e-d)*(c-b)
s.insert(now,c)
ans += count*(i+1)
print(ans)
if __name__ == "__main__":
main() | 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))
r[l1]=r1
l[r1]=l1
print(ans)
| 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] - A[j + 1]) + (A[j - 1] - A[j - 2])*(A[j + 1] - A[j]))
print(res) | 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 - 1]
r1 = A[j + 1]
l2 = l1
r2 = r1
if l1 != - 1:
l2 = A[j - 2]
if r1 != N:
r2 = A[j + 2]
res += i*((A[j] - l1)*(r2 - r1) + (l1 - l2)*(r1 - A[j]))
print(res) | 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 - 1]
r1 = A[j + 1]
l2 = l1
r2 = r1
if l1 != - 1:
l2 = A[j - 2]
if r1 != N:
r2 = A[j + 2]
res += i*((A[j] - l1)*(r2 - r1) + (l1 - l2)*(r1 - A[j]))
print(res) | 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)) + [N, 'うんこ']
res = 0
for p in range(1, N):
l1 = left_next_index[P_id[p]]
l2 = left_next_index[l1]
r1 = right_next_index[P_id[p]]
r2 = right_next_index[r1]
res += p*((l1 - l2)*(r1 - P_id[p]) + (P_id[p] - l1)*(r2 - r1))
left_next_index[r1] = l1
right_next_index[l1] = r1
print(res) | 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[i],self.tree[j])
def __repr__(self):
return str(self.tree)
@property
def func(self):
return self.__f
@property
def tree(self): # getterにしてる意味あんまない
return self.__bit
def add(self,i,w):
while(i<self.__len):
self.tree[i]=self.func(self.tree[i],w)
i+=(i+1)&-(i+1)
def sum(self,i):
res=0
while(i>-1):
res=self.func(res,self.tree[i])
i-=(i+1)&-(i+1)
return res
def bisect_left(self,w):
# sum(A)より大きければ一番右
if w>self.sum(self.__len-1): return self.__len
# 1個しかなく、右じゃないなら左
elif self.__len==1: return 0
# それ以外だと、len未満の2のべき乗からスタート
n=2**((self.__len-1).bit_length()-1)
res=0
while(n):
if res+n-1>self.__len-1: # index over(2べきじゃないときに起こる)
n//=2
continue
if w<=self.tree[res+n-1]: # 左にいく
n//=2
else: # 右にいく
w-=self.tree[res+n-1]
res+=n
n//=2
return res
def bisect_right(self,w):
if w>=self.sum(self.__len-1): return self.__len
elif self.__len==1: return 0
n=2**((self.__len-1).bit_length()-1)
res=0
while(n):
if w<self.tree[res+n-1]:
n//=2
else:
w-=self.tree[res+n-1]
res+=n
n//=2
return res
# input
n=int(eval(input()))
A=list(map(int,input().split()))
# built idx
idx=[0]*n
for i,a in enumerate(A): idx[a-1]=i
# built bit
bit=BIT([0]*n)
# calculate
score=0
for k in range(n,0,-1):
i=idx[k-1]
bit.add(i,1)
s=bit.sum(i)
# 0.5を引くことでbisect_left=bisect_right
l0=bit.bisect_left(s-1.5)-(s<=1) # 一番左を含むか含まないかで場合分け
l1=bit.bisect_left(s-2.5)-(s<=2) # 一番左を含むか含まないかで場合分け
r0=bit.bisect_left(s+0.5)
r1=bit.bisect_left(s+1.5)
score+=k*((l0-l1)*(r0-i)+(r1-r0)*(i-l0))
print(score)
| 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 # 1-indexed
for i in range(1,n+1):
j=i+(i&-i)
if(j<=n): self.__node[j]=dot(self.__node[i],self.__node[j])
def add(self,i,w=1):
i+=1
while(i<=self.__n):
self.__node[i]=self.__dot(self.__node[i],w)
i+=i&-i
def sum(self,i):
i+=1
res=self.__e
while(i>0):
res=self.__dot(res,self.__node[i])
i-=i&-i
return res
def range_sum(self,l,r):
assert(self.__inv)
return self.__inv(self.sum(r),self.sum(l))
def bisect_left(self,w,increase=True):
if(w>self.sum(self.__n-1)): return self.__n
n=2**((self.__n-1).bit_length())
res=0
while(n>0):
if(res+n<=self.__n and ((w>self.__node[res+n])^(not increase))):
w-=self.__node[res+n]
res+=n
n//=2
return res
def resolve():
n=int(eval(input()))
A=list(map(int,input().split()))
idx=[0]*n
for i,a in enumerate(A): idx[a-1]=i
from operator import add
bit=BIT([0]*n,add,0)
# calculate
ans=0
for k in range(n,0,-1):
i=idx[k-1]
bit.add(i)
s=bit.sum(i)
l0=bit.bisect_left(s-1)-(s<=1)
l1=bit.bisect_left(s-2)-(s<=2)
r0=bit.bisect_left(s+1)
r1=bit.bisect_left(s+2)
ans+=k*((l0-l1)*(r0-i)+(r1-r0)*(i-l0))
print(ans)
resolve() | 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 enumerate(P):
revp[p] = i
segt = [[(v, 0) for v in P]]
while len(segt[-1]) > 1:
base = segt[-1]
if len(base) % 2 == 1:
base.append((0, 0))
new = []
for i in range(len(base) // 2):
a, b = base[2 * i]
c, d = base[2 * i + 1]
arr = [a, b, c, d]
arr.sort()
new.append((arr[-1], arr[-2]))
segt.append(new)
dprint('segt', segt)
def get12_rec(i, j, segi):
if j - i <= 0:
return (0, 0)
seg = segt[segi]
if j - i == 1:
return seg[i]
arr = []
if i % 2 == 1:
a, b = seg[i]
arr.append(a)
arr.append(b)
i += 1
if j % 2 == 1:
a, b = seg[j - 1]
arr.append(a)
arr.append(b)
j -= 1
a, b = get12_rec(i // 2, j // 2, segi + 1)
arr.append(a)
arr.append(b)
arr.sort()
return arr[-1], arr[-2]
def get12(i, j):
return get12_rec(i, j, 0)
cache = [dict() for _ in range(N)]
stk = [(0, N)]
while stk:
item = stk.pop()
if len(item) == 2:
i, j = item
if j in cache[i]:
continue
a, b = get12(i, j)
ai = revp[a]
bi = revp[b]
li, ri = (ai, bi) if ai < bi else (bi, ai)
ri += 1
sc = b * (li - i + 1) * (j - ri + 1)
want = [(i, ri - 1), (li + 1, j), (li + 1, ri - 1)]
req = []
for c, d in want:
if not (d - c < 2 or d in cache[c]):
req.append((c, d))
if not req:
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
continue
stk.append((i, j, want, sc))
for r in req:
stk.append(r)
continue
i, j, want, sc = item
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
return cache[0][N]
def main():
N = int(inp())
P = [int(e) for e in inp().split()]
print(solve(N, P))
if __name__ == '__main__':
main()
| #!/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 enumerate(P):
revp[p] = i
segt = [[(v, 0) for v in P]]
while len(segt[-1]) > 1:
base = segt[-1]
if len(base) % 2 == 1:
base.append((0, 0))
new = []
for i in range(len(base) // 2):
a, b = base[2 * i]
c, d = base[2 * i + 1]
arr = [a, b, c, d]
arr.sort()
new.append((arr[-1], arr[-2]))
segt.append(new)
dprint('segt', segt)
def get12(i, j):
if j - i <= 0:
return (0, 0)
segi = 0
top = []
while True:
if j - i <= 0:
break
seg = segt[segi]
if j - i == 1:
top.extend(seg[i])
break
if i % 2 == 1:
top.extend(seg[i])
i += 1
if j % 2 == 1:
top.extend(seg[j - 1])
j -= 1
i //= 2
j //= 2
segi += 1
top.sort()
return top[-1], top[-2]
cache = [dict() for _ in range(N)]
stk = [(0, N)]
while stk:
item = stk.pop()
if len(item) == 2:
i, j = item
if j in cache[i]:
continue
a, b = get12(i, j)
ai = revp[a]
bi = revp[b]
li, ri = (ai, bi) if ai < bi else (bi, ai)
ri += 1
sc = b * (li - i + 1) * (j - ri + 1)
want = [(i, ri - 1), (li + 1, j), (li + 1, ri - 1)]
req = []
for c, d in want:
if not (d - c < 2 or d in cache[c]):
req.append((c, d))
if not req:
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
continue
stk.append((i, j, want, sc))
for r in req:
stk.append(r)
continue
i, j, want, sc = item
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
return cache[0][N]
def main():
N = int(inp())
P = [int(e) for e in inp().split()]
print(solve(N, P))
if __name__ == '__main__':
main()
| 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 enumerate(P):
revp[p] = i
segt = [[(v, 0) for v in P]]
while len(segt[-1]) > 1:
base = segt[-1]
if len(base) % 2 == 1:
base.append((0, 0))
new = []
for i in range(len(base) // 2):
a, b = base[2 * i]
c, d = base[2 * i + 1]
arr = [a, b, c, d]
arr.sort()
new.append((arr[-1], arr[-2]))
segt.append(new)
dprint('segt', segt)
def get12(i, j):
if j - i <= 0:
return (0, 0)
segi = 0
top = []
while True:
if j - i <= 0:
break
seg = segt[segi]
if j - i == 1:
top.extend(seg[i])
break
if i % 2 == 1:
top.extend(seg[i])
i += 1
if j % 2 == 1:
top.extend(seg[j - 1])
j -= 1
i //= 2
j //= 2
segi += 1
top.sort()
return top[-1], top[-2]
cache = [dict() for _ in range(N)]
stk = [(0, N)]
while stk:
item = stk.pop()
if len(item) == 2:
i, j = item
if j in cache[i]:
continue
a, b = get12(i, j)
ai = revp[a]
bi = revp[b]
li, ri = (ai, bi) if ai < bi else (bi, ai)
ri += 1
sc = b * (li - i + 1) * (j - ri + 1)
want = [(i, ri - 1), (li + 1, j), (li + 1, ri - 1)]
req = []
for c, d in want:
if not (d - c < 2 or d in cache[c]):
req.append((c, d))
if not req:
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
continue
stk.append((i, j, want, sc))
for r in req:
stk.append(r)
continue
i, j, want, sc = item
left, right, mid = [0 if d - c < 2 else cache[c][d]
for c, d in want]
cache[i][j] = left + right - mid + sc
return cache[0][N]
def main():
N = int(inp())
P = [int(e) for e in inp().split()]
print(solve(N, P))
if __name__ == '__main__':
main()
| #!/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 enumerate(P):
revp[p] = i
segt = [[(v, 0) for v in P]]
while len(segt[-1]) > 1:
base = segt[-1]
if len(base) % 2 == 1:
base.append((0, 0))
new = []
for i in range(len(base) // 2):
a, b = base[2 * i]
c, d = base[2 * i + 1]
arr = [a, b, c, d]
arr.sort()
new.append((arr[-1], arr[-2]))
segt.append(new)
dprint('segt', segt)
def get12(i, j):
if j - i <= 0:
return (0, 0)
segi = 0
top = []
while True:
if j - i <= 0:
break
seg = segt[segi]
if j - i == 1:
top.extend(seg[i])
break
if i % 2 == 1:
top.extend(seg[i])
i += 1
if j % 2 == 1:
top.extend(seg[j - 1])
j -= 1
i //= 2
j //= 2
segi += 1
top.sort()
return top[-1], top[-2]
cache = dict()
stk = [(0, N)]
while stk:
item = stk.pop()
if len(item) == 2:
i, j = item
if (i, j) in cache:
continue
a, b = get12(i, j)
ai = revp[a]
bi = revp[b]
li, ri = (ai, bi) if ai < bi else (bi, ai)
ri += 1
sc = b * (li - i + 1) * (j - ri + 1)
want = [(i, ri - 1), (li + 1, j), (li + 1, ri - 1)]
req = []
for c, d in want:
if not (d - c < 2 or (c, d) in cache):
req.append((c, d))
if not req:
left, right, mid = [0 if d - c < 2 else cache[(c, d)]
for c, d in want]
cache[(i, j)] = left + right - mid + sc
continue
stk.append((i, j, want, sc))
for r in req:
stk.append(r)
continue
i, j, want, sc = item
left, right, mid = [0 if d - c < 2 else cache[(c, d)]
for c, d in want]
cache[(i, j)] = left + right - mid + sc
return cache[(0, N)]
def main():
N = int(inp())
P = [int(e) for e in inp().split()]
print(solve(N, P))
if __name__ == '__main__':
main()
| 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])
def update(s, x, v):
k = x + s.N - 1
s.T[k] = v
while k > 0:
k = (k - 1) // 2
s.T[k] = s.do(s.T[2*k+1], s.T[2*k+2])
def getV(s, l, r):
return s.getVs(l, r, 0, 0, s.N - 1)
def getVs(s, l, r, k, kl, kr):
if l <= kl and r >= kr:
return s.T[k]
t = (kl + kr) // 2
if l > t:
return s.getVs(l, r, 2 * k + 2, t + 1,kr)
if r < t + 1:
return s.getVs(l, r , 2 * k + 1, kl, t)
return s.do(s.getVs(l, r , 2 * k + 1, kl,t),
s.getVs(l, r , 2 * k + 2, t + 1, kr))
class segMin:
inf = 10 ** 10
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 min(l, r)
def set(s, L):
for i in range(len(L)):
s.update(i, L[i])
def update(s, x, v):
k = x + s.N - 1
s.T[k] = v
while k > 0:
k = (k - 1) // 2
s.T[k] = s.do(s.T[2*k+1], s.T[2*k+2])
def getV(s, l, r):
return s.getVs(l, r, 0, 0, s.N - 1)
def getVs(s, l, r, k, kl, kr):
if l <= kl and r >= kr:
return s.T[k]
t = (kl + kr) // 2
if l > t:
return s.getVs(l, r, 2 * k + 2, t + 1,kr)
if r < t + 1:
return s.getVs(l, r , 2 * k + 1, kl, t)
return s.do(s.getVs(l, r , 2 * k + 1, kl,t),
s.getVs(l, r , 2 * k + 2, t + 1, kr))
ans = 0
D = [0] * (N + 1)
for i in range(N):
D[P[i]] = i + 1
TMa = segMax(N + 1)
TMi = segMin(N + 1)
for i in range(N, 0, -1):
#print(ans)
t = D[i]
ma = TMa.getV(0, t)
if ma == 0:
ma = N + 1
ma2 = N + 1
else:
ma2 = TMa.getV(0, ma - 1)
mi = TMi.getV(t, N + 1)
if mi == 10 ** 10:
mi = 0
mi2 = 0
else:
mi2 = TMi.getV(mi + 1, N + 1)
if ma2 == 0: ma2 = N + 1
if mi2 == 10 ** 10: mi2 = 0
TMa.update(t, t)
TMi.update(t, t)
#print(ma2, ma, t, mi, mi2)
if ma == N + 1 and mi == 0:
continue
if ma == N + 1:
if mi2 != 0:
ans += t * (mi2 - mi) * i
else:
ans += t * (N - mi + 1) * i
continue
if mi == 0:
if ma2 != N + 1:
ans += (N - t + 1) * (ma - ma2) * i
else:
ans += (N - t + 1) * (ma) * i
continue
if mi2 != 0:
ans += (mi2 - mi) * (t - ma) * i
if ma2 != N + 1:
ans += (mi - t) * (ma - ma2) * i
else:
ans += (mi - t) * ma * i
else:
ans += (N - mi + 1) * (t - ma) * i
if ma2 != N + 1:
ans += (mi - t) * (ma - ma2) * i
else:
ans += (mi - t) * ma * i
print(ans) | 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(s.T[k - 1], v)
k += k & -k
while k <= s.N:
s.T[k - 1] = max(s.T[k - 1], v)
k += k & -k
def getV(s, x):
if x <= 0:
return 0
ans = s.T[x - 1]
x -= x & -x
while x != 0:
ans = max(ans, s.T[x - 1])
x -= x & -x
return ans
class segMin:
inf = N + 1
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 min(l, r)
def set(s, L):
for i in range(len(L)):
s.update(i, L[i])
def update(s, x, v):
k = x + s.N - 1
s.T[k] = v
while k > 0:
k = (k - 1) // 2
s.T[k] = s.do(s.T[2*k+1], s.T[2*k+2])
def getV(s, l, r):
if l > r:
return s.inf
return s.getVs(l, r, 0, 0, s.N - 1)
def getVs(s, l, r, k, kl, kr):
if l <= kl and r >= kr:
return s.T[k]
t = (kl + kr) // 2
if l > t:
return s.getVs(l, r, 2 * k + 2, t + 1,kr)
if r < t + 1:
return s.getVs(l, r , 2 * k + 1, kl, t)
return s.do(s.getVs(l, r , 2 * k + 1, kl,t),
s.getVs(l, r , 2 * k + 2, t + 1, kr))
ans = 0
D = [0] * (N + 1)
for i in range(N):
D[P[i]] = i + 1
TMa = BIT(N + 1)
TMi = segMin(N + 1)
for i in range(N, 0, -1):
#print(ans)
t = D[i]
ma = TMa.getV(t)
ma2 = TMa.getV(ma)
mi = TMi.getV(t, N + 1)
mi2 = TMi.getV(mi + 1, N + 1)
#print(ma2, ma, t, mi, mi2, ans)
TMa.update(t, t)
TMi.update(t, t)
ans += (mi - t) * (ma - ma2) * i
ans += (mi2 - mi) * (t - ma) * i
print(ans)
| 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]:
r = R[r]
L[idx] = l
R[idx] = r
if l != -1:
l2 = l-1
while l2>=0 and l2!=L[l2]:
l2 = L[l2]
ans += n * (l-l2) * (r-idx)
if r != N:
r2 = r+1
while r2<N and r2!=R[r2]:
r2 = R[r2]
ans += n * (idx-l) * (r2-r)
print(ans)
| 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
R[l+1] = r
if l>=0:
l2 = l-1
if l2>=0:
l2 = L[l2]
ans += n * (l-l2) * (r-idx)
if r<N:
r2 = r+1
if r2<N:
r2 = R[r2]
ans += n * (idx-l) * (r2-r)
print(ans)
| 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 = seed
self.square = square
if values is None:
self.layer1 = []
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
rand_depth = self.rand_depth
l0 = []
for v in values:
if rand_depth():
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
self.layer1.append(inf)
def rand_depth(self): # 32bit xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
return y % self.square == 0
def add(self, x): # 要素の追加
layer1, layer0 = self.layer1, self.layer0
if self.rand_depth():
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
res = layer1[idx1]
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
layer0_idx1 = layer0[idx1]
if res != x: # res > x
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 != 0:
return layer0_idx1[idx0-1]
return layer1[idx1-1] # layer0_idx1 が空の場合とすべて x 以上の場合
else:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて res で埋まっている場合
return layer1[idx1-1]
else:
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
raise NotImplementedError # 地味に実装が悩ましい
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != float("inf"):
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != float("inf"):
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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
# 検証3 (Second Sum): https://atcoder.jp/contests/abc140/submissions/7480312
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = []
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
rand_depth = self.rand_depth
l0 = []
for v in values:
if rand_depth():
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
self.layer1.append(inf)
def rand_depth(self): # 32bit xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
return y % self.square == 0
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
if self.rand_depth():
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
res = layer1[idx1]
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
#res = layer1[idx1]
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて res で埋まっている場合
return layer1[idx1-1]
else:
return layer0_idx1[idx0-1]
# if res != x: # res > x
# if layer0_idx1:
# idx0 = bisect_left(layer0_idx1, x)
# if idx0 != 0:
# return layer0_idx1[idx0-1]
# return layer1[idx1-1] # layer0_idx1 が空の場合とすべて x 以上の場合
# else:
# idx0 = bisect_left(layer0_idx1, x)
# if idx0 == 0: # layer0_idx1 が空の場合とすべて res で埋まっている場合
# return layer1[idx1-1]
# else:
# return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め 使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != float("inf"):
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != float("inf"):
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.cube = cube
if values is None:
self.layer2 = [inf]
self.layer1 = [[]]
self.layer0 = [[[]]]
else:
self.layer2 = layer2 = []
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
rand_depth = self.rand_depth
l1 = []
la0 = []
l0 = []
for v in values:
r = rand_depth()
if r==0:
l0.append(v)
elif r==1:
la0.append(l0)
l0 = []
l1.append(v)
else:
la0.append(l0)
layer0.append(la0)
layer1.append(l1)
l0 = []
la0 = []
l1 = []
layer2.append(v)
la0.append(l0)
layer0.append(la0)
layer1.append(l1)
layer2.append(inf)
def rand_depth(self): # 32bit xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.cube == 0:
if y % (self.cube ** 2) == 0:
return 2
return 1
return 0
def add(self, x): # 要素の追加 # O(cbrt(n))
layer2, layer1, layer0 = self.layer2, self.layer1, self.layer0
r = self.rand_depth()
if r==0:
idx2 = bisect_right(layer2, x)
idx1 = bisect_right(layer1[idx2], x)
insort_right(layer0[idx2][idx1], x)
elif r==1:
idx2 = bisect_right(layer2, x)
l1 = layer1[idx2]
idx1 = bisect_right(l1, x)
l1.insert(idx1, x)
la0 = layer0[idx2]
l0 = la0[idx1]
idx0 = bisect_right(l0, x)
la0.insert(idx1+1, l0[idx0:])
del l0[idx0:]
else:
idx2 = bisect_right(layer2, x)
layer2.insert(idx2, x)
l1 = layer1[idx2]
idx1 = bisect_right(l1, x)
la0 = layer0[idx2]
l0 = la0[idx1]
idx0 = bisect_right(l0, x)
la0.insert(idx1+1, l0[idx0:])
del l0[idx0:]
layer0.insert(idx2+1, la0[idx1+1:])
del la0[idx1+1:]
layer1.insert(idx2+1, l1[idx1:])
del l1[idx1:]
def remove(self, x): # 要素の削除 # O(cbrt(n))
raise NotImplementedError
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
raise NotImplementedError
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer2, layer1, layer0 = self.layer2, self.layer1, self.layer0
idx2 = bisect_right(layer2, x)
l1 = layer1[idx2]
idx1 = bisect_right(l1, x)
la0 = layer0[idx2]
l0 = la0[idx1]
idx0 = bisect_right(l0, x)
if idx0==len(l0):
if idx1==len(l1):
return layer2[idx2]
return l1[idx1]
return l0[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer2, layer1, layer0 = self.layer2, self.layer1, self.layer0
idx2 = bisect_left(layer2, x)
l1 = layer1[idx2]
idx1 = bisect_left(l1, x)
la0 = layer0[idx2]
l0 = la0[idx1]
idx0 = bisect_left(l0, x)
if idx0==0:
if idx1==0:
return layer2[idx2-1]
return l1[idx1-1]
return l0[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め 使うなら square パラメータを大きめにするべき
raise NotImplementedError
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer2)
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = CubeSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != float("inf"):
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != float("inf"):
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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
# 検証3 (Second Sum): https://atcoder.jp/contests/abc140/submissions/7482046
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = []
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
rand_depth = self.rand_depth
l0 = []
for v in values:
if rand_depth():
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
self.layer1.append(inf)
def rand_depth(self): # 32bit xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
return y % self.square == 0
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
if self.rand_depth():
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め 使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != float("inf"):
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != float("inf"):
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = [inf]
self.layer0 = {inf: []}
else:
self.layer1 = layer1 = []
if not sorted_:
values.sort()
rand_depth = self._rand_depth
l0 = []
layer0 = []
for v in values:
if rand_depth():
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
self.layer0 = dict(zip([inf]+layer1, layer0))
layer1.append(inf)
def _rand_depth(self): # 32bit xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
return y % self.square == 0
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
if self._rand_depth():
idx1 = bisect_right(layer1, x)
val1 = layer1[idx1-1]
layer1.insert(idx1, x)
layer0_idx1 = layer0[val1]
idx0 = bisect_right(layer0_idx1, x)
layer0[x] = layer0_idx1[idx0:]
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
val1 = layer1[idx1-1]
insort_right(layer0[val1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
raise NotImplementedError
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
raise NotImplementedError
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
val1 = layer1[idx1-1]
layer0_idx1 = layer0[val1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
val1 = layer1[idx1-1]
layer0_idx1 = layer0[val1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
raise NotImplementedError
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(*sorted(list(self.layer0.items())), sep="\n")
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList(square=int(n**0.5))
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != float("inf"):
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != float("inf"):
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| # 勝てない つらい
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
# 検証3 (Second Sum): https://atcoder.jp/contests/abc140/submissions/7482046
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = []
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
rand_depth = self.rand_depth
l0 = []
for v in values:
if rand_depth():
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
self.layer1.append(inf)
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め 使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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
# 検証3 (Second Sum): https://atcoder.jp/contests/abc140/submissions/7482046
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.square = square
if values is None:
self.rand_y = seed
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
if y % square:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer0.append(l0)
layer1.append(inf)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
if layer1[idx1] == x:
del layer1[idx1]
layer0[idx1] += layer0[idx1+1]
del layer0[idx1+1]
else:
layer0_idx1 = layer0[idx1]
del layer0_idx1[bisect_left(layer0_idx1, x)]
def bisect_left(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
res = layer1[idx1]
if res == x:
return res
layer0_idx1 = layer0[idx1]
if layer0_idx1:
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return res
else:
return layer0_idx1[idx0]
else:
return res
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め 使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| # 勝てない つらい
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://atcoder.jp/contests/cpsco2019-s1/submissions/7485446
# 検証3 (add, search_higher, search_lower) Second Sum: https://atcoder.jp/contests/abc140/submissions/7483678
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % square == 0:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer1.append(inf)
layer0.append(l0)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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://atcoder.jp/contests/cpsco2019-s1/submissions/7485446
# 検証3 (add, search_higher, search_lower) Second Sum: https://atcoder.jp/contests/abc140/submissions/7483678
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % square == 0:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer1.append(inf)
layer0.append(l0)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| # 勝てない つらい 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 Queries: https://atcoder.jp/contests/cpsco2019-s1/submissions/7485446
# 検証3 (add, search_higher, search_lower) Second Sum: https://atcoder.jp/contests/abc140/submissions/7483678
def __init__(self, values=None, sorted_=False, square=1000, seed=1000000007):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.rand_y = seed
self.square = square
if values is None:
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % square == 0:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer1.append(inf)
layer0.append(l0)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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) Exclusive OR Queries: https://atcoder.jp/contests/cpsco2019-s1/submissions/7485749
# 検証3 (add, search_higher, search_lower) Second Sum: https://atcoder.jp/contests/abc140/submissions/7485479
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.square = square
if values is None:
self.rand_y = seed
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
if y % square == 0:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer1.append(inf)
layer0.append(l0)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
#y ^= y << 13 & 0xffffffff
#y ^= y >> 17
#y ^= y << 5 & 0xffffffff
y ^= y % 0x80000 * 0x2000
y ^= y // 0x20000
y ^= y % 0x8000000 * 0x20
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない # dict 微妙だった
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| # 勝てない つらい
# 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) Exclusive OR Queries: https://atcoder.jp/contests/cpsco2019-s1/submissions/7485749
# 検証3 (add, search_higher, search_lower) Second Sum: https://atcoder.jp/contests/abc140/submissions/7485479
def __init__(self, values=None, sorted_=False, square=1000, seed=42):
# values: 初期値のリスト
# sorted_: 初期値がソート済みであるか
# square: 最大データ数の平方根
# seed: 乱数のシード
inf = float("inf")
self.square = square
if values is None:
self.rand_y = seed
self.layer1 = [inf]
self.layer0 = [[]]
else:
self.layer1 = layer1 = []
self.layer0 = layer0 = []
if not sorted_:
values.sort()
y = seed
l0 = []
for v in values:
y ^= y << 13 & 0xffffffff
y ^= y >> 17
y ^= y << 5 & 0xffffffff
if y % square == 0:
layer0.append(l0)
l0 = []
layer1.append(v)
else:
l0.append(v)
layer1.append(inf)
layer0.append(l0)
self.rand_y = y
def add(self, x): # 要素の追加 # O(sqrt(n))
layer1, layer0 = self.layer1, self.layer0
# xorshift
y = self.rand_y
#y ^= y << 13 & 0xffffffff
#y ^= y >> 17
#y ^= y << 5 & 0xffffffff
y ^= (y & 0x7ffff) << 13
y ^= y >> 17
y ^= (y & 0x7ffffff) << 5
self.rand_y = y
if y % self.square == 0:
idx1 = bisect_right(layer1, x)
layer1.insert(idx1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
layer0.insert(idx1+1, layer0_idx1[idx0:]) # layer0 は dict で管理した方が良いかもしれない # dict 微妙だった
del layer0_idx1[idx0:]
else:
idx1 = bisect_right(layer1, x)
insort_right(layer0[idx1], x)
def remove(self, x): # 要素の削除 # O(sqrt(n))
# x が存在しない場合、x 以上の最小の要素が削除される
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
del layer1[idx1]
layer0[idx1] += layer0.pop(idx1+1)
else:
del layer0_idx1[idx0]
def search_higher_equal(self, x): # x 以上の最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_higher(self, x): # x を超える最小の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_right(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_right(layer0_idx1, x)
if idx0 == len(layer0_idx1):
return layer1[idx1]
return layer0_idx1[idx0]
def search_lower(self, x): # x 未満の最大の値を返す O(log(n))
layer1, layer0 = self.layer1, self.layer0
idx1 = bisect_left(layer1, x)
layer0_idx1 = layer0[idx1]
idx0 = bisect_left(layer0_idx1, x)
if idx0 == 0: # layer0_idx1 が空の場合とすべて x 以上の場合
return layer1[idx1-1]
return layer0_idx1[idx0-1]
def pop(self, idx):
# 小さい方から idx 番目の要素を削除してその要素を返す（0-indexed）
# O(sqrt(n))
# for を回すので重め、使うなら square パラメータを大きめにするべき
layer1, layer0 = self.layer1, self.layer0
s = -1
for i, l0 in enumerate(layer0):
s += len(l0) + 1
if s >= idx:
break
if s==idx:
layer0[i] += layer0[i+1]
del layer0[i+1]
return layer1.pop(i)
else:
return layer0[i].pop(idx-s)
def print(self):
print(self.layer1)
print(self.layer0)
def main():
# 参考: https://atcoder.jp/contests/abc140/submissions/7477790
inf = float("inf")
n = int(input())
p = list(map(int, input().split()))
idx = [0] * n
for i in range(0, n):
idx[i] = i
idx.sort(key=lambda i: - p[i])
ssl = SquareSkipList()
ssl.add(-1)
ssl.add(n)
ans = 0
for i in idx:
nex = ssl.search_higher(i)
nexnex = ssl.search_higher(nex)
pre = ssl.search_lower(i)
prepre = ssl.search_lower(pre)
if prepre != inf:
ans += p[i] * (pre - prepre) * (nex - i)
if nexnex != inf:
ans += p[i] * (i - pre) * (nexnex - nex)
ssl.add(i)
print(ans)
main()
| 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):
i = 0
s = 0
step = 1<<(self.N.bit_length()-1)
while step:
if i+step <= self.N and s+self.tree[i+step] < x:
i += step
s += self.tree[i]
step >>= 1
return i+1
N = int(eval(input()))
bit = BIT(N)
p = [None]+[int(c) for c in input().split()]
p_to_i = [None]*(N+1)
for i, x in enumerate(p[1:], 1):
p_to_i[x] = i
ans = 0
for x in range(N,0,-1):
c = p_to_i[x]
L = bit.BIT_sum(c)
bit.BIT_add(c)
R = N-x-L
a = bit.BIT_search(L-1) if L>=2 else 0
b = bit.BIT_search(L) if L >= 1 else 0
d = bit.BIT_search(L+2) if R >= 1 else N+1
e = bit.BIT_search(L+3) if R >= 1 else N+1
coef = 0
if b != 0:
coef += (b-a) * (d-c)
if d != 0:
coef += (e-d) * (c-b)
ans += x*coef
print(ans) | 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, x):
i = 0
s = 0
step = 1<<(self.n.bit_length()-1)
while step:
if i+step<=self.n and s+self.tree[i+step]<x:
i += step
s += self.tree[i]
step >>= 1
return i+1
N = int(eval(input()))
P = [0]+[int(c) for c in input().split()]
ntoi = [0]*(N+1)
for i in range(N+1):
ntoi[P[i]] = i
bit = BIT(N)
ans = 0
for m in range(N, 0, -1):
I = ntoi[m]
L = bit.bsum(I)
bit.badd(I,1)
R = N-L-m
a = bit.bsearch(L-1) if L>1 else 0
b = bit.bsearch(L) if L>0 else 0
c = bit.bsearch(L+2) if R>0 else N+1
d = bit.bsearch(L+3) if R>1 else N+1
coef = 0
if b!=0:
coef += (b-a)*(c-I)
if c!=0:
coef += (I-b)*(d-c)
ans += m*coef
print(ans) | 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 = Lnext[l0]
r0 = Rnext[i]
r1 = Rnext[r0]
ans += a * ((l0 - l1) * (r0 - i) + (i - l0) * (r1 - r0))
Lnext[r0] = l0
Rnext[l0] = r0
print(ans) | 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 += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def lower_bound(self, x):
""" 累積和がx以上になる最小のindexと、その直前までの累積和 """
sum_ = 0
pos = 0
for i in range(self.depth, -1, -1):
k = pos + (1 << i)
if k <= self.size and sum_ + self.tree[k] < x:
sum_ += self.tree[k]
pos += 1 << i
return pos + 1, sum_
def get_less_than_x_cnt(self, x):
""" 累積和がx未満 の個数 """
lb_pos, lb_sum = self.lower_bound(x)
return lb_pos-1
def get_less_than_and_x_cnt(self, x):
""" 累積和がx以下 の個数 """
lb_pos, lb_sum = self.lower_bound(x+1)
return lb_pos-1
def get_more_than_x_cnt(self, x):
""" 累積和がxより大きい 個数 """
return self.size - self.get_less_than_and_x_cnt(x)
n = int(eval(input()))
pl = list(map(int, input().split()))
pll = []
for i,p in enumerate(pl):
pll.append((p,i+1))
pll.sort(reverse=True)
bit = Bit(n)
ans = 0
for p,i in pll:
ix = bit.sum(i)
# print(ix)
if ix == 0:
lmax = 0
lmin = 0
lcnt = 0
else:
lmax, _ = bit.lower_bound(ix)
if ix == 1:
lmin = 0
else:
lmin, _ = bit.lower_bound(ix-1)
lcnt = lmax - lmin
rmin, _ = bit.lower_bound(ix+1)
rmax, _ = bit.lower_bound(ix+2)
rcnt = rmax - rmin
comb = lcnt*(rmin-i) + (i-lmax)*rcnt
ans += comb*p
bit.add(i,1)
# print((p,i))
# print(lmin,lmax,i,rmin,rmax,'->',comb)
# print()
print(ans) |
'''
[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 += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def lower_bound(self, x):
""" 累積和がx以上になる最小のindexと、その直前までの累積和 """
sum_ = 0
pos = 0
for i in range(self.depth, -1, -1):
k = pos + (1 << i)
if k <= self.size and sum_ + self.tree[k] < x:
sum_ += self.tree[k]
pos += 1 << i
return pos + 1, sum_
def get_less_than_x_cnt(self, x):
""" 累積和がx未満 の個数 """
lb_pos, lb_sum = self.lower_bound(x)
return lb_pos-1
def get_less_than_and_x_cnt(self, x):
""" 累積和がx以下 の個数 """
lb_pos, lb_sum = self.lower_bound(x+1)
return lb_pos-1
def get_more_than_x_cnt(self, x):
""" 累積和がxより大きい 個数 """
return self.size - self.get_less_than_and_x_cnt(x)
n = int(eval(input()))
pl = list(map(int, input().split()))
pll = []
for i,p in enumerate(pl):
pll.append((p,i+2))
pll.sort(reverse=True)
bit = Bit(n+1)
bit.add(1,1)
ans = 0
for p,i in pll:
ix = bit.sum(i)
lmax, _ = bit.lower_bound(ix)
lmin, _ = bit.lower_bound(ix-1)
lcnt = lmax - lmin
rmin, _ = bit.lower_bound(ix+1)
rmax, _ = bit.lower_bound(ix+2)
rcnt = rmax - rmin
comb = lcnt*(rmin-i) + (i-lmax)*rcnt
ans += comb*p
bit.add(i,1)
print(ans) | p02919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.