input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
a = []
for _ in range(5):
x = int(eval(input()))
a.append(x if x>= 40 else 40)
print((sum(a)//5)) | scores = [int(eval(input())) for _ in range(5)]
print((sum([(score < 40) * 40 + (score >= 40) * score for score in scores]) // 5)) | p00515 |
from collections import defaultdict as ddic, deque
from itertools import combinations, permutations, product
import sys
sys.setrecursionlimit(10**6)
stdout = sys.stdout
rr = lambda: input().strip()
rri = lambda: int(input())
rrm = lambda: list(map(int, input().strip().split()))
def solve(N, A):
memo = ... | from collections import defaultdict as ddic, deque
from itertools import combinations, permutations, product
import sys
sys.setrecursionlimit(10**6)
stdout = sys.stdout
rr = lambda: input().strip()
rri = lambda: int(input())
rrm = lambda: list(map(int, input().strip().split()))
def solve(N, A):
dp0 = [... | p03063 |
N, M = list(map(int, input().split()))
a = [sorted(list(map(int, input().split()))[1:]) for _ in range(N)]
b = [i for i in range(1, M + 1)]
c = [i for i in range(1, M + 1)]
for i in range(N):
for j in range(len(b)):
if (not b[j] in a[i]) and b[j] in c:
c.remove(b[j])
print((len(c)))
| N, M = list(map(int, input().split()))
a = [list(map(int, input().split()))[1:] for _ in range(N)]
b = [i for i in range(1, M + 1)]
c = [i for i in range(1, M + 1)]
for i in range(N):
for j in range(M):
if b[j] in c and (not b[j] in a[i]):
c.remove(b[j])
print((len(c)))
| p03126 |
n, m = list(map(int,input().split()))
a = []
for i in range(n):
a += list(i for i in (list(map(int,input().split() ))))[::-1]
a.pop(-1)
print((sum([1 if a.count(i) == n else 0 for i in range(m+1)]))) | n, m = list(map(int,input().split()))
s = set(range(1,m+1))
for i in range(n):
_,*a = list(map(int,input().split()))
s &= set(a) # 集合の積
print((len(s))) | p03126 |
N, M = list(map(int, input().split()))
all_dish = []
for n in range(N):
K_n_list = list(map(int, input().split()))
del K_n_list[0]
for K_n_list_num in K_n_list:
all_dish.append(K_n_list_num)
prefer_dish = []
dish_kind = list(set(all_dish))
prefer_dish = [dish_kind_num for dish_kind_num ... | ii=lambda:int(eval(input()))
miis=lambda:list(map(int,input().split()))
lmiis=lambda:list(map(int,input().split()))
n,m=miis()
k=lmiis()
st=set(k[1:])
for i in range(n-1):
ki=lmiis()
st=st&set(ki[1:])
print((len(st))) | p03126 |
# coding: utf-8
import sys
# import bisect
# import math
# import itertools
# import numpy as np
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | n, m = list(map(int, input().split()))
res = [[False for _ in range(m)] for _ in range(n)]
for i in range(n):
o = list(map(int, input().split()))
for j, x in enumerate(o):
if j != 0:
res[i][x - 1] = True
ans = 0
res = list(zip(*res))
for i, x in enumerate(res):
if all(x):... | p03126 |
n, m = list(map(int, input().split()))
res = [[False for _ in range(m)] for _ in range(n)]
for i in range(n):
o = list(map(int, input().split()))
for j, x in enumerate(o):
if j != 0:
res[i][x - 1] = True
res = list(zip(*res))
ans = sum(1 for x in res if all(x))
print(ans)
| n, m = list(map(int, input().split()))
res = [0] * m
for i in range(n):
o = list(map(int, input().split()))
for j, x in enumerate(o):
if j != 0:
res[x - 1] += 1
ans = sum(1 for x in res if x == n)
print(ans)
| p03126 |
n,m=list(map(int,input().split()));d=[i+1 for i in range(m)]
def listdup(a,b):
x=[]
for i in a:
if i in b:x.append(i)
return sorted(x)
for i in range(n):
a=list(map(int,input().split()));a=a[1:];a.sort()
d=listdup(a,d)
print((len(d))) | n,m=list(map(int,input().split()))
s=set(list(map(int,input().split()))[1:])
for i in range(n-1):
s&=set(list(map(int,input().split()))[1:])
print((len(s))) | p03126 |
N, M = list(map(int, input().split()))
cnt = [0] * M
for _ in range(N):
K, *A = list(map(int, input().split()))
for a in A:
cnt[a - 1] += 1
print((sum(c == N for c in cnt))) | n, m = list(map(int, input().split()))
cnt = [0] * m
for _ in range(n):
k, *A, = list(map(int, input().split()))
for a in A:
cnt[a - 1] += 1
print((sum(c == n for c in cnt))) | p03126 |
N,M = list(map(int, input().split()))
A = [0 for i in range(M+1)]
for i in range(N):
tmp = input().split()
for j in tmp[1:]:
A[int(j)] += 1
ans = len([0 for i in A if i == N])
print(ans)
| n,m = list(map(int, input().split()))
d = {}
for _ in range(n):
k = input().split()
for j in k[1:]:
if j not in d:
d[j] = 0
d[j] += 1
print((len([v for v in list(d.values()) if v == n]))) | p03126 |
n, m = list(map(int, input().split()))
count = 0
kind = [0 for i in range(m)]
for i in range(n):
anketo = list(map(int, input().split()))
for j in range(1, len(anketo)):
kind[anketo[j]-1] += 1
for i in kind:
if i == n:
count += 1
print(count)
| n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
A = set(c[1:])
for i in range(n-1):
t = list(map(int, input().split()))
A &= set((t[1:]))
print((len(A))) | p03126 |
N, M = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A = [flatten for inner in A for flatten in inner[1:]]
#print(A)
import collections
A_cnt = collections.Counter(A)
print((sum([l[1]==N for l in A_cnt.most_common()])))
| N,M = list(map(int,input().split()))
_, *A = list(map(int,input().split()))
s = set(A)
for i in range(N-1):
_, *B = list(map(int,input().split()))
s &= set(B)
print((len(s))) | p03126 |
n,m=list(map(int,input().split()))
a=[0]*m
b=[list(map(int,input().split())) for _ in range(n) ]
for i in range(n):
c=b[i][0]
for j in range(1,c+1):
a[b[i][j]-1]+=1
print((a.count(n))) | n,m=list(map(int,input().split()))
c=set(range(1,m+1))
for i in range(n):
a=list(map(int,input().split()))
b=set(a[1:])
c=b&c
print((len(c))) | p03126 |
q=set(map(str,list(range(31))))
for s in open(0).readlines()[1:]:
t=set(s.split()[1:])
q&=t
print((len(q))) | a,b=list(map(int,input().split()))
for i in range(a):
n,*a=list(map(int,input().split()))
if i==0:
l=a
else:
l=set(a)&set(l)
print((len(l))) | p03126 |
a,b=list(map(int,input().split()))
for i in range(a):
n,*a=list(map(int,input().split()))
if i==0:
l=a
else:
l=set(a)&set(l)
print((len(l))) | a,b=list(map(int,input().split()))
for i in range(a):
if i==0:
x=set(input().split()[1:])
else:
x=x&set(input().split()[1:])
print((len(x))) | p03126 |
def read():
return int(eval(input()))
def reads():
return list(map(int, input().split()))
n,m = reads()
a = []
r = []
for i in range(n):
a.append(reads())
for i in range(n):
for j in range(1,a[i][0]+1):
r.append(a[i][j])
ans = 0
for i in set(r):
if r.count(i) == n:
... | def read():
return int(eval(input()))
def reads():
return list(map(int, input().split()))
n, m = reads()
a = set(input().split()[1:])
for _ in range(n - 1):
a &= set(input().split()[1:])
print((len(a))) | p03126 |
n, m = list(map(int, input().split()))
k = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in range(1, m+1):
cnt = 0
for p in k:
if i in p[1:]:
cnt += 1
if cnt == n:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
cnt = [0]*(m+1)
for i in range(n):
x = list(map(int, input().split()))
for p in x[1:]:
cnt[p] += 1
print((cnt.count(n))) | p03126 |
import sys
import collections as c
input = sys.stdin.readline
def main():
ans = 0
N, M = list(map(int, input().split()))
a = []
for _ in range(N):
a += list(map(int, input().split()))[1:]
co = c.Counter(a)
for k, v in list(co.items()):
if v == N:
ans +... | import sys
input = sys.stdin.readline
def main():
ans = 0
N, M = list(map(int, input().split()))
f = set(range(1,M+1))
for _ in range(N):
a = set(list(map(int, input().split()))[1:])
f.intersection_update(a)
print((len(f)))
if __name__ == '__main__':
main() | p03126 |
N,M=list(map(int,input().split()))
C = set(list(range(1,M+1)))
for _ in range(N):
L=list(map(int,input().split()))
A=L[1:]
C=C&set(A)
print((len(C))) | N,M=list(map(int,input().split()))
K=[0]*M
a=0
for i in range(N):
A=list(map(int,input().split()))
for j in A[1:]:
K[j-1]+=1
for i in K:
if i==N:
a+=1
print(a) | p03126 |
a,b=list(map(int,input().split()))
c=list(map(int,input().split()))[1:]
#print(c)
for _ in range(a-1):
#print(range(a))
d=list(map(int,input().split()))[1:]
#print(d)
c=set(c)&set(d)
#print(c)
print((len(c))) | a,b=list(map(int,input().split()))
c=list(map(int,input().split()))[1:]
for _ in range(a-1):c=set(c)&set(list(map(int,input().split()))[1:])
print((len(c))) | p03126 |
import collections
N, M = list(map(int, input().split()))
likes = []
for i in range(N):
x = list(map(int, input().split()))
_ = x.pop(0)
likes += x
col = collections.Counter(likes)
count = 0
for k, v in list(col.items()):
if v == N:
count += 1
print(count) |
n, m = list(map(int, input().split()))
likes = [0] * m
for i in range(n):
k, *a = list(map(int, input().split()))
for j in a:
likes[j-1] += 1
count = 0
for i in likes:
if i == n:
count += 1
print(count) | p03126 |
N,M = list(map(int,input().split()))
nes = []
count = 0
for i in range(N) :
li = list(map(int,input().split()))
nes.append(li)
favorite = [0] * M
for i in range(N) :
for j in range(1,nes[i][0]+1) :
favorite[nes[i][j]-1] += 1
for i in range(M) :
if favorite[i] == N :
count+=1
... | #template
def inputlist(): return [int(k) for k in input().split()]
#template
N,M = inputlist()
ans = [0]*(M+1)
c =0
for i in range(N):
A = inputlist()
K = A[0]
Aa = A[1:]
for j in range(K):
ans[Aa[j]] +=1
for i in range(1,M+1):
if ans[i] == N:
c+=1
print(c) | p03126 |
from collections import Counter
n, m = list(map(int, input().split()))
L = []
cnt = 0
for _ in range(n):
tmp = input().split()
a = tmp[1:]
L.extend(a)
c = Counter(L)
for k, v in list(c.items()):
if v==n:
cnt += 1
print(cnt) | n, m = list(map(int, input().split()))
foods = [0] * m
for _ in range(n):
k, *a = input().split()
for food in a:
foods[int(food)-1] += 1
print((foods.count(n)))
| p03126 |
import functools
print((len(functools.reduce(lambda x, y: x&y,[set(input().split()[1:]) for _ in [0]*int(input().split()[0])])))) | print((len(set.intersection(*[set(input().split()[1:]) for _ in [0]*int(input().split()[0])])))) | p03126 |
from functools import reduce
N, M = list(map(int, input().split()))
prod = set(range(1, M + 1))
for _ in range(N):
prod &= set(list(map(int, input().split()))[1:])
ans = len(prod)
print(ans) | # 入力
N, M = list(map(int, input().split()))
K, A = list(zip(*(
(int(t[0]), list(map(int, t[1].split())))
for t in (input().split(maxsplit=1) for _ in range(N))
)))
# 素直にカウント
ans = sum(
all(k in a for a in A)
for k in range(1, M + 1)
)
# 出力
print(ans)
| p03126 |
from functools import reduce
n, m = list(map(int, input().split()))
k = [list(map(int, input().split()))[1:] for _ in range(n)]
print((len(reduce(lambda a,b: a&b, [set(kk) for kk in k]))))
| n, m = list(map(int, input().split()))
s = [0] * m
for i in range(n):
a = list(map(int, input().split()))[1:]
for x in a:
s[x-1] += 1
ans = 0
for x in s:
if x == n:
ans += 1
print(ans)
| p03126 |
Tmp = []
Tmp = input().rstrip().split(' ')
nN = int(Tmp[0])
nM = int(Tmp[1])
nData = [[ 0 for i in range(2)] for j in range(nM)]
for i in range(nM):
nData[i][0]=i+1
for i in range(nN):
Tmp = input().rstrip().split(' ')
nK = int(Tmp[0])
nTmp =[ 0 for j in range(nK)]
for j in range(nK):
nTmp... | mp = []
Tmp = input().rstrip().split(' ')
nN = int(Tmp[0])
nM = int(Tmp[1])
nF = [ 0 for i in range(nM)]
for i in range(nN):
Tmp = input().rstrip().split(' ')
nTmpN = int(Tmp[0])
for j in range(nTmpN):
nCnt = int(Tmp[j+1]) - 1
nF[nCnt] += 1
nAns = 0
for i in range(nM):
nTmpN = nF... | p03126 |
from collections import Counter
n, m = list(map(int, input().split()))
food_arr = []
total = 0
for i in range(n):
food_arr += list(map(int, input().split()[1:]))
counter = Counter(food_arr)
for key, value in list(counter.items()):
if value == n:
total += 1
print(total) | N, M = list(map(int, input().split()))
se = set(range(1,M+1))
for _ in range(N):
k, *A = list(map(int, input().split()))
se &= set(A)
print((len(se))) | p03126 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p03126 |
N,M=list(map(int,input().split()))
A=[list(map(int,input().split()[1:])) for i in range(N)]
food=set(range(1,M+1))
for i in range(N):
food&=set(A[i])
print((len(food))) | N,M=list(map(int,input().split()))
food=set(range(1,M+1))
for i in range(N):
K,*A=list(map(int,input().split()))
food&=set(A)
print((len(food))) | p03126 |
n,m = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
ans = 0
cnt = 0
for i in range(1,m+1):
for j in range(n):
for k in range(1,a[j][0]+1):
if a[j][k] == i:
cnt += 1
break
if cnt == n:
ans += 1
c... | n,m = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
ans = 0
cnt = 0
for i in range(1,m+1):
for j in a:
if i in j[1:]:
cnt += 1
if cnt == n:
ans += 1
cnt = 0
print(ans) | p03126 |
n,m = list(map(int, input().split()))
l = []
for i in range(n): #Kを除く好きな食べ物を取得
a = [int(_) for _ in input().split()]
l.append(a[1:a[0]+1])
y = [] #全部好きな人を要素’1’として格納
for j in range(1,m+1):
x = 0
for k in range(n):
if j in l[k]:
x += 1
if x == n:
y.append(1)... | n,m = list(map(int, input().split()))
l = []
for i in range(n): #Kを除く好きな食べ物を取得
a = [int(_) for _ in input().split()]
l.append(a[1:a[0]+1])
y = [] #全部好きな人を要素’1’として格納
for j in range(1,m+1):
x = 0
for k in range(n):
if j in l[k]:
x += 1
if x == n: #これが全部好きの条件
... | p03126 |
n,m=list(map(int,input().split()));a=[]
for _ in[0]*n:a.extend(list(map(int,input().split()))[1:])
print((sum(n==a.count(i+1)for i in range(m)))) | I=lambda:list(map(int,input().split()))
n,m=I()
a=[]
for _ in[0]*n:a.extend(I()[1:])
print((sum(n==a.count(i+1)for i in range(m)))) | p03126 |
N,M = list(map(int,input().split()))
list_list = [list(map(int,input().split())) for i in range(N)]
count = 0
for i in range(1,M+1):
flg = True
for list in list_list:
if i in list[1:]:
continue
else:
flg = False
break
if flg == True:
count += 1
print(count)
| N, M = list(map(int, input().split()))
a = set(list(map(int, input().split()))[1:])
for i in range(N - 1):
a &= set(list(map(int, input().split()))[1:])
print((len(a)))
| p03126 |
N, M = list(map(int, input().split()))
K = [0] * N
A = [[0 for j in range(M)] for i in range(N)]
for i in range(N):
inpt = list(map(int, input().split()))
K[i] = inpt[0]
for j in range(1, K[i]+1, 1):
A[i][j-1] = inpt[j]
count = 0
for j in range(1, M+1, 1):
likecount = 0
for i... | N, M = list(map(int, input().split()))
K = [0] * N
A = [list(map(int, input().split())) for i in range(N)]
count = 0
for i in range(1, M+1, 1):
likecount = 0
for j in range(N):
for k in range(1, A[j][0]+1, 1):
if A[j][k] == i:
likecount += 1
if likecount == N... | p03126 |
N, M = list(map(int, input().split()))
K = [0] * N
A = [list(map(int, input().split())) for i in range(N)]
count = 0
for i in range(1, M+1, 1):
likecount = 0
for j in range(N):
for k in range(1, A[j][0]+1, 1):
if A[j][k] == i:
likecount += 1
if likecount == N... | N, M = list(map(int, input().split()))
likeset = set(range(1, M+1))
for _ in range(N):
a, *b = list(map(int, input().split()))
likeset &= set(b)
print((len(likeset)))
| p03126 |
from collections import defaultdict
n, m = list(map(int, input().split()))
s = []
for _ in range(n):
k, *a = list(map(int, input().split()))
s.append(a)
dd = defaultdict(int)
for l in s:
for k in l:
dd[k] += 1
print((sum(1 if v == n else 0 for k, v in list(dd.items()))))
| n, m = list(map(int, input().split()))
s = set(range(1, m+1))
for _ in range(n):
k, *a = list(map(int, input().split()))
s &= set(a)
print((len(s))) | p03126 |
n, m = list(map(int, input().split()))
S = set(range(1, m+1))
for i in range(n):
k, *a = list(map(int, input().split()))
S &= set(a)
print((len(S)))
| n, m = list(map(int, input().split()))
s = set(range(1, m+1))
for i in range(n):
k, *a = list(map(int, input().split()))
s &= set(a)
print((len(s)))
| p03126 |
n, m = list(map(int, input().split()))
ans = [0] * m
for _ in range(n):
k, *a = [int(x) for x in input().split()]
for i in a:
ans[i-1] += 1
tmp = 0
for a in ans:
if a == n:
tmp += 1
print(tmp)
| n, m = list(map(int, input().split()))
ans = set(map(str, list(range(1, m+1))))
for _ in range(n):
ans = ans & set(input().split()[1:])
print((len(ans)))
| p03126 |
a = list(map(int,input().split()))
cnt = [0,] *(a[1]+1)
for i in range(a[0]):
suki = list(map(int,input().split()))
for j in range(1, len(suki)):
cnt[suki[j]]+=1
ans = 0
for i in range(1, a[1]+1):
if cnt[i] == a[0]:
ans+=1
print((str(ans))) | import sys
readline = sys.stdin.readline
a = list(map(int,input().split()))
N = a[0]
M = a[1]
cnt = [0,]*(M+1)
ans = 0
for i in range(N):
K, *like, = readline().split()
K = int(K)
like = [int(s) for s in like]
for j in range(K):
cnt[like[j]] += 1
for i in range(1, M+1):
if cn... | p03126 |
N, M = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
ans = 0
for i in range(1,M+1):
cnt = 0
for a in A:
if(i in a[1:]):
cnt += 1
if(cnt == N):
ans += 1
print(ans) | N, M = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
tmp = [0]*(M+1)
for a in A:
for aa in a[1:]:
tmp[aa] += 1
ans = 0
for t in tmp:
if t == N:
ans += 1
print(ans) | p03126 |
from collections import Counter
n,m = list(map(int,input().split()))
many =[]
for i in range(n):
a = list(map(int,input().split()))
for j in range(1,a[0]+1):
many.append(a[j])
ans = Counter(many).most_common()
count = 0
for i in range(len(ans)):
if ans[i][1] == n:
count += 1
... | n,m = list(map(int,input().split()))
data = [0 for i in range(m)]
for i in range(n):
k,*a = list(map(int,input().split()))
for x in a:
data[x-1] += 1
ans = 0
for i in range(m):
if data[i] == n:
ans += 1
print(ans) | p03126 |
N, M = list(map(int,input().split()))
foods = [0 for m in range(M)]
for n in range(N):
A = list(map(int, input().split()))
for a in A[1:]:
foods[a-1]+=1
foods_ans = [f for f in foods if f == N]
#print(foods)
#print(foods_ans)
print((len(foods_ans)))
| N, M = list(map(int,input().split()))
foods = [0 for m in range(M)]
for n in range(N):
A = list(map(int, input().split()))
for a in A[1:]:
foods[a-1]+=1
print((len([f for f in foods if f == N])))
| p03126 |
N,M = list(map(int, input().split()))
KA = []
a = []
ans = 0
for i in range(N):
KA = list(map(int, input().split()))
A = KA[1:]
a += A
for j in range(1,M+1):
if a.count(j) == N:
ans += 1
print(ans)
| Ans_list = []
Ans = 0
N,M = list(map(int, input().split()))
for i in range(N):
KA = list(map(int, input().split()))
Mylist = KA[1:]
for j in range(len(Mylist)):
Ans_list.append(Mylist[j])
for i in range(M+1):
if Ans_list.count(i)==N:
Ans += 1
print(Ans)
| p03126 |
N,M = list(map(int,input().split()))
list = [list(map(int,input().split())) for x in range(N)]
#一列目削除
for i in range(0,N):
list[i].pop(0)
stock = []
#解答が全リストにあるか探索
for i in range(0,N):
for j in range(0,len(list[i])):
cnt = 0
for k in range(0,N):
if list[i][j] in list... | N,M = list(map(int,input().split()))
M_kinds = set(range(1,M+1))
for i in range(N):
a,*b = list(map(int,input().split()))
M_kinds &= set(b)
print((len(M_kinds))) | p03126 |
n, m = list(map(int, input().split()))
ref = {}
a = list(map(int, input().split()))
del a[0]
a = set(a)
ref = a
for i in range (n - 1):
a = list(map(int, input().split()))
del a[0]
a = set(a)
ref = ref & a
print((len(ref))) | n, m = list(map(int, input().split()))
cnt = [0]*m
ans = 0
for i in range(n):
k, *a = list(map(int, input().split()))
for j in a:
cnt[j - 1] += 1
for i in cnt:
if i == n:
ans += 1
print(ans) | p03126 |
n, m = list(map(int, input().split()))
ka = [list(map(int, input().split())) for i in range(n)]
ans = [0] * m
for i in range(n):
for j in range(1, len(ka[i])):
for k in range(1, m+1):
if ka[i][j] == k:
ans[k-1] += 1
break
print((ans.count(n))) | n, m = list(map(int, input().split()))
ka = [list(map(int, input().split())) for i in range(n)]
ans = [0] * m
for i in range(n):
for j in ka[i][1:]:
ans[j-1] += 1
print((ans.count(n))) | p03126 |
class Avltree:
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
... | class Avltree:
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
if node.key > key:
node = node.left
... | p03987 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
# 大きい数字から追加していく。そのときの連結成分の大きさだけ足される。
# union findっぽく。各成分の左端を根として持つ
N = int(eval(input()))
A = [int(x) for x in input().split()]
x_to_i = {x:i for i,x in enumerate(A)}
V = set()
root = dict()
size = dict()
def find_root(x):
y ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
"""
・大きい数から挿入していく
・連結成分の両端を管理する
"""
N,*A = list(map(int,read().split()))
A = [0] + A + [0]
ind = [0] * (N+1)
for i,x in enumerate(A):
ind[x] = i
left = list(range(1,len(A)+1))
ri... | p03987 |
import bisect
n=int(input())
a=list(map(int,input().split()))
b=sorted([(a[i],i+1) for i in range(n)])
s=[0,n+1]
ans=0
for c,j in b:
k=bisect.bisect(s,j)
ans+=c*(s[k]-j)*(j-s[k-1])
s.insert(k,j)
print(ans)
| n=int(input())
a=list(map(int,input().split()))
def f():
s=[(0,-1)]
x=[0]*(n+1)
for i,j in enumerate(a):
while s[-1][0]>j:s.pop()
x[j]=i-s[-1][1]
s.append((j,i))
return x
l=f()
a.reverse()
r=f()
print(sum([i*l[i]*r[i] for i in a]))
| p03987 |
'''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
m... | '''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
m... | p03987 |
n = int(eval(input()))
A = list(map(int, input().split()))
P = [0]*n
for i, a in enumerate(A):
P[a-1] = i
import heapq
q = []
heapq.heapify(q)
R = [n-1]*n
for i, a in enumerate(A):
while q and q[0]*(-1) > a:
v = heapq.heappop(q)*(-1)
R[v-1] = i-1
heapq.heappush(q, a*(-1))
... | n = int(eval(input()))
A = list(map(int, input().split()))
A = [a-1 for a in A]
P = [-1]*n
for i, a in enumerate(A):
P[a] = i
R = [n]*n
q = []
import heapq
heapq.heapify(q)
for i in range(n):
while q:
if -q[0] > A[i]:
v = -heapq.heappop(q)
R[v] = i
else... | p03987 |
#!/usr/bin/env python3
#AGC5 B
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Coun... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p03987 |
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N):
l = 1
for j in range(i-1,-1,-1):
if A[i] <= A[j]:
l += 1
else:
break
r = 1
for j in range(i+1,N):
if A[i] <= A[j]:
r += 1
... | N = int(eval(input()))
a = list(map(int,input().split()))
l = [i for i in range(N)]
r = [i for i in range(N)]
b = [0] * N
for i in range(N):
b[a[i]-1] = i
ans = 0
for i in range(N-1,-1,-1):
m = b[i]
x,y = l[m],r[m]
ans += (i+1)*(m-x+1)*(y-m+1)
l[min(y+1,N-1)] = x
r[max(x-1,0)] =... | p03987 |
class Node:
def __init__(self, key):
self.key = key
self.lch = None
self.rch = None
self.bias = 0
self.size = 1
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rch
u.size = v.size
... | class Node:
def __init__(self, key):
self.key = key
self.lch = None
self.rch = None
self.bias = 0
class AVLTree:
def __init__(self):
self.root = None
def rotate_left(self, v):
u = v.rch
v.rch = u.lch
u.lch = v
if u.bi... | p03987 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):b[a[i]-1]=i
ans=0
l,r=[i for i in range(n+1)],[i for i in range(n+1)]
for i in range(n-1,-1,-1):
ans+=(i+1)*(b[i]-l[b[i]]+1)*(r[b[i]]-b[i]+1)
l[r[b[i]]+1],r[l[b[i]]-1]=l[b[i]],r[b[i]]
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
l=[i-1 for i in range(n+1)]+[n]
r=[i+1 for i in range(n+1)]+[n+2]
ans=0
p=[0]*n
for i in range(n):p[a[i]-1]=i
for i in range(n-1,-1,-1):
j=p[i]
ans+=(i+1)*(j-l[j])*(r[j]-j)
l[r[j]],r[l[j]]=l[j],r[j]
print(ans) | p03987 |
class Avltree:
def __init__(self,key=None):
self.key = key
self.left = None
self.right = None
self.balance = "Even"
def search_lower(self,key,key_lower):
if self.key == None:
return key_lower
if self.key > key:
if self.left =... | #木の根を求める
def find(x,par):
if par[x] == x:
return x
else:
return find(par[x],par)
#xとyの属する集合の併合
def unite(x,y,par,rank,size):
x = find(x,par)
y = find(y,par)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
siz... | p03987 |
#木の根を求める
def find(x,par):
if par[x] == x:
return x
else:
return find(par[x],par)
#xとyの属する集合の併合
def unite(x,y,par,rank,size):
x = find(x,par)
y = find(y,par)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
siz... | #木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
size[y] += size[x]
else:... | p03987 |
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
left = [0] * N
tmp = []
for i, a in enumerate(A):
cnt = 1
while tmp:
aa, c = tmp.pop()
if aa < a:
tmp.append((aa, c))
break
else:
... | import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
A = list(map(int, input().split()))
def while_pop(arr):
res = [0] * N
tmp = []
for i, a in enumerate(arr):
cnt = 1
while tmp:
aa, c = tmp.pop()
if aa < a:
tmp.append((a... | p03987 |
class BIT_index:
def __init__(self, n):
self.BIT_prev = [n] * (n + 1)
self.BIT_next = [n] * (n + 1)
self.n = n
def __addElement(self, BIT, idx):
value = idx
idx += 1
while idx > 0:
BIT[idx] = min(BIT[idx], value)
idx -= idx & -i... | N = int(eval(input()))
As = list(map(int, input().split()))
iAs = [0] * (N + 1)
for i, A in enumerate(As):
iAs[A] = i
ans = 0
iLs = list(range(N + 1))
iRs = list(range(N + 1))
for A in reversed(list(range(1, N + 1))):
iA = iAs[A]
iL, iR = iLs[iA], iRs[iA]
ans += A * (iA - iL + 1) * (iR - ... | p03987 |
N = int(eval(input()))
As = list(map(int, input().split()))
iAs = [0] * (N + 1)
for i, A in enumerate(As):
iAs[A] = i
ans = 0
iLs = list(range(N + 1))
iRs = list(range(N + 1))
for A in reversed(list(range(1, N + 1))):
iA = iAs[A]
iL, iR = iLs[iA], iRs[iA]
ans += A * (iA - iL + 1) * (iR - ... | def getNums(As):
nums = [0] * N
stack = [(-1, 0)]
for iA, A in enumerate(As):
while stack[-1][1] > A:
stack.pop()
nums[iA] = iA - stack[-1][0]
stack.append((iA, A))
return nums
N = int(eval(input()))
As = list(map(int, input().split()))
numLs = getN... | p03987 |
import sys
from operator import itemgetter
class BinaryIndexedTreeCustom:
def __init__(self, n, init, func):
self.size = n
self.tree = [init] * (n + 1)
self.depth = n.bit_length()
self.init = init
self.func = func
def get(self, i):
s = self.init
... | import sys
from operator import itemgetter
n, *aaa = list(map(int, sys.stdin.buffer.read().split()))
aaa_with_index = list(enumerate(aaa, start=1))
aaa_with_index.sort(key=itemgetter(1), reverse=True)
left = list(range(-1, n + 1))
right = list(range(1, n + 3))
ans = 0
for i, a in aaa_with_index:
li = lef... | p03987 |
import bisect
def inpl(): return [int(i) for i in input().split()]
N = int(eval(input()))
a = inpl()
b = [0 for _ in range(N)]
for i in range(N):
b[a[i]-1] = i+1
rng = [0, N+1]
ans = 0
for i, v in enumerate(b):
x = bisect.bisect_left(rng, v)
st = rng[x-1]
en = rng[x]
ans += (i+1)*(v-st)... | def inpl(): return [int(i) for i in input().split()]
N = int(eval(input()))
a = inpl()
b = {a[i]: i for i in range(N)}
left = list(range(N+2))
right = list(range(N+2))
ans = 0
for i in range(N,0,-1):
x = b[i]
ans += i*(right[x]-x +1)*(x-left[x] +1)
right[left[x] - 1] = right[x]
left[right... | p03987 |
n = int(eval(input()))
A = [[int(a),i] for i,a in enumerate(input().split())]
A.sort()
bit = [0]*(n+1)
def sum(i):
# [0, i) の要素の総和を返す
s = 0
while i>0:
s += bit[i]
i -= i & -i
return s
# 0 index を 1 index に変更 転倒数を求めるなら1を足していく
def add(i, x):
i += 1
while i <= n:
... | n = int(eval(input()))
A = list(map(int,input().split()))
l = [i-1 for i in range(n+2)]
r = [i+1 for i in range(n+2)]
ind = [0]*n
for i,a in enumerate(A):
ind[a-1] = i
ans = 0
for i in range(n-1,-1,-1):
x = ind[i]
ans += (i+1)*(r[x]-x)*(x-l[x])
l[r[x]],r[l[x]], = l[x],r[x]
print(ans) | p03987 |
from bisect import bisect_left
N = int(eval(input()))
*A, = list(map(int, input().split()))
indices = {a: i for i, a in enumerate(A)}
seen_idx = [-1, N]
ans = 0
for a in range(1, N+1):
idx = indices[a]
t = bisect_left(seen_idx, idx)
seen_idx = seen_idx[:t] + [idx] + seen_idx[t:]
left = idx -... | N = int(eval(input()))
*A, = list(map(int, input().split()))
indices = {a: i for i, a in enumerate(A)}
left = {i: i for i in range(N)} # "left[i] = l" is equivalent to "A[l], ..., A[i-1] > A[i]"
right = {i: i for i in range(N)} # "right[i] = r" is equivalent to "A[i] < A[i+1], ..., A[r]"
ans = 0
for a in range(N,... | p03987 |
N=int(eval(input()))
A=list(map(int,input().split()))
p=[None]*N
for i,a in enumerate(A):
p[a-1]=i
ans=0
b={-1:1,N:1}
from bisect import bisect
for i in range(N):
bs=sorted(b.keys())
s=bisect(bs,p[i])
ans+=(i+1)*(p[i]-bs[s-1])*(bs[s]-p[i])
b[p[i]]=1
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
p=[None]*N
for i,a in enumerate(A):
p[a-1]=i
ans=0
l,r=[i for i in range(N)],[i for i in range(N)]
for i in range(N-1,-1,-1):
left,right=l[p[i]],r[p[i]]
ans+=(i+1)*(p[i]-left+1)*(right-p[i]+1)
if left>0:
r[left-1]=right
if rig... | p03987 |
n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(list(enumerate(a)),key=lambda x:x[1])
l=1
while l<2*(n+2)-1:
l*=2
l-=1
seg=[True]*l
seg[0]=False
def update(i):
if seg[i]:
seg[i]=False
update((i-1)//2)
update((l-1)//2)
update((l-1)//2+n+1)
def search_left(i,j):
if j==1:
i... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: -x[1])
class unionfind():
# size:要素数,tree：unionfind木
def __init__(self, size): # self,要素数
self.size = size
self.tree = [i for i in range(... | p03987 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: -x[1])
class unionfind():
# size:要素数,tree：unionfind木
def __init__(self, size): # self,要素数
self.size = size
self.tree = [i for i in range(... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: -x[1])
L = [i for i in range(n+2)] # 連結成分のうち一番左のindex
R = [i for i in range(n+2)] # 連結成分のうち一番右のindex
ans = 0
for i, j in a: # 1-indexなので1ずれる
M = R[i+1] # 連結... | p03987 |
n = int(eval(input()))
a = list(map(int,input().split()))
p = [0]*(n+1)
ans = 0
for i in range(n):
p[a[i]] = i+1
l = [i-1 for i in range(n+2)]
l[0] = 0
r = [i+1 for i in range(n+2)]
r[-1] = n+1
for i in range(n,0,-1):
ans += (p[i]-l[p[i]])*(r[p[i]]-p[i])*i
l[r[p[i]]] = l[p[i]]
r[l[p[i]]] = r[p[i]]
... | N = int(eval(input()))
a = list(map(int, input().split()))
# indexをソート
b = [0] * N
for i in range(N):
b[a[i] - 1] = i
# 初期化 端っこ対策としてひとつ余計に取っている
left = [0] * (N + 1)
right = [0] * (N + 1)
for i in range(N + 1):
left[i] = i-1
right[i] = i+1
# 更新
for idx in reversed(b):
left[right[idx]]... | p03987 |
import bisect
N = int(eval(input()))
a = list(zip(list(map(int, input().split())), list(range(1, N + 1))))
b = [0, N + 1]
a.sort()
ans = 0
for j, i in a:
x = bisect.bisect(b, i)
y = b[x - 1]
z = b[x]
ans += (((z - y) * (z - y - 1) - (i - y) * (i - y - 1) - (z - i) * (z - i - 1)) // 2) * j
... | N = int(eval(input()))
a = list(map(int, input().split()))
b = [0] * (N + 1)
for i in range(N):
b[a[i]] = i + 1
l = [i for i in range(N + 2)]
r = [i for i in range(N + 2)]
ans = 0
for i in range(N, 0, -1):
m = b[i]
x = l[m]
y = r[m]
ans += (m - x + 1) * (y - m + 1) * i
r[x - 1] = y
... | p03987 |
from collections import defaultdict
#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_rig... | import bisect
from collections import defaultdict
class SqrtSet:
def __init__(self, block_limit=201):
self.key = []
self.child = [[]]
self.block_limit = block_limit
def search_lower(self, key):
if key is None:
return None
ret = None
i = b... | p03987 |
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
class SegmentTree():
def __init__(self,N,f,unit):
self.f = f
self.unit = unit
self.N = N
self.tree = [self.unit] * (2*self.N)
#self._build(array)
def _build(self,array):
... | import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
N = int(eval(input()))
A = list(enumerate(map(int,input().split())))
A.sort(key = lambda x:-x[1])
left = list(range(-1,N + 2))
right = list(range(1,N + 4))
ans = 0
for i,a in A:
L ... | p03987 |
# -*- coding: utf-8 -*-
import sys
from operator import add
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] fo... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03987 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03987 |
import sys
class Node:
def __init__(self, key, value, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.value = value #ノードの値
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self):... | import sys
class Node:
def __init__(self, key, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self): #左の方が高いと正、右が高いと負の値を返す
return sel... | p03987 |
import bisect
N=int(eval(input()))
A=list(map(int,input().split()))
B=[i+1 for i in range(N)]
C=[]
for i in range(N):
C.append([A[i],B[i]])
C.sort()
L=[0,N+1]
ans=0
#print(C)
for i in range(N):
ans+=C[i][0]*(L[bisect.bisect_right(L,C[i][1])]-C[i][1])*(C[i][1]-L[bisect.bisect_left(L,C[i][1])-... | import sys
sys.setrecursionlimit(1000000)
N=int(eval(input()))
a=list(map(int,input().split()))
b=[i for i in range(1,N+1)]
A=[]
for i in range(N):
A.append([a[i],b[i]])
A.sort(reverse=True)
#print(A)
PL=[i for i in range(N+1)]+[N+1]
PR=[i for i in range(N+1)]+[N+1]
def findL(x):
if x==PL[x... | p03987 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**10
mod = 10**9 + 7
def f():
n = int(eval(input()))
a = list(map(int, input().split()))
b = [0]*n
for _ in range(n):
b[a[_]-1] = _
r = (b[0]+1) * (n-b[... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**10
mod = 10**9 + 7
def f():
n = int(eval(input()))
a = list(map(int, input().split()))
l = list(range(n+2))
r = list(range(n+2))
b = [0]*(n+2)
for i, x in... | p03987 |
def examA():
X = SI()
d = defaultdict(int)
for s in X:
if s=="T" and d["S"]>=1:
d["S"] -=1
else:
d[s] += 1
ans = d["S"] + d["T"]
print(ans)
return
def examB():
# じゅっぴーさんの
# https://juppy.hatenablog.com/entry/2019/02/11/%E8%9F%BB%E6%9... | def examA():
X = SI()
d = defaultdict(int)
for s in X:
if s=="T" and d["S"]>=1:
d["S"] -=1
else:
d[s] += 1
ans = d["S"] + d["T"]
print(ans)
return
def examB():
# 参考 earlgrey_yh
class Node:
def __init__(self, key, height):
... | p03987 |
# 点更新，区間クエリ
class SegTree:
# n : 元の配列の長さ
# init_list: 元の配列
# segfunc : 載せる関数（演算）
# ide_ele : segfuncの単位元
def __init__(self, n, init_list ,segfunc, ide_ele):
# num : 2**num >= n となる最小の整数 （葉の数）
# seg : segtreeのリスト
self.num = 2**((n-1).bit_length())
... |
# 1-indexed Binary Indexed Tree
class BIT:
def __init__(self, n, init_list):
self.num = n+1
self.tree = [0]*self.num
for i,e in enumerate(init_list):
self.update(i,e)
def update(self,k,x):
k = k+1
while k < self.num:
self.tree[k] += x... | p03987 |
def main():
n=int(eval(input()))
a=list(map(int,input().split()))
def func(l,i):
ret=l*(l+1)//2
ret-=i*(i+1)//2
ret-=(l-i-1)*(l-i)//2
return ret
dn={a[i]:i+1 for i in range(n)}
from bisect import bisect_left,insort
space=[0,n+1]
ans=0
for i in range(1,n+1):
t=dn[i]
... | n=int(eval(input()))
p=list(map(int,input().split()))
dn={x:i for i,x in enumerate(p)}
#####segfunc#####
def segfunc(x, y):
return x+y
#################
#####ide_ele#####
ide_ele = 0
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値を... | p03987 |
#!/usr/bin/env python3
class UnionFind:
__slots__ = ['id','sz']
def __init__(self, n):
self.id = [-1] * n
def root(self, x):
if self.id[x] < 0:
return x
else:
self.id[x] = self.root(self.id[x])
return self.id[x]
def find(self, ... | #!/usr/bin/env python3
ans=0
n=int(eval(input()))
A=list(map(int,input().split()))
B=[0]*(n+1)
for i in range(n):
B[A[i]]=i+1
LL=[int(i) for i in range(n+2)]
RR=[int(i) for i in range(n+2)]
for i in range(n,0,-1):
l=LL[B[i]]
r=RR[B[i]]
ans+=(B[i]-l+1)*(r-B[i]+1)*i
LL[r+1]=l
RR[l-1]... | p03987 |
import bisect
class BTreeNode:
def __init__(self):
self.key = []
self.child = []
class BTree:
def __init__(self):
self.root = BTreeNode()
def search_higher(self, key):
ptr = self.root
ret = None
while ptr.child:
i = bisect.bis... | from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
class BTree:
def __init__(self):self.root=BTreeNode()
def search_higher(self,key):
ptr=self.root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=... | p03987 |
from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
class BTree:
def __init__(self):self.root=BTreeNode()
def search_higher(self,key):
ptr=self.root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=... | from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
root=BTreeNode()
def main():
def search_higher(key):
ptr=root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=ptr.key[i]
ptr=ptr.child[i... | p03987 |
from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
def main():
root=BTreeNode()
def search_higher(key):
ptr=root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=ptr.key[i]
ptr=ptr.chi... | from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
class BTree:
def __init__(self):self.root=BTreeNode()
def search_higher(self,key):
ptr=self.root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=... | p03987 |
from bisect import*
class BTreeNode:
def __init__(self):self.key,self.child=[],[]
class BTree:
def __init__(self):self.root=BTreeNode()
def search_higher(self,key):
ptr=self.root
ret=None
while ptr.child:
i=bisect(ptr.key,key)
if i!=len(ptr.key):ret=... | from bisect import*
class SqrtSet:
def __init__(self,block_limit=201):
self.key=[]
self.child=[[]]
self.block_limit=block_limit
def search_lower(self,key):
if not key:return None
ret=None
i=bisect_left(self.key,key)
if i:ret=self.key[i-1]
... | p03987 |
from bisect import*
class SqrtSet:
def __init__(self,block_limit=201):
self.key=[]
self.child=[[]]
self.block_limit=block_limit
def search_lower(self,key):
if not key:return None
ret=None
i=bisect_left(self.key,key)
if i:ret=self.key[i-1]
... | class UnionFind():
def __init__(self,size):
self.table=[-1]*size
def root(self,x):
while self.table[x]>=0:
x=self.table[x]
return x
def unite(self,x,y):
s1=self.root(x)
s2=self.root(y)
if s1!=s2:
if self.table[s1]>self.table[... | p03987 |
import bisect
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [0 for i in range(n)]
for i in range(n): b[a[i]-1] = i
ans,c = (b[0]+1)*(n-b[0]),[b[0]]
for i in range(1,n):
x = bisect.bisect_left(c,b[i])
if 0<x<len(c): ans += (c[x]-b[i])*(b[i]-c[x-1])*(i+1)
elif x==0: ans += (c[0]-b[i])*(b[i]... | n = int(eval(input()))
a = [int(i) for i in input().split()]
b,l,r,ans = [0]*(n+1),[i for i in range(n+2)],[i for i in range(n+2)],0
for i in range(n): b[a[i]]=i
for i in range(n,0,-1):
m = b[i]
x,y = l[m],r[m]
ans+=i*(m-x+1)*(y-m+1)
l[y+1],r[x-1] = x,y
print(ans) | p03987 |
import sys
sys.setrecursionlimit(2*10**5)
n = int(eval(input()))
a = list(map(int, input().split()))
# aのindexを前計算
d = {}
for i,j in enumerate(a):
d[j] = i
# segtree
data = [float("inf")]*(2*n)
# a_k の値を x に更新
def update(k, x):
k += n-1
data[k] = x
while k >= 0:
k = (k - 1) ... | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i,j in enumerate(a):
d[j] = i
uf = [-1]*n
def root(a):
if uf[a] < 0:
return a
uf[a] = root(uf[a])
return uf[a]
def unite(a,b):
ra,rb = root(a),root(b)
if ra==rb:
return False
if uf[ra] > uf... | p03987 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
dp = [-1] * (N + 1)
count = [0] * N
for i in range(N):
count[i] = i - dp[A[i]]
dp = dp[:A[i]] + [i] * (N - A[i] + 1)
dp_r = [N] * (N + 1)
ans = 0
for i in range(N - 1, -1, -1):
ans += A[i] * (dp_r[A[i]] - i) * count[i]
dp_r = dp_r[:... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
left = list(range(N + 2))
right = list(range(N + 2))
index = {A[i - 1]: i for i in range(1, N + 1)}
ans = 0
for a in range(N, 0, -1):
i = index[a]
l = left[i]
r = right[i]
ans += a * (i - l + 1) * (r - i + 1)
left[r + 1] = l
... | p03987 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
ans = 0
Ai = [(a, i + 1) for i, a in enumerate(A)]
Ai.sort(key=lambda x: x[0])
st = SegmentTree(n=N + 2, f=lambda x, y: x + y)
st.set_val(0, 1)
st.set_val(N + 1, 1)
for a, i in Ai:
lc = st.query(0, i)... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, A):
ans = 0
Ai = [(a, i + 1) for i, a in enumerate(A)]
Ai.sort(key=lambda x: x[0])
st = SegmentTree(n=N + 2, f=lambda x, y: x + y)
st.set_val(0, 1)
st.set_val(N + 1, 1)
for a, i in Ai:
lc = st.query(0, i)... | p03987 |
#!/usr/bin/env python3
import sys
import random
class Node(object):
__slots__ = ['value', 'cnt', 'pri', 'lch', 'rch']
def __init__(self, value):
self.value = value
self.cnt = 1
self.pri = random.randint(1, 1 << 64)
self.lch = None
self.rch = None
def __... | #!/usr/bin/env python3
import sys
def solve(N: int, a: "List[int]"):
idx = {aa: i for i, aa in enumerate(a)}
left = [i for i in range(N+2)]
right = [i for i in range(N+2)]
res = 0
for n in range(N, 0, -1):
i = idx[n]
l = left[i]
r = right[i]
res += n * ... | p03987 |
n=int(eval(input()))
ide_ele=n
num=2**(n-1).bit_length()
seg=[ide_ele]*2*num
segfunc=min
def init(init_val):
for i in range(n):
seg[i+num-1]=init_val[i]
for i in range(num-2,-1,-1) :
seg[i]=segfunc(seg[2*i+1],seg[2*i+2])
def update(k,x):
k+=num-1
seg[k]=x
while k+1:
... | n=int(eval(input()))
A=[int(i) for i in input().split()]
Ans=[0]*n
Ans[0]=1
Stack=[[A[0],1]]
for i in range(1,n):
a=A[i]
b,ct_b=Stack.pop()
ct=1
while b>a and Stack:
ct+=ct_b
b,ct_b=Stack.pop()
if b<a:
Stack.append([b,ct_b])
Stack.append([a,ct])
else:
Stack.append([a,ct... | p03987 |
class BinaryIndexTree: # 1-indexed
def __init__(self, N):
"""
INPUT
N [int] -> 全部0で初期化
N [list] -> そのまま初期化
"""
if isinstance(N, int):
self.N = N
self.depth = N.bit_length()
self.tree = [0] * (N + 1)
self.elem... | N = int(eval(input()))
A = list(map(int, input().split()))
a_to_i = {a: i for i, a in enumerate(A, start=1)}
L = [i - 1 for i in range(N + 2)]
R = [i + 1 for i in range(N + 2)]
ans = 0
for a in range(N, 0, -1):
i = a_to_i[a]
ans += a * (R[i] - i) * (i - L[i])
L[R[i]] = L[i]
R[L[i]] = R[i]
... | p03987 |
A, B = list(map(int, input().split()))
if B % A == 0: print(str(A+B))
else: print(str(B-A))
| A, B = list(map(int, input().split()))
if B % A == 0: print((A+B))
else: print((B-A)) | p03125 |
a,b=list(map(int,input().split()))
if b%a==0:
print((a+b))
else:
print((b-a)) | a,b=list(map(int,input().split()))
print((b-a+2*a*(b%a==0))) | p03125 |
A, B = list(map(int, input().split()))
if B % A == 0:
print((A+B))
else:
print((B-A)) | A, B = list(map(int, input().split()))
print((B+A if B%A == 0 else B-A)) | p03125 |
def read():
return int(eval(input()))
def reads():
return list(map(int, input().split()))
a,b =reads()
if b%a == 0:
print((a+b))
else:
print((b-a)) | a,b = list(map(int,input().split()))
print((a+b if b%a == 0 else b-a)) | p03125 |
A, B = list(map(int,input().split()))
if B % A == 0:
print((A + B))
else:
print((B - A)) | a,b=list(map(int,input().split()))
if b%a== 0:
print((a+b))
else:
print((b-a)) | p03125 |
a, b = list(map(int, input().split()))
print(((a + b) if b % a == 0 else (b - a)))
| a,b=list(map(int,input().split()));print(([b+a,b-a][b%a>0])) | p03125 |
a,b=list(map(int,input().split()));print(((b-a)*(b%a>0)or a+b)) | a,b=list(map(int,input().split()))
print((a+b-2*a*(b%a>0))) | p03125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.