input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python3
import sys
def solve(N: int, S: str):
count = 0
for i in range(N):
if S[i] == "R":
for j in range(i + 1, N):
if S[j] == "G":
for k in range(j + 1, N):
if S[k] == "B" and j - i != k - j:
count += 1
elif S[j] == "B":
for k in range(j + 1, N):
if S[k] == "G" and j - i != k - j:
count += 1
elif S[i] == "G":
for j in range(i + 1, N):
if S[j] == "R":
for k in range(j + 1, N):
if S[k] == "B" and j - i != k - j:
count += 1
elif S[j] == "B":
for k in range(j + 1, N):
if S[k] == "R" and j - i != k - j:
count += 1
else:
for j in range(i + 1, N):
if S[j] == "G":
for k in range(j + 1, N):
if S[k] == "R" and j - i != k - j:
count += 1
elif S[j] == "R":
for k in range(j + 1, N):
if S[k] == "G" and j - i != k - j:
count += 1
print(count)
return
# 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():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = next(tokens) # type: str
solve(N, S)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
r = 0
g = 0
b = 0
sub = 0
for i in range(N):
if S[i] == "R":
r += 1
for j in range(i + 1, N):
if S[j] == "G":
if j * 2 - i < N and S[j * 2 - i] == "B":
sub += 1
elif S[j] == "B":
if j * 2 - i < N and S[j * 2 - i] == "G":
sub += 1
elif S[i] == "G":
g += 1
for j in range(i + 1, N):
if S[j] == "R":
if j * 2 - i < N and S[j * 2 - i] == "B":
sub += 1
elif S[j] == "B":
if j * 2 - i < N and S[j * 2 - i] == "R":
sub += 1
else:
b += 1
for j in range(i + 1, N):
if S[j] == "R":
if j * 2 - i < N and S[j * 2 - i] == "G":
sub += 1
elif S[j] == "G":
if j * 2 - i < N and S[j * 2 - i] == "R":
sub += 1
print((r * g * b - sub))
return
# 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():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = next(tokens) # type: str
solve(N, S)
if __name__ == '__main__':
main()
| p02714 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
s = S()
rgb = [None for _ in range(n)]
rgb_acc = [None for _ in range(n)]
rgb_st = {"R","G","B"}
rgb_lst = ["R","G","B"]
for i, char in enumerate(s):
if char == "R":
rgb[i] = [1,0,0]
elif char == "G":
rgb[i] = [0,1,0]
else:
rgb[i] = [0,0,1]
rgb_acc[0] = rgb[0]
for i in range(1, n):
rgb_acc[i] = rgb_acc[i-1][:]
index = 0 if s[i]=="R" else 1 if s[i]=="G" else 2
rgb_acc[i][index] += 1
ans = 0
for i in range(n-2):
for j in range(i+1,n-1):
if s[i]!=s[j]:
ex = rgb_st - {s[i], s[j]}
ex = ex.pop()
index = 0 if ex=="R" else 1 if ex=="G" else 2
cnt = rgb_acc[n-1][index]-rgb_acc[j][index]
if j+1 <= 2*j-i < n:
if s[2*j-i] == ex:
cnt -= 1
ans += cnt
print(ans)
main() | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
s = S()
rgb = ["R","G","B"]
rgb_st = set(rgb)
rgb_acc = [[0]*n for _ in range(3)]
index = rgb.index(s[0])
rgb_acc[index][0] += 1
ans = 0
for i in range(1,n):
for j in range(3):
rgb_acc[j][i] = rgb_acc[j][i-1]
index = rgb.index(s[i])
rgb_acc[index][i] += 1
for i in range(n-2):
for j in range(i+1,n-1):
if s[i] != s[j]:
ex = (rgb_st-{s[i],s[j]}).pop()
index = rgb.index(ex)
cnt = rgb_acc[index][-1] - rgb_acc[index][j]
if j<2*j-i<n:
if s[2*j-i] == ex:
cnt -= 1
ans += cnt
print(ans)
main()
| p02714 |
n=int(eval(input()))
s=input().rstrip()
count=0
for i in range(n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if (j-i)!=(k-j):
if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
count+=1
print(count) | n=int(eval(input()))
s=input().rstrip()
r=s.count("R")
g=s.count("G")
b=s.count("B")
count=0
for i in range(n-2):
for j in range(i+1,n-1):
if j+j-i<n:
if s[i]!=s[j] and s[i]!=s[j+j-i] and s[j]!=s[j+j-i]:
count+=1
print((r*g*b-count)) | p02714 |
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
import sys
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(eval(input()))
mii = lambda: list(map(int, input().split()))
lmii = lambda: list(map(int, input().split()))
smii = lambda: sorted(map(int, input().split()))
N = ii()
S = si()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i)
if S[i] == 'G':
G.append(i)
if S[i] == 'B':
B.append(i)
colors = [
[R, G, B],
[R, B, G],
[G, R, B],
[G, B, R],
[B, R, G],
[B, G, R],
]
cand = []
for C1, C2, C3 in colors:
for c1 in C1:
for c2 in C2:
if c1 > c2:
continue
for c3 in C3:
if c2 > c3:
continue
if c1 > c3:
continue
cand.append((c1,c2,c3))
ans = 0
for c1, c2, c3 in cand:
if c2 - c1 != c3 - c2:
ans += 1
print(ans) | import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
import sys
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(eval(input()))
mii = lambda: list(map(int, input().split()))
lmii = lambda: list(map(int, input().split()))
smii = lambda: sorted(map(int, input().split()))
N = ii()
S = si()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i)
if S[i] == 'G':
G.append(i)
if S[i] == 'B':
B.append(i)
colors = [
[R, G, B],
[R, B, G],
[G, R, B],
[G, B, R],
[B, R, G],
[B, G, R],
]
ans = 0
for C1, C2, C3 in colors:
for c1 in C1:
for c2 in C2:
if c1 > c2:
continue
for c3 in C3:
if c2 > c3:
continue
if c1 > c3:
continue
if c2 - c1 != c3 - c2:
ans += 1
print(ans) | p02714 |
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
import sys
import bisect
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(eval(input()))
mii = lambda: list(map(int, input().split()))
lmii = lambda: list(map(int, input().split()))
smii = lambda: sorted(map(int, input().split()))
N = ii()
S = si()
R = []
G = []
B = []
for i in range(N):
if S[i] == 'R':
R.append(i)
if S[i] == 'G':
G.append(i)
if S[i] == 'B':
B.append(i)
colors = [
[R, G, B],
[R, B, G],
[G, R, B],
[G, B, R],
[B, R, G],
[B, G, R],
]
ans = 0
for C1, C2, C3 in colors:
for c1 in C1:
for c2 in C2:
if c1 > c2:
continue
ans += len([c3 for c3 in C3 if c3 > c2 and abs(c3-c2) != abs(c2-c1)])
print(ans) | import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
import sys
import bisect
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(eval(input()))
mii = lambda: list(map(int, input().split()))
lmii = lambda: list(map(int, input().split()))
smii = lambda: sorted(map(int, input().split()))
N = ii()
S = si()
r_cnt = S.count('R')
g_cnt = S.count('G')
b_cnt = S.count('B')
ans = r_cnt * g_cnt * b_cnt
for i in range(N):
for dist in range(N):
j = i + dist
k = j + dist
if k >= N:
break
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans) | p02714 |
from collections import Counter
s = input().rstrip()
L = len(s)
d = Counter(s)
print((L//2-d["p"])) | s = input().rstrip()
print((len(s)//2-s.count("p"))) | p03967 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/2/
Solved on 2019/2/
@author: shinjisu
"""
# ARC 062 C AtCoDeer and Rock-Paper
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def getIntLines(n): return [int(input()) for i in range(n)]
def getIntMat(n):
mat = []
for i in range(n):
mat.append(getIntList())
return mat
def zeros2(n, m): return [zeros(m)]*n
ALPHABET = [chr(i+ord('a')) for i in range(26)]
DIGIT = [chr(i+ord('0')) for i in range(10)]
def dmp(x, cmt=''):
global debug
if debug:
if cmt != '':
print(cmt, ': ', end='')
print(x)
return x
def probC():
S = input()
dmp(S)
GU = 'g'
PA = 'p'
guCount = 0
paCount = 0
point = 0
allTe = ''
for i in range(len(S)):
if S[i] == GU:
if paCount < guCount:
te = PA
paCount += 1
else:
te = GU
guCount += 1
else:
if paCount < guCount:
te = PA
paCount += 1
else:
te = GU
guCount += 1
if te == GU and S[i]== PA:
point -= 1
elif te == PA and S[i]== GU:
point += 1
allTe += te
dmp(allTe,'allTe')
dmp(point)
return point
debug = False # True False
ans = probC()
print(ans)
#for row in ans:
# print(row)
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/2/
Solved on 2019/2/
@author: shinjisu
"""
# ARC 062 C AtCoDeer and Rock-Paper
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def getIntLines(n): return [int(input()) for i in range(n)]
def getIntMat(n):
mat = []
for i in range(n):
mat.append(getIntList())
return mat
def zeros2(n, m): return [zeros(m)]*n
ALPHABET = [chr(i+ord('a')) for i in range(26)]
DIGIT = [chr(i+ord('0')) for i in range(10)]
def dmp(x, cmt=''):
global debug
if debug:
if cmt != '':
print(cmt, ': ', end='')
print(x)
return x
def probC():
S = input()
dmp(S)
GU = 'g'
PA = 'p'
guCount = 0
paCount = 0
point = 0
allTe = ''
for i in range(len(S)):
if paCount < guCount:
te = PA
paCount += 1
else:
te = GU
guCount += 1
if te == GU and S[i] == PA:
point -= 1
elif te == PA and S[i] == GU:
point += 1
allTe += te
dmp(allTe,'allTe')
dmp(point)
return point
debug = False # True False
ans = probC()
print(ans)
#for row in ans:
# print(row)
"""
if S[i] == GU:
if paCount < guCount:
te = PA
paCount += 1
else:
te = GU
guCount += 1
else:
if paCount < guCount:
te = PA
paCount += 1
else:
te = GU
guCount += 1
"""
| p03967 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**5
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
s = sys.stdin.readline().rstrip()
n = len(s)
dp = [0] * (n+1)
for i in range(n):
for j in range(i,-1,-1):
g = dp[j] - (1 if s[i] == 'p' else 0)
if 0 < j <= (i+1)//2:
p = dp[j-1] + (1 if s[i] == 'g' else 0)
else:
p = -INF
dp[j] = max(g,p)
print((dp[n//2]))
if __name__ == '__main__':
main() | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**5
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
s = sys.stdin.readline().rstrip()
n = len(s)
ans = 0
for i in range(n):
if i % 2 == 0:
if s[i] == 'p': ans -= 1
else:
if s[i] == 'g': ans += 1
print(ans)
if __name__ == '__main__':
main() | p03967 |
a = int(eval(input()))
b = list(map(int, input().split()))
c = {0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}
d = 0
for i in b:
if 1 <= i <= 399:
c[0] += 1
elif 400 <= i <= 799:
c[1] += 1
elif 800 <= i <= 1199:
c[2] += 1
elif 1200 <= i <= 1599:
c[3] += 1
elif 1600 <= i <= 1999:
c[4] += 1
elif 2000 <= i <= 2399:
c[5] += 1
elif 2400 <= i <= 2799:
c[6] += 1
elif 2800 <= i <= 3199:
c[7] += 1
else:
d += 1
e = 0
for k, v in list(c.items()):
if v != 0:
e += 1
print((str(max(e, 1)) + " " + str(e + d)))
| a = int(eval(input()))
b = list(map(int, input().split()))
c = {}
for i in b:
if 1 <= i <= 399:
c[0] = 1
elif 400 <= i <= 799:
c[1] = 1
elif 800 <= i <= 1199:
c[2] = 1
elif 1200 <= i <= 1599:
c[3] = 1
elif 1600 <= i <= 1999:
c[4] = 1
elif 2000 <= i <= 2399:
c[5] = 1
elif 2400 <= i <= 2799:
c[6] = 1
elif 2800 <= i <= 3199:
c[7] = 1
else:
if 8 not in c:
c[8] = 1
else:
c[8] += 1
count = 0
se = 0
for k, v in list(c.items()):
if k == 8:
se = v
else:
count += 1
if se == 0:
print(("{} {}".format(count, count)))
else:
if count == 0:
print(("{} {}".format(1, se)))
else:
print(("{} {}".format(count, count + se)))
| p03695 |
def c_ColorfulLeaderboard(N, A):
from collections import defaultdict
color = defaultdict(int)
other = 0 # レート3200以上の選手の数
for a in A:
if 1 <= a <= 399:
color['gray'] += 1
elif 400 <= a <= 799:
color['brown'] += 1
elif 800 <= a <= 1199:
color['green'] += 1
elif 1200 <= a <= 1599:
color['skyblue'] += 1
elif 1600 <= a <= 1999:
color['blue'] += 1
elif 2000 <= a <= 2399:
color['yellow'] += 1
elif 2400 <= a <= 2799:
color['orange'] += 1
elif 2800 <= a <= 3199:
color['red'] += 1
elif 3200 <= a:
other += 1
# => 2 2,3 5,1 1
return '{} {}'.format(max(1, len(color)), len(color) + other)
N=int(eval(input()))
A=[int(i) for i in input().split()]
print((c_ColorfulLeaderboard(N, A))) | def c_colorful_leaderboard(N, A):
from collections import defaultdict
rating_list = defaultdict(int)
rating_color = ['gray', 'brown', 'green',
'skyblue', 'blue', 'yellow', 'orange', 'red'] # AtCoderのレート色
other = 0 # レート3200以上の選手の数
for rating in A:
r = rating // 400 # レート色は400刻みで変わるため
if r >= 8: # レート3200位上
other += 1
else:
rating_list[rating_color[r]] += 1
ans = '{} {}'.format(max(1, len(rating_list)), len(rating_list) + other)
return ans
N=int(eval(input()))
A=[int(i) for i in input().split()]
print((c_colorful_leaderboard(N, A))) | p03695 |
import sys
import random
input = sys.stdin.readline
class Segment_tree():
def __init__(self, n, arrange):
self.inf = pow(2, 32)
self.n = n
self.arrange = arrange
self.N = 1
while self.N < self.n:
self.N *= 2
self.size = self.N * 2
self.size -= 1
self.N -= 1
self.segment = [0]*(self.N) + self.arrange + [0]*(self.size-self.N-self.n)
#この次の処理は、求められる動作に応じて変化させる。ここでは区間最小値問題のコードを書く。
for i in range(self.N-1, -1, -1):
self.segment[i] = min([self.segment[2*i+1], self.segment[2*i+2]])
def undate(self, i, x):
i += (self.N-1)
self.segment[i] = x
while i > 0:
i = (i-1)//2
self.segment[i] = min([self.segment[2*i+1], self.segment[2*i+2]])
def find(self, a, b, k, l, r):
if r <= a or b <= l:
return self.inf
elif a <= l and r <= b:
return self.segment[k]
else:
find_l = self.find(a, b, 2*k+1, l, (l+r)//2)
find_r = self.find(a, b, 2*k+2, (l+r)//2, r)
return min([find_l, find_r])
def count(self, l, r):
return self.find(l, r, 0, 0, self.size-self.N)
class Segment_tree2():
def __init__(self, n, arrange):
self.inf = pow(2, 32)
self.n = n
self.arrange = arrange
self.N = 1
while self.N < self.n:
self.N *= 2
self.size = self.N * 2
self.size -= 1
self.N -= 1
self.segment = [0]*(self.N) + self.arrange + [0]*(self.size-self.N-self.n)
#この次の処理は、求められる動作に応じて変化させる。ここでは区間最小値問題のコードを書く。
for i in range(self.N-1, -1, -1):
self.segment[i] = max([self.segment[2*i+1], self.segment[2*i+2]])
def undate(self, i, x):
i += (self.N-1)
self.segment[i] = x
while i > 0:
i = (i-1)//2
self.segment[i] = max([self.segment[2*i+1], self.segment[2*i+2]])
def find(self, a, b, k, l, r):
if r <= a or b <= l:
return 0
elif a <= l and r <= b:
return self.segment[k]
else:
find_l = self.find(a, b, 2*k+1, l, (l+r)//2)
find_r = self.find(a, b, 2*k+2, (l+r)//2, r)
return max([find_l, find_r])
def count(self, l, r):
return self.find(l, r, 0, 0, self.size-self.N)
def solve(n, k, p):
segment_min = Segment_tree(n, p)
segment_max = Segment_tree2(n, p)
res = n-k+1
for i in range(n-k):
x, y = p[i], p[k+i]
a = segment_min.count(i+1, k+i-1)
b = segment_max.count(i+1, k+i-1)
if x < a and b < y:
res -= 1
return res
def solve2(n, a):
res = 1
for i in range(n-2):
if (a[i] > a[i+1]) or (a[i+1] > a[i+2]):
res += 1
return res
def main():
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
if k == 2:
ans = solve2(n, p)
else:
ans = solve(n, k, p)
print(ans)
if __name__ == "__main__":
main()
| import sys
from heapq import *
input = sys.stdin.readline
def solve(n, k, p):
res = n-k+1
count = 0
length = 1
judge_max = [-x for x in p[:k]]
judge_min = p[:k]
heapify(judge_max)
heapify(judge_min)
already = [False]*n
for i in range(k-1):
if p[i] < p[i+1]:
length += 1
else:
length = 1
if length == k:
count += 1
for i in range(k-1, n-1):
if p[i] < p[i+1]:
length += 1
else:
length = 1
already[p[i-k+1]] = True
while True:
vmax = -judge_max[0]
if already[vmax]:
heappop(judge_max)
continue
else:
break
while True:
vmin = judge_min[0]
if already[vmin]:
heappop(judge_min)
continue
else:
break
if p[i-k+1] < vmin and vmax < p[i+1]:
res -= 1
elif length >= k:
if count:
res -= 1
count += 1
heappush(judge_max, -p[i+1])
heappush(judge_min, p[i+1])
return res
def main():
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ans = solve(n, k, p)
print(ans)
if __name__ == "__main__":
main()
| p02904 |
class SegmentTree():
def __init__(self, values, merge_func=min, default=float("inf")):
n = len(values)
self.size = 1
self.default = default
self.merge = merge_func
while self.size < n:
self.size *= 2
# tree[0] = empty
# child of tree[n] = tree[n*2], tree[n*2+1]
self.tree = [self.default] * self.size * 2
for i in range(n):
self.tree[self.size + i] = values[i]
for i in range(self.size-1, 0, -1):
self.tree[i] = self.merge(self.tree[i*2], self.tree[i*2+1])
def __query(self, a, b, k, l, r):
if r <= a or b <= l:
return self.default
if a <= l and r <= b:
return self.tree[k]
left = self.__query(a, b, k*2, l, (l+r)//2)
right = self.__query(a, b, k*2+1, (l+r)//2, r)
return self.merge(left, right)
# query segmentation value of [a, b)
def query(self, a, b):
return self.__query(a, b, 1, 0, self.size)
def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
seq = 1
for i in range(K-1):
if P[i] < P[i+1]:
seq += 1
else:
seq = 1
has_orig = seq == K
rmq = SegmentTree(P)
rMq = SegmentTree(P, merge_func=max, default=-1)
ans = 1
for i in range(N-K):
if P[i+K-1] < P[i+K]:
seq += 1
else:
seq = 1
if seq >= K:
if not has_orig:
has_orig = True
ans += 1
continue
if P[i] != rmq.query(i, i+K+1) or P[i+K] != rMq.query(i, i+K+1):
ans += 1
print(ans)
if __name__ == "__main__":
main()
| import math
def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
seq = 1
for i in range(K-1):
if P[i] < P[i+1]:
seq += 1
else:
seq = 1
has_orig = seq == K
ln = int(math.log(K, 2))
dp1 = [[0] * N for _ in range(ln+1)]
dp2 = [[0] * N for _ in range(ln+1)]
dp1[0] = P
dp2[0] = P
for k in range(ln):
for i in range(N-2**k):
dp1[k+1][i] = min(dp1[k][i], dp1[k][i+2**k])
dp2[k+1][i] = max(dp2[k][i], dp2[k][i+2**k])
rmq = [float("inf")] * (N-K+1)
rMq = [0] * (N-K+1)
for i in range(N-K+1):
idx = i
for k in range(ln+1)[::-1]:
if K & (2**k):
rmq[i] = min(rmq[i], dp1[k][idx])
rMq[i] = max(rMq[i], dp2[k][idx])
idx += 2**k
ans = 1
for i in range(N-K):
if P[i+K-1] < P[i+K]:
seq += 1
else:
seq = 1
if seq >= K:
if not has_orig:
has_orig = True
ans += 1
continue
if P[i] != rmq[i] or P[i+K] < rMq[i]:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02904 |
from collections import deque
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
s = [1]*N
r = 0
for l in range(N):
r = max(l,r)
while r < N-1:
if P[r]<P[r+1]:
r += 1
else:
break
s[l] = r-l+1
q = deque([N]+P[:K-1])
ans = 0
for i in range(N-K+1):
q.append(P[i+K-1])
if min(q)!=P[i-1] or max(q)!=P[i+K-1]:
if s[i]<K:
ans += 1
q.popleft()
if max(s) >= K:
ans += 1
print(ans) | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
N0 = 2**(N-1).bit_length()
INF = 2**31-1
data_m = [INF]*(2*N0)
data_M = [INF]*(2*N0)
def update(k, x, data):
k += N0-1
data[k] = x
while k >= 0:
k = (k - 1) // 2
data[k] = min(data[2*k+1], data[2*k+2])
def query(l, r, data):
L = l + N0; R = r + N0
s = INF
while L < R:
if R & 1:
R -= 1
s = min(s, data[R-1])
if L & 1:
s = min(s, data[L-1])
L += 1
L >>= 1; R >>= 1
return s
for i in range(N):
update(i, P[i], data_m)
update(i, -P[i], data_M)
s = [1]*N
r = 0
for l in range(N):
r = max(l,r)
while r < N-1:
if P[r]<P[r+1]:
r += 1
else:
break
s[l] = r-l+1
ans = 0
if s[0]<K:
ans += 1
for i in range(1,N-K+1):
if query(i-1,i+K,data_m)!=P[i-1] or query(i-1,i+K,data_M)!=-P[i+K-1]:
if s[i]<K:
ans += 1
if max(s) >= K:
ans += 1
print(ans) | p02904 |
# -*- coding:utf8 -*-
n,k = list(map(int, input().split()))
p = list(map(int, input().split()))
ans = 1
all = [p]
for i in range(n - k):
c = p[:i] + sorted(p[i:i+k]) + p[i+k:]
if c not in all:
ans += 1
all.append(c)
print(ans) | # -*- coding:utf8 -*-
n,k = list(map(int, input().split()))
p = list(map(int, input().split()))
all = set()
all.add(''.join(map(str,p)))
for i in range(n - k):
c = p[:i] + sorted(p[i:i+k]) + p[i+k:]
all.add(''.join(map(str,c)))
print((len(all))) | p02904 |
#!/usr/bin/env python3
#AGC38 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 Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
p = LI()
ans = 0
que = deque()
que.append(0)
minlst = []
for i in range(1,n):
if p[que[-1]] < p[i]:
que.append(i)
else:
while que:
if p[que[-1]] < p[i]:
que.append(i)
break
else:
que.pop()
else:
que.append(i)
if i >= k:
minlst.append(p[que[0]])
if que[0] == i - k:
que.popleft()
minlst.append(p[que[0]])
que = deque()
que.append(0)
maxlst = []
for i in range(1,n):
if p[que[-1]] > p[i]:
que.append(i)
else:
while que:
if p[que[-1]] > p[i]:
que.append(i)
break
else:
que.pop()
else:
que.append(i)
if i >= k-1:
maxlst.append(p[que[0]])
if que[0] == i - k:
que.popleft()
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x]
def union(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
par = [i for i in range(n)]
rank = [0 for _ in range(n)]
for i in range(n-1):
if p[i] < p[i+1]:
union(i,i+1)
lst = []
for i in range(n-k+1):
if root(i) == root(i+k-1):
lst.append(i)
par = [i for i in range(n)]
rank = [0]*n
if len(lst) > 1:
for i in lst:
for j in lst[::-1]:
union(i,j)
for i in range(n-k):
if p[i] == minlst[i] and p[i+k] == maxlst[i+1]:
union(i,i+1)
s = set()
for i in range(n-k+1):
s.add(root(i))
print((len(s)))
| #!/usr/bin/env python3
#AGC38 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 Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,k = LI()
p = LI()
ans = 0
que = deque()
que.append(0)
minlst = []
for i in range(1,n):
if p[que[-1]] < p[i]:
que.append(i)
else:
while que:
if p[que[-1]] < p[i]:
que.append(i)
break
else:
que.pop()
else:
que.append(i)
if i >= k:
minlst.append(p[que[0]])
if que[0] == i - k:
que.popleft()
minlst.append(p[que[0]])
que = deque()
que.append(0)
maxlst = []
for i in range(1,n):
if p[que[-1]] > p[i]:
que.append(i)
else:
while que:
if p[que[-1]] > p[i]:
que.append(i)
break
else:
que.pop()
else:
que.append(i)
if i >= k-1:
maxlst.append(p[que[0]])
if que[0] == i - k:
que.popleft()
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x]
def union(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
lst = []
cnt = 1
tmp = p[0]
for i in range(1,n):
if tmp < p[i]:
cnt += 1
else:
if cnt >= k:
lst.append(i-k)
cnt = 1
tmp = p[i]
if cnt >= k:
lst.append(i-cnt+1)
par = [i for i in range(n)]
rank = [0]*n
if len(lst) > 1:
for i in lst:
for j in lst[::-1]:
union(i,j)
for i in range(n-k):
if p[i] == minlst[i] and p[i+k] == maxlst[i+1]:
union(i,i+1)
s = set()
for i in range(n-k+1):
s.add(root(i))
print((len(s)))
| p02904 |
class SegTree: # 0-index !!!
"""
fx: モノイドXでの二項演算
ex: モノイドXでの単位元
init(seq, fx, ex): 配列seqで初期化 O(N)
update(i, x): i番目の値をxに更新 O(logN)
query(l, r): 区間[l,r)をfxしたものを返す O(logN)
get(i): i番目の値を返す
show(): 配列を返す
"""
def __init__(self, seq, fx, ex):
self.n = len(seq)
self.fx = fx
self.ex = ex
self.size = 1<<(self.n - 1).bit_length()
self.tree = [ex] * (self.size * 2)
# build
for i, x in enumerate(seq, start=self.size):
self.tree[i] = x
for i in reversed(list(range(1, self.size))):
self.tree[i] = self.fx(self.tree[2 * i], self.tree[2 * i + 1])
def set(self, i, x): # O(log(n))
i += self.size
self.tree[i] = x
while i:
i >>= 1
self.tree[i] = self.fx(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, i, x):
i += self.size
self.tree[i] = x
while i > 1:
i >>= 1
self.tree[i] = self.fx(self.tree[2 * i], self.tree[2 * i + 1])
def query(self, l, r): # l = r の場合はたぶんバグるので注意
tmp_l = self.ex
tmp_r = self.ex
l += self.size
r += self.size
while l < r:
if l & 1:
tmp_l = self.fx(tmp_l, self.tree[l])
l += 1
if r & 1:
tmp_r = self.fx(self.tree[r - 1], tmp_r) # 交換法則を仮定しない(順序大事に)
l >>= 1
r >>= 1
return self.fx(tmp_l, tmp_r)
def get(self, i):
return self.tree[self.size + i]
def show(self):
return self.tree[self.size: self.size + self.n]
# ---------------------- #
n, k = (int(x) for x in input().split())
P = list(int(x) for x in input().split())
min_seg = SegTree(P, fx=min, ex=10**18)
max_seg = SegTree(P, fx=max, ex=0)
asc_count = [1] * n
for i in range(1, n):
if P[i] > P[i - 1]:
asc_count[i] = asc_count[i - 1] + 1
ans = 0
no_count = 0
min_out_flag = False
for i in range(n - k + 1):
if not min_out_flag or P[i + k - 1] != max_seg.query(i, i + k):
ans += 1
if asc_count[i + k - 1] >= k:
no_count += 1
if P[i] == min_seg.query(i, i + k):
min_out_flag = True
else:
min_out_flag = False
print((ans - max(no_count - 1, 0)))
| class SegTree: # 0-index !!!
def __init__(self, seq, fx, ex):
self.n = len(seq)
self.fx = fx
self.ex = ex
self.size = 1<<(self.n - 1).bit_length()
self.tree = [ex] * (self.size * 2)
# build
for i, x in enumerate(seq, start=self.size):
self.tree[i] = x
for i in reversed(list(range(1, self.size))):
self.tree[i] = self.fx(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, i, x):
i += self.size
self.tree[i] = x
while i > 1:
i >>= 1
self.tree[i] = self.fx(self.tree[2 * i], self.tree[2 * i + 1])
def query(self, l, r):
tmp_l = self.ex
tmp_r = self.ex
l += self.size
r += self.size
while l < r:
if l & 1:
tmp_l = self.fx(tmp_l, self.tree[l])
l += 1
if r & 1:
tmp_r = self.fx(self.tree[r - 1], tmp_r) # 交換法則を仮定しない(順序大事に)
l >>= 1
r >>= 1
return self.fx(tmp_l, tmp_r)
# ---------------------- #
n, k = (int(x) for x in input().split())
P = list(int(x) for x in input().split())
min_seg = SegTree(P, fx=min, ex=10**18)
max_seg = SegTree(P, fx=max, ex=0)
asc_count = [1] * n
for i in range(1, n):
if P[i] > P[i - 1]:
asc_count[i] = asc_count[i - 1] + 1
ans = 1
no_count = 0
if asc_count[k - 1] >= k:
no_count += 1
for i in range(1, n - k + 1):
if P[i - 1] != min_seg.query(i - 1, i + k - 1) or P[i + k - 1] != max_seg.query(i, i + k):
ans += 1
if asc_count[i + k - 1] >= k:
no_count += 1
print((ans - max(no_count - 1, 0)))
| p02904 |
from sys import stdin
import bisect
from collections import deque
N, K = [int(x) for x in stdin.readline().rstrip().split()]
P = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
Q = [-x for x in P[:K]]
Q.sort()
D = deque([x for x in P[:K]])
oc = 0
ordered_twice = False
for i in range(len(D) - 1):
if D[i] <= D[i + 1]:
oc += 1
for i in range(N - K + 1):
if i == 0:
ans += 1
if oc == K - 1:
ordered_twice = True
else:
D.popleft()
D.append(P[i + K - 1])
if P[i - 1] <= D[0]:
oc -= 1
if D[K - 2] <= D[K - 1]:
oc += 1
if oc == K - 1:
if not ordered_twice:
ordered_twice = True
if -P[i - 1] != Q[-1] or Q[0] < -P[i + K - 1]:
ans += 1
if -P[i - 1] == Q[-1]:
Q.pop()
bisect.insort_left(Q, -P[i + K - 1])
else:
if -P[i - 1] != Q[-1] or Q[0] < -P[i + K - 1]:
ans += 1
if -P[i - 1] == Q[-1]:
Q.pop()
bisect.insort_left(Q, -P[i + K - 1])
print(ans) | from sys import stdin
from collections import deque
N, K = [int(x) for x in stdin.readline().rstrip().split()]
P = [int(x) for x in stdin.readline().rstrip().split()]
ans = N - K + 1
D = deque([x for x in P[:K]])
oc = 0
ordered_twice = False
for i in range(len(D) - 1):
if D[i] <= D[i + 1]:
oc += 1
Q = deque([])
Q_min = []
Q_max = []
for i in range(N):
while len(Q) > 0 and P[Q[len(Q) - 1]] >= P[i]:
Q.pop()
Q.append(i)
if Q[len(Q) - 1] >= K - 1:
Q_min.append(P[Q[0]])
if Q[0] == i + 1 - K:
Q.popleft()
PP = [-x for x in P]
Q = deque([])
for i in range(N):
while len(Q) > 0 and PP[Q[len(Q) - 1]] >= PP[i]:
Q.pop()
Q.append(i)
if Q[len(Q) - 1] >= K - 1:
Q_max.append(-PP[Q[0]])
if Q[0] == i + 1 - K:
Q.popleft()
for i in range(N - K + 1):
if i > 0:
D.popleft()
D.append(P[i + K - 1])
if P[i - 1] <= D[0]:
oc -= 1
if D[K - 2] <= D[K - 1]:
oc += 1
if (Q_min[i - 1] == P[i - 1] and Q_max[i] == D[-1]) or (oc == K - 1 and ordered_twice):
ans -= 1
if oc == K - 1:
ordered_twice = True
print(ans) | p02904 |
def get_unique_list(seq):
seen = []
return [x for x in seq if x not in seen and not seen.append(x)]
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
p = (n - k) + 1
c = []
for i in range(p):
b = a.copy()
b[i: i+k] = sorted(set(b[i: i+k]))
c.append(b)
d = get_unique_list(c)
#d = set(list(map(tuple, c)))
print((len(d))) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
p = (n - k) + 1
c = []
for i in range(p):
b = a.copy()
b[i: i+k] = sorted(set(b[i: i+k]))
if b not in c:
c.append(b)
print((len(c))) | p02904 |
N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
class SegTree:
def __init__(self,size):
self.N=size
self.v=[-1]*(2*self.N-1)
self.w=[10**6]*(2*self.N-1)
def update(self,i,x):
i+=self.N-1
self.v[i]=x
self.w[i]=x
while i>0:
i=(i-1)//2
self.v[i]=max(self.v[i*2+1],self.v[i*2+2])
self.w[i]=min(self.w[i*2+1],self.w[i*2+2])
def max(self,a,b,i=0,l=0,r=1e9):
if r==1e9:
r=self.N
if r<=a or b<=l:
return -1
if a<=l and r<=b:
return self.v[i]
return max(self.max(a,b,i*2+1,l,(l+r)//2),self.max(a,b,i*2+2,(l+r)//2,r))
def min(self,a,b,i=0,l=0,r=1e9):
if r==1e9:
r=self.N
if r<=a or b<=l:
return 10**6
if a<=l and r<=b:
return self.w[i]
return min(self.min(a,b,i*2+1,l,(l+r)//2),self.min(a,b,i*2+2,(l+r)//2,r))
s=SegTree(2**18)
x,n=0,0
for i,p in enumerate(P):
s.update(i,p)
if P[i-1]<P[i]:
x+=1
if K-1<=i and x==K-1:
n+=1
x-=1
else:
x=0
r=1
n=max(0,n-1)
for i in range(N-K):
m,M=s.min(i+1,K+i),s.max(i+1,K+i)
if not (P[i]<m and M<P[K+i]):
r+=1
print((max(1,r-n))) | N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
from collections import deque
smin,smax=deque(),deque()
x,r,r2=0,0,0
for i,p in enumerate(P):
while len(smin)>0 and P[smin[-1]]>p:
smin.pop()
smin.append(i)
if smin[0]<=i-K:
smin.popleft()
while len(smax)>0 and P[smax[-1]]<p:
smax.pop()
smax.append(i)
if smax[0]<=i-K:
smax.popleft()
if i>0 and P[i-1]<P[i]:
x=min(x+1,K-1)
else:
x=0
if i==K-1 or (i>=K and not (P[i-K]<P[smin[0]] and smax[0]==i)):
if x!=K-1:
r+=1
else:
r2=1
print((r+1 if r2 else r)) | p02904 |
def main():
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
min_list=[]
max_list=[]
m=262143+n
segtree=[-1]*m
for i in range(262143,m):
segtree[i]=x[i-262143]
for i in range(262142,-1,-1):
if 2*i+1>=m:
segtree[i]=-1
elif 2*i+2>=m:
segtree[i]=segtree[2*i+1]
else:
segtree[i]=min(segtree[2*i+1],segtree[2*i+2])
for i in range(n-k+2):
qq=[[i,i+k-2,0,0]]
s=set()
while qq:
ii,jj,now,l=qq.pop()
kubun=2**l
now2=now-kubun+1
width=262144//kubun
left=width*now2
right=width*(now2+1)-1
if ii<=left and right<=jj:
s.add(segtree[now])
elif jj<left or right<ii:
continue
else:
qq.append([ii,jj,2*now+1,l+1])
qq.append([ii,jj,2*now+2,l+1])
min_list.append(min(s))
for i in range(262142,-1,-1):
if 2*i+1>=m:
segtree[i]=n+1
elif 2*i+2>=m:
segtree[i]=segtree[2*i+1]
else:
segtree[i]=max(segtree[2*i+1],segtree[2*i+2])
for i in range(n-k+2):
qq=[[i,i+k-2,0,0]]
s=set()
while qq:
ii,jj,now,l=qq.pop()
kubun=2**l
now2=now-kubun+1
width=262144//kubun
left=width*now2
right=width*(now2+1)-1
if ii<=left and right<=jj:
s.add(segtree[now])
elif jj<left or right<ii:
continue
else:
qq.append([ii,jj,2*now+1,l+1])
qq.append([ii,jj,2*now+2,l+1])
max_list.append(max(s))
cnt=0
flag=[True]*(n-k+1)
first=False
for i in range(n-1):
if x[i]<x[i+1]:
cnt+=1
else:
cnt=0
if cnt>=k-1:
if first==False:
first=True
else:
flag[i-k+2]=False
for i in range(1,n-k+1):
if x[i-1]<min_list[i] and max_list[i]<x[i+k-1]:
flag[i]=False
print((sum(flag)))
if __name__ == '__main__':
main()
| def main():
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
min_list=[]
max_list=[]
m=262143+n
segtree=[-1]*m
for i in range(262143,m):
segtree[i]=x[i-262143]
for i in range(262142,-1,-1):
j=2*i+1
if j>=m:
segtree[i]=-1
elif j+1>=m:
segtree[i]=segtree[j]
else:
segtree[i]=min(segtree[j],segtree[j+1])
for i in range(n-k+2):
qq=[(i,i+k-2,0,1)]
s=set()
while qq:
ii,jj,now,kubun=qq.pop()
now2=now-kubun+1
width=262144//kubun
left=width*now2
right=width*(now2+1)-1
if ii<=left and right<=jj:
s.add(segtree[now])
elif jj<left or right<ii:
continue
else:
qq.append((ii,jj,2*now+1,2*kubun))
qq.append((ii,jj,2*now+2,2*kubun))
min_list.append(min(s))
for i in range(262142,-1,-1):
j=2*i+1
if j>=m:
segtree[i]=n+1
elif j+1>=m:
segtree[i]=segtree[j]
else:
segtree[i]=max(segtree[j],segtree[j+1])
for i in range(n-k+2):
qq=[(i,i+k-2,0,1)]
s=set()
while qq:
ii,jj,now,kubun=qq.pop()
now2=now-kubun+1
width=262144//kubun
left=width*now2
right=width*(now2+1)-1
if ii<=left and right<=jj:
s.add(segtree[now])
elif jj<left or right<ii:
continue
else:
qq.append((ii,jj,2*now+1,2*kubun))
qq.append((ii,jj,2*now+2,2*kubun))
max_list.append(max(s))
cnt=0
flag=[True]*(n-k+1)
first=False
for i in range(n-1):
if x[i]<x[i+1]:
cnt+=1
else:
cnt=0
if cnt>=k-1:
if first==False:
first=True
else:
flag[i-k+2]=False
for i in range(1,n-k+1):
if x[i-1]<min_list[i] and max_list[i]<x[i+k-1]:
flag[i]=False
print((sum(flag)))
if __name__ == '__main__':
main()
| p02904 |
from itertools import accumulate
from collections import deque
N, K, *P = list(map(int, open(0).read().split()))
mi = []
Q = deque()
for i, p in enumerate(P):
while Q and P[Q[-1]] > p:
Q.pop()
Q.append(i)
if Q[0] == i - K:
Q.popleft()
mi.append(Q[0])
ma = []
Q = deque()
for i, p in enumerate(P):
while Q and P[Q[-1]] < p:
Q.pop()
Q.append(i)
if Q[0] == i - K:
Q.popleft()
ma.append(Q[0])
mi = mi[K - 1:]
ma = ma[K - 1:]
B = [mi[i] != i or ma[i + 1] != i + K for i in range(N - K)]
A = [0] + list(accumulate(x < y for x, y in zip(P, P[1:])))
S = [y - x != K - 1 for x, y in zip(A, A[K - 1:])]
ans = 1 + sum(b for b, s in zip(B, S[1:]) if s)
if S[0] and not all(S):
ans += 1
print(ans)
| from itertools import accumulate
from collections import deque
N, K, *P = list(map(int, open(0).read().split()))
def slide(A, K, cmp=lambda a, b: a > b):
res = []
Q = deque()
for i, a in enumerate(A):
while Q and cmp(A[Q[-1]], a):
Q.pop()
Q.append(i)
if Q[0] == i - K:
Q.popleft()
res.append(Q[0])
return res[K - 1:]
mi = slide(P, K)
ma = slide(P, K, lambda a, b: a < b)
B = [mi != i or ma != i + K for i, (mi, ma) in enumerate(zip(mi, ma[1:]))]
A = [0] + list(accumulate(x < y for x, y in zip(P, P[1:])))
S = [y - x != K - 1 for x, y in zip(A, A[K - 1:])]
ans = 1 + sum(b for b, s in zip(B, S[1:]) if s)
if S[0] and not all(S):
ans += 1
print(ans) | p02904 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
#ts=time.time()
#sys.setrecursionlimit(10**6)
input=sys.stdin.readline
show_flg=False
#show_flg=True
n,k=MI()
a=LI()
na=[-i for i in a]
qs,ql=[],[]
def slidmin(a,k):
n=len(a)
b=[0 for i in range(n-k+1)]
q=deque()
for i in range(k):
#show(q)
while q and a[q[-1]]>=a[i]:
q.pop()
q.append(i)
b[0]=a[q[0]]
s=len(q)
rt=[0 for _ in range(n-k+1)]
if s==k:
rt[0]=1
for i in range(k,n):
#show(q,i,a[q[0]])
while q and a[q[-1]]>=a[i]:
q.pop()
s-=1
q.append(i)
s+=1
if q[0]<=i-k:
q.popleft()
s-=1
b[i-k+1]=a[q[0]]
return rt,b
sz,m=slidmin(a,k)
sz,M=slidmin(na,k)
M=[-i for i in M]
ans=1
p=-1
c=0
for i in range(k):
if p<a[i]:
c+=1
else:
c=1
p=a[i]
fl=True if c==k else False
show(a)
for i in range(n-k):
if p<a[i+k]:
c+=1
else:
c=1
p=a[i+k]
inc=1
if c==k:
if fl:
inc=0
show('c==k')
fl=True
if a[i]==m[i] and a[i+k]==M[i+1]:
inc=0
show('min=m,Max=M')
show(i,inc)
ans+=inc
print(ans)
| from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
#ts=time.time()
#sys.setrecursionlimit(10**6)
input=sys.stdin.readline
show_flg=False
#show_flg=True
n,k=MI()
a=LI()
def slidmin(a,k):
n=len(a)
b=[0 for i in range(n-k+1)]
q=deque()
for i in range(k):
while q and a[q[-1]]>=a[i]:
q.pop()
q.append(i)
b[0]=a[q[0]]
s=len(q)
for i in range(k,n):
while q and a[q[-1]]>=a[i]:
q.pop()
s-=1
q.append(i)
s+=1
if q[0]<=i-k:
q.popleft()
s-=1
b[i-k+1]=a[q[0]]
return b
m=slidmin(a,k)
M=[-i for i in slidmin([-i for i in a],k)]
ans=1
p=-1
c=0
for i in range(k):
if p<a[i]:
c+=1
else:
c=1
p=a[i]
fl=True if c==k else False
for i in range(n-k):
if p<a[i+k]:
c+=1
else:
c=1
p=a[i+k]
inc=1
if c==k:
if fl:
inc=0
fl=True
if a[i]==m[i] and a[i+k]==M[i+1]:
inc=0
ans+=inc
print(ans)
| p02904 |
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
#ts=time.time()
#sys.setrecursionlimit(10**6)
input=sys.stdin.readline
show_flg=False
#show_flg=True
n,k=MI()
a=LI()
def slidmin(a,k):
n=len(a)
b=[0 for i in range(n-k+1)]
q=deque()
for i in range(k):
while q and a[q[-1]]>=a[i]:
q.pop()
q.append(i)
b[0]=a[q[0]]
s=len(q)
for i in range(k,n):
while q and a[q[-1]]>=a[i]:
q.pop()
s-=1
q.append(i)
s+=1
if q[0]<=i-k:
q.popleft()
s-=1
b[i-k+1]=a[q[0]]
return b
m=slidmin(a,k)
M=[-i for i in slidmin([-i for i in a],k)]
ans=1
p=-1
c=0
for i in range(k):
if p<a[i]:
c+=1
else:
c=1
p=a[i]
fl=True if c==k else False
for i in range(n-k):
if p<a[i+k]:
c+=1
else:
c=1
p=a[i+k]
inc=1
if c==k:
if fl:
inc=0
fl=True
if a[i]==m[i] and a[i+k]==M[i+1]:
inc=0
ans+=inc
print(ans)
| from collections import deque
def MI():
return list(map(int,input().split()))
def LI():
return [int(i) for i in input().split()]
n,k=MI()
a=LI()
def slidmin(a,k):
n=len(a)
b=[0 for i in range(n-k+1)]
q=deque()
for i in range(k):
while q and a[q[-1]]>=a[i]:
q.pop()
q.append(i)
b[0]=a[q[0]]
s=len(q)
for i in range(k,n):
while q and a[q[-1]]>=a[i]:
q.pop()
s-=1
q.append(i)
s+=1
if q[0]<=i-k:
q.popleft()
s-=1
b[i-k+1]=a[q[0]]
return b
m=slidmin(a,k)
M=[-i for i in slidmin([-i for i in a],k)]
ans=1
p=-1
c=0
for i in range(k):
if p<a[i]:
c+=1
else:
c=1
p=a[i]
fl=True if c==k else False
for i in range(n-k):
if p<a[i+k]:
c+=1
else:
c=1
p=a[i+k]
inc=1
if c==k:
if fl:
inc=0
fl=True
if a[i]==m[i] and a[i+k]==M[i+1]:
inc=0
ans+=inc
print(ans)
| p02904 |
from operator import add
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size-1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l<r:
if l&1:
x = self.operator_func(x, self.node[l-1])
l += 1
if r&1:
r -= 1
x = self.operator_func(x, self.node[r-1])
l >>= 1
r >>= 1
return x
N, K = list(map(int, input().split()))
*P, = list(map(int, input().split()))
INF = 10**12
tree_max = SegTree(N, -INF, operator_func=max)
tree_max.set_list(P)
tree_min = SegTree(N, INF, operator_func=min)
tree_min.set_list(P)
tree_monoinc = SegTree(N, INF, operator_func=min)
for i in range(N):
tree_monoinc.update(i, P[i]-P[i-1] if i else 0)
def isMonoinc(l, r):
# [l, r)
l += 1
return tree_monoinc.get(l, r)>=0
ans = N-K+1
orig = 0
for i in range(N-K+1):
if isMonoinc(i, i+K):
orig = 1
ans -= 1
elif i+K<N and tree_max.get(i, i+K+1)==P[i+K] and tree_min.get(i, i+K+1)==P[i]:
ans -= 1
ans += orig
print(ans)
| from operator import add
import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size-1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l<r:
if l&1:
x = self.operator_func(x, self.node[l-1])
l += 1
if r&1:
r -= 1
x = self.operator_func(x, self.node[r-1])
l >>= 1
r >>= 1
return x
def solve():
N, K = list(map(int, input().split()))
*P, = list(map(int, input().split()))
INF = 10**12
tree_max = SegTree(N, -INF, operator_func=max)
tree_max.set_list(P)
tree_min = SegTree(N, INF, operator_func=min)
tree_min.set_list(P)
tree_monoinc = SegTree(N, INF, operator_func=min)
for i in range(N):
tree_monoinc.update(i, P[i]-P[i-1] if i else 0)
def isMonoinc(l, r):
# [l, r)
l += 1
return tree_monoinc.get(l, r)>=0
ans = N-K+1
orig = 0
for i in range(N-K+1):
if isMonoinc(i, i+K):
orig = 1
ans -= 1
elif i+K<N and tree_max.get(i, i+K+1)==P[i+K] and tree_min.get(i, i+K+1)==P[i]:
ans -= 1
ans += orig
print(ans)
if __name__ == "__main__":
solve()
| p02904 |
from operator import add
import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size-1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l<r:
if l&1:
x = self.operator_func(x, self.node[l-1])
l += 1
if r&1:
r -= 1
x = self.operator_func(x, self.node[r-1])
l >>= 1
r >>= 1
return x
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
tree = SegTree(N, 10**12, min)
tree_min = SegTree(N, 10**12, min)
tree_max = SegTree(N, -10**12, max)
tree_min.set_list(P)
tree_max.set_list(P)
for i in range(N):
tree.update(i, P[i]-P[i-1] if i else P[i])
f = lambda l,r:tree.get(l+1, r)>=0
ans = N-K+1
isOrig = 0
for i in range(N-K):
if f(i, i+K):
ans -= 1
isOrig = 1
elif tree_min.get(i, i+1+K)==P[i] and tree_max.get(i, i+1+K)==P[i+K]:
ans -= 1
if f(N-K, N):
ans -= 1
isOrig = 1
ans += isOrig
print(ans) | from operator import add
import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size-1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l<r:
if l&1:
x = self.operator_func(x, self.node[l-1])
l += 1
if r&1:
r -= 1
x = self.operator_func(x, self.node[r-1])
l >>= 1
r >>= 1
return x
def solve():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
tree = SegTree(N, 10**12, min)
tree_min = SegTree(N, 10**12, min)
tree_max = SegTree(N, -10**12, max)
tree_min.set_list(P)
tree_max.set_list(P)
tree.set_list([P[i]-P[i-1] if i else P[i] for i in range(N)])
f = lambda l,r:tree.get(l+1, r)>=0
ans = N-K+1
isOrig = 0
for i in range(N-K):
if f(i, i+K):
ans -= 1
isOrig = 1
elif tree_min.get(i, i+1+K)==P[i] and tree_max.get(i, i+1+K)==P[i+K]:
ans -= 1
if f(N-K, N):
ans -= 1
isOrig = 1
ans += isOrig
print(ans)
solve()
| p02904 |
n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
#スライド最小値、スライド最大値
from collections import deque
def slide_max_index(a, K):
# max_idx[i]: 区間 [i - K + 1, i] (両側閉区間)における a の最大値を与えるインデックス
N = len(a)
max_idx = [0] * N # (長さKに満たない左側領域もついでに計算する)
deq = deque() # デック．番長順番待ちキューをシミュレートする．インデックスを格納しておく
for i in range(0,N):
while len(deq) > 0 and deq[0] <= i - K : deq.popleft() # 卒業する
while len(deq) > 0 and a[deq[-1]] < a[i] : deq.pop() # a[i] の入学で 望みがなくなった先輩達が脱落する
deq.append(i) # 新入生i は常に番長になる望みがある
max_idx[i] = deq[0] # 番長順番待ちキューの最左が番長
return max_idx
def slide_min_index(a, K):
# max_idx[i]: 区間 [i - K + 1, i] (両側閉区間)における a の最大値を与えるインデックス
N = len(a)
min_idx = [0] * N # (長さKに満たない左側領域もついでに計算する)
deq = deque() # デック．番長順番待ちキューをシミュレートする．インデックスを格納しておく
for i in range(0,N):
while len(deq) > 0 and deq[0] <= i - K : deq.popleft() # 卒業する
while len(deq) > 0 and a[deq[-1]] > a[i] : deq.pop() # a[i] の入学で 望みがなくなった先輩達が脱落する
deq.append(i) # 新入生i は常に番長になる望みがある
min_idx[i] = deq[0] # 番長順番待ちキューの最左が番長
return min_idx
min_idx=slide_min_index(p,k+1)
max_idx=slide_max_index(p,k+1)
eq=list(range(n-k+1))
for i in range(n-(k+1)+1):
if i==min_idx[i+k] and i+k==max_idx[i+k]:
eq[i+1]=eq[i]
pre=p[0]
a=[0]
c=0
for pi in p[1:]:
if pre<pi:
c+=1
else:
c=0
pre=pi
a.append(c)
eqi=-1
for i in range(n-k+1):
if a[i+k-1]>=k-1:
if eqi==-1:
eqi=i
else:
eq[i]=eqi
print((len(set(eq))))
#print(eq)
#print(a)
| n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
from heapq import heappop,heappush,heapify
import heapq
class pqheap:
def __init__(self,key=None):
self.p = list()
self.q = list()
def insert(self,x):
heapq.heappush(self.p, x)
return
def erase(self,x):
heapq.heappush(self.q, x)
return
def minimum(self):
while self.q and self.p[0] == self.q[0]:
heapq.heappop(self.p)
heapq.heappop(self.q)
return self.p[0] if len(self.p)>0 else None
minheap=pqheap()
maxheap=pqheap()
for i in range(k):
minheap.insert(p[i])
maxheap.insert(-p[i])
ans=1
premin=minheap.minimum()
premax=-maxheap.minimum()
for i in range(k,n):
ins=p[i]
era=p[i-k]
minheap.erase(era)
maxheap.erase(-era)
minheap.insert(ins)
maxheap.insert(-ins)
if premin==era and ins==-maxheap.minimum():
pass
else:
ans+=1
premax=-maxheap.minimum()
premin=minheap.minimum()
ans0=0
now=1
pre=p[0]
for x in p[1:]:
if x>pre:
now+=1
else:
now=1
if now==k:
ans0+=1
pre=x
print((ans-max(0,ans0-1)))
| p02904 |
def main():
def update(k,x):
k+=N0-1
data_min[k]=data_max[k]=x
while k>=0:
k=(k-1)//2
a,b=data_min[2*k+1],data_min[2*k+2]
data_min[k]=a if a<b else b
a,b=data_max[2*k+1],data_max[2*k+2]
data_max[k]=a if a>b else b
def query_min(l,r):
L,R=l+N0,r+N0
s=INF
while L<R:
if R&1:
R-=1
t=data_min[R-1]
if t<s:s=t
if L&1:
t=data_min[L-1]
if t<s:s=t
L+=1
L//=2
R//=2
return s
def query_max(l,r):
L,R=l+N0,r+N0
s=0
while L<R:
if R&1:
R-=1
t=data_max[R-1]
if t>s:s=t
if L&1:
t=data_max[L-1]
if t>s:s=t
L+=1
L//=2
R//=2
return s
def root(x):
while table[x]>=0:x=table[x]
return x
def unite(x,y):
x=root(x)
y=root(y)
if x!=y:
if table[x]>table[y]:x,y=y,x
table[x]+=table[y]
table[y]=x
def same(x,y):return root(x)==root(y)
def size(x):return-table[root(x)]
n,k,*p=list(map(int,open(0).read().split()))
N0=2**(n-1).bit_length()
INF=10**18
data_min=[INF]*2*N0
data_max=[0]*2*N0
table=[-1]*n
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
for i,q in enumerate(p):update(i,q)
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
if not c and(a!=query_min(i,i+k)or b!=query_max(i+1,i+k+1)):x+=1
print((x+f))
main() | def main():
def update(k,x):
k+=N0-1
data_min[k]=data_max[k]=x
while k>=0:
k=(k-1)//2
a,b=data_min[2*k+1],data_min[2*k+2]
data_min[k]=a if a<b else b
a,b=data_max[2*k+1],data_max[2*k+2]
data_max[k]=a if a>b else b
def query_min(l,r):
L,R=l+N0,r+N0
s=INF
while L<R:
if R&1:
R-=1
t=data_min[R-1]
if t<s:s=t
if L&1:
t=data_min[L-1]
if t<s:s=t
L+=1
L//=2
R//=2
return s
def query_max(l,r):
L,R=l+N0,r+N0
s=0
while L<R:
if R&1:
R-=1
t=data_max[R-1]
if t>s:s=t
if L&1:
t=data_max[L-1]
if t>s:s=t
L+=1
L//=2
R//=2
return s
n,k,*p=list(map(int,open(0).read().split()))
N0=2**(n-1).bit_length()
INF=10**18
data_min=[INF]*2*N0
data_max=[0]*2*N0
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
for i,q in enumerate(p):update(i,q)
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
if not c and(a!=query_min(i,i+k)or b!=query_max(i+1,i+k+1)):x+=1
print((x+f))
main() | p02904 |
class SWAG():
def __init__(self,unit,f):
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
self.f=f
def __refill_right(self):
temp=[]
n=len(self.data_l)
for _ in range(n//2):
temp.append(self.popleft())
for _ in range(n//2,n):
self.append(self.popleft())
for _ in range(n//2):
self.appendleft(temp.pop())
def __refill_left(self):
temp=[]
n=len(self.data_r)
for _ in range(n//2):
temp.append(self.pop())
for _ in range(n//2,n):
self.appendleft(self.pop())
for _ in range(n//2):
self.append(temp.pop())
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.__refill_right()
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.__refill_left()
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min)
s_max=SWAG(0,max)
*_,=list(map(s_min.append,p[:k-1]))
*_,=list(map(s_max.append,p[1:k]))
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | class SWAG():
def __init__(self,unit,f):
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
self.f=f
def __refill_right(self):
temp=[]
n=len(self.data_l)
*_,=list(map(temp.append,(self.popleft()for _ in range(n//2))))
*_,=list(map(self.append,(self.popleft()for _ in range(n//2,n))))
*_,=list(map(self.appendleft,temp[::-1]))
def __refill_left(self):
temp=[]
n=len(self.data_r)
*_,=list(map(temp.append,(self.pop()for _ in range(n//2))))
*_,=list(map(self.appendleft,(self.pop()for _ in range(n//2,n))))
*_,=list(map(self.append,temp[::-1]))
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.__refill_right()
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.__refill_left()
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min)
s_max=SWAG(0,max)
*_,=list(map(s_min.append,p[:k-1]))
*_,=list(map(s_max.append,p[1:k]))
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | p02904 |
class SWAG():
def __init__(self,unit,f,data):
self.unit=unit
self.f=f
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
sep=len(data)//2
*_,=list(map(self.append,data[sep:]))
*_,=list(map(self.appendleft,data[sep-1::-1]))
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.__init__(self.unit,self.f,self.data_l[::-1])
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.__init__(self.unit,self.f,self.data_r)
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min,p[:k-1])
s_max=SWAG(0,max,p[1:k])
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | class SWAG():
def __init__(self,unit,f,data):
self.unit=unit
self.f=f
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
sep=len(data)//2
list(map(self.append,data[sep:]))
list(map(self.appendleft,data[sep-1::-1]))
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.__init__(self.unit,self.f,self.data_l[::-1])
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.__init__(self.unit,self.f,self.data_r)
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min,p[:k-1])
s_max=SWAG(0,max,p[1:k])
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | p02904 |
class SWAG():
__slots__=('unit','f','fold_r','fold_l','data_r','data_l')
def __init__(self,unit,f,data):
self.unit=unit
self.f=f
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
sep=len(data)//2
for t in data[sep:]:
self.append(t)
for t in data[sep-1::-1]:
self.appendleft(t)
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.__init__(self.unit,self.f,self.data_l[::-1])
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.__init__(self.unit,self.f,self.data_r)
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min,p[:k-1])
s_max=SWAG(0,max,p[1:k])
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | class SWAG():
def __init__(self,unit,f,data):
self.unit=unit
self.f=f
self.construct(data)
def construct(self,data):
self.fold_r=[self.unit]
self.fold_l=[self.unit]
self.data_r=[]
self.data_l=[]
sep=len(data)//2
for t in data[sep:]:
self.append(t)
for t in data[sep-1::-1]:
self.appendleft(t)
def append(self,x):
self.fold_r.append(self.f(self.fold_r[-1],x))
self.data_r.append(x)
def appendleft(self,x):
self.fold_l.append(self.f(self.fold_l[-1],x))
self.data_l.append(x)
def pop(self):
if not self.data_r:
self.construct(self.data_l[::-1])
self.fold_r.pop()
return self.data_r.pop()
def popleft(self):
if not self.data_l:
self.construct(self.data_r)
self.fold_l.pop()
return self.data_l.pop()
def fold_all(self):
return self.f(self.fold_r[-1],self.fold_l[-1])
n,k,*p=list(map(int,open(0).read().split()))
c=[0]
for a,b in zip(p,p[1:]):c+=c[-1]+(a<b),
*c,f=[b-a==k-1for a,b in zip(c,c[k-1:])]
x=not f
s_min=SWAG(10**18,min,p[:k-1])
s_max=SWAG(0,max,p[1:k])
for i,(a,b,c)in enumerate(zip(p,p[k:],c)):
f|=c
s_min.append(p[i+k-1])
s_max.append(b)
if not c and(a!=s_min.fold_all()or b!=s_max.fold_all()):x+=1
s_min.popleft()
s_max.popleft()
print((x+f)) | p02904 |
import copy
n,k = list(map(int,input().split()))
p = list(map(int,input().split()))
l_list = []
ans = 1
tmp = copy.deepcopy(p)
l = tmp[:3]
l.sort()
l_list.append(l+tmp[3:])
for i in range(1,n-2):
l = tmp[i:i+3]
l.sort()
l_list.append(tmp[:i] + l + tmp[i+3:])
if l_list[i-1] == l_list[i]:
continue
else:
ans += 1
print(ans)
| n,k = list(map(int,input().split()))
p = list(map(int,input().split()))
#リストを文字列化する方法
#''.join(map(str,p))
num_list = []
ans = 0
for i in range(n-k+1):
tmp = p[i:i+k]
tmp.sort()
string1 = ''.join(map(str,p[:i]))
string2 = ''.join(map(str,tmp))
string3 = ''.join(map(str,p[i+k:]))
string = string1+string2+string3
if string not in num_list:
num_list.append(string)
ans += 1
print(ans)
| p02904 |
NN = 18
MA = [-1] * ((1<<NN+1)-1)
MI = [1<<100] * ((1<<NN+1)-1)
def update(a, x):
i = (1<<NN) - 1 + a
MI[i] = x
MA[i] = x
while True:
i = (i-1) // 2
MI[i] = min(MI[2*i+1], MI[2*i+2])
MA[i] = max(MA[2*i+1], MA[2*i+2])
if i == 0:
break
def rangemin(a, b):
l = a + (1<<NN)
r = b + (1<<NN)
mi = 1<<100
while l < r:
if l%2:
mi = min(mi, MI[l-1])
l += 1
if r%2:
r -= 1
mi = min(mi, MI[r-1])
l >>= 1
r >>= 1
return mi
def rangemax(a, b):
l = a + (1<<NN)
r = b + (1<<NN)
ma = -1
while l < r:
if l%2:
ma = max(ma, MA[l-1])
l += 1
if r%2:
r -= 1
ma = max(ma, MA[r-1])
l >>= 1
r >>= 1
return ma
N, K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
a = 0
l = -1
cnt = 0
for i in range(1, N):
if A[i-1] > A[i]:
a = i
if i >= K-1 and a <= i - K + 1:
if i - l > 1:
cnt += 1
l = i
ans = 1 - max(cnt-1, 0)
for i in range(N):
update(i, A[i])
if i >= K:
mi = rangemin(i-K, i)
ma = rangemax(i-K+1, i+1)
if mi != A[i-K] or ma != A[i]:
ans += 1
print(ans) | from collections import deque
def slidemax(X, k):
q = deque([])
ret = []
for i in range(len(X)):
while q and q[-1][1] <= X[i]:
q.pop()
deque.append(q, (i+k, X[i]))
if q[0][0] == i:
deque.popleft(q)
if i >= k-1:
ret.append(q[0][1])
return ret
def slidemin(X, k):
q = deque([])
ret = []
for i in range(len(X)):
while q and q[-1][1] >= X[i]:
q.pop()
deque.append(q, (i+k, X[i]))
if q[0][0] == i:
deque.popleft(q)
if i >= k-1:
ret.append(q[0][1])
return ret
N, K = list(map(int, input().split()))
A = [int(a) for a in input().split()]
a = 0
l = -1
cnt = 0
for i in range(1, N):
if A[i-1] > A[i]: a = i
if i >= K-1 and a <= i - K + 1:
if i - l > 1: cnt += 1
l = i
MA = slidemax(A, K)
MI = slidemin(A, K)
ans = 1 - max(cnt-1, 0)
l = -1
for i in range(K, N):
if MI[i-K] != A[i-K] or MA[i-K+1] != A[i]:
ans += 1
print(ans) | p02904 |
n, k = list(map(int, input().split()))
xs = list(map(int, input().split()))
from collections import deque
def slide_max(k, l):
rs = []
dq = deque()
for i, x in enumerate(l):
while True:
if not len(dq):
dq.append(i)
break
lxi = dq[-1]
if x < l[lxi]:
dq.append(i)
break
dq.pop()
if i+1 < k:
continue
sxi = dq[0]
rs.append(l[sxi])
if sxi == (i + 1 - k):
dq.popleft()
return rs
def slide_min(k, l):
rs = []
dq = deque()
for i, x in enumerate(l):
while True:
if not len(dq):
dq.append(i)
break
lxi = dq[-1]
if x > l[lxi]:
dq.append(i)
break
dq.pop()
if i+1 < k:
continue
sxi = dq[0]
rs.append(l[sxi])
if sxi == (i + 1 - k):
dq.popleft()
return rs
maxs, mins = slide_max(k, xs), slide_min(k, xs)
aa, bb = xs[:k], xs[k:]
b, nb, bx = aa[0], aa[1], aa[-1]
ba = None
c = 1
for a in aa:
if ba == None:
ba = a
continue
if a > ba:
c += 1
else:
c = 1
ba = a
rok = False
if c == k:
rok = True
r = 1
bs = xs[0]
for i, (s, x) in enumerate(zip(xs[1:], bb)):
if x > bx:
c = min(c+1, k)
else:
c = 1
bx = x
if c == k:
if not rok:
r += 1
rok = True
continue
if x != maxs[i+1]:
r+=1
elif bs != mins[i]:
r+=1
bs = s
print(r)
| n, k = list(map(int, input().split()))
xs = list(map(int, input().split()))
from collections import deque
def slide_max(k, l):
rs, rrs = [], set()
dq = deque()
for i, x in enumerate(l):
while True:
if not len(dq):
dq.append(i)
break
lxi = dq[-1]
if x < l[lxi]:
dq.append(i)
break
dq.pop()
if i+1 < k:
continue
sxi = dq[0]
rs.append(l[sxi])
if sxi == (i + 1 - k):
dq.popleft()
return rs
def slide_min(k, l):
rs = []
rrs = set()
dq = deque()
for i, x in enumerate(l):
while True:
if not len(dq):
dq.append(i)
break
lxi = dq[-1]
if x > l[lxi]:
dq.append(i)
break
dq.pop()
if i+1 < k:
continue
if len(dq) == k:
rrs.add(i+1-k)
sxi = dq[0]
rs.append(l[sxi])
if sxi == (i + 1 - k):
dq.popleft()
return rs, rrs
maxs, (mins, ns) = slide_max(k, xs), slide_min(k, xs)
r = 1
for i, (s, x) in enumerate(zip(xs, xs[k:])):
if (x != maxs[i+1] or s != mins[i]) and (i+1 not in ns):
r+=1
if (0 not in ns) and (len(ns) > 0):
r += 1
print(r)
| p02904 |
n = int(eval(input()))
a = list(map(int, input().split()))
a = [0] + a + [0]
sa = []
for i in range(n+1):
sa.append(abs(a[i]-a[i+1]))
for i in range(1, n+1):
print((sum(sa) - sa[i-1] - sa[i] + abs(a[i-1]-a[i+1]))) | n = int(eval(input()))
a = list(map(int, input().split()))
a = [0] + a + [0]
sa = 0
for i in range(n+1):
sa += abs(a[i]-a[i+1])
for i in range(1, n+1):
print((sa - (abs(a[i-1]-a[i]) + abs(a[i]-a[i+1])) + abs(a[i-1]-a[i+1]))) | p03403 |
n = int(eval(input()))
list_a = list(map(int, input().split()))
list_memo = []
for i in range(0,n):
if i == 0:
list_memo.append(list_a[i])
else:
list_memo.append(list_a[i]-list_a[i-1])
list_memo.append(-list_a[n-1])
for i in range(0,n):
ans = 0
for j in range(0,n+1):
if j != i and j != i + 1:
ans += abs(list_memo[j])
ans += abs(list_memo[i+1] + list_memo[i])
print(ans)
| n = int(eval(input()))
list_a = list(map(int, input().split()))
list_memo = []
for i in range(0,n):
if i == 0:
list_memo.append(list_a[i])
else:
list_memo.append(list_a[i]-list_a[i-1])
list_memo.append(-list_a[n-1])
ans_pre = 0
for i in range(0,n+1):
ans_pre += abs(list_memo[i])
for i in range(0,n):
ans = ans_pre - abs(list_memo[i]) - abs(list_memo[i+1]) + abs(list_memo[i] + list_memo[i+1])
print(ans)
| p03403 |
n = int(eval(input()))
A = list(map(int, input().split()))
ans = [-1]*n
A = [0]+A+[0]
s = 0
for i in range(1, n+2):
s += abs(A[i]-A[i-1])
#print(s)
for i in range(n):
temp = s
temp -= abs(A[i+1]-A[i])
temp -= abs(A[i+2]-A[i+1])
temp += abs(A[i+2]-A[i])
ans[i] = temp
for i in range(n):
print((ans[i]))
| n = int(eval(input()))
A = list(map(int, input().split()))
A = [0]+A+[0]
s = 0
for i in range(1, n+2):
s += abs(A[i]-A[i-1])
for i in range(1, n+1):
ans = s
ans -= abs(A[i]-A[i-1])
ans -= abs(A[i+1]-A[i])
ans += abs(A[i+1]-A[i-1])
print(ans)
| p03403 |
n = int(eval(input()))
A = list(map(int, input().split()))
A = [0]+A+[0]
s = 0
for i in range(1, n+2):
s += abs(A[i]-A[i-1])
for i in range(1, n+1):
ans = s
ans -= abs(A[i]-A[i-1])
ans -= abs(A[i+1]-A[i])
ans += abs(A[i+1]-A[i-1])
print(ans)
| n = int(input())
A = list(map(int, input().split()))
res = 0
pre = 0
for a in A:
res += abs(a-pre)
pre = a
else:
res += abs(0-pre)
#print(res)
ans = [0]*n
A = [0]+A+[0]
for i in range(n):
j = i+1
temp = res-abs(A[j-1]-A[j])-abs(A[j+1]-A[j])+abs(A[j+1]-A[j-1])
ans[i] = temp
print(*ans, sep='\n')
| p03403 |
from operator import itemgetter
n = int(eval(input()))
a = [0] + list(map(int, input().split())) + [0]
sougaku = 0
for i in range(n + 1):
sougaku += abs(a[i] - a[i + 1])
for i in range(1, n + 1):
print((sougaku - abs(a[i] - a[i - 1]) - abs(a[i] - a[i + 1]) + abs(a[i - 1] - a[i + 1]))) | n = int(eval(input()))
a = [0] + list(map(int, input().split())) + [0]
sougaku = 0
for i in range(n + 1):
sougaku += abs(a[i] - a[i + 1])
for i in range(1, n + 1):
print((sougaku - abs(a[i] - a[i - 1]) - abs(a[i] - a[i + 1]) + abs(a[i - 1] - a[i + 1]))) | p03403 |
def run(lst, i):
lst = [0]+lst+[0]
cost = 0
a = lst[:i]+lst[i+1:]
for a,b in zip(a,a[1:]):
cost+=abs(b-a)
return cost
N = int(eval(input()))
l = list(map(int,input().split()))
for i in range(1,N+1):
print((run(l,i)))
| N = int(eval(input()))
l = list(map(int,input().split()))
l = [0]+l+[0]
cost = 0
for a,b in zip(l,l[1:]):
cost += abs(b-a)
for i in range(1,N+1):
n = cost
n-=abs(l[i-1]-l[i])
n-=abs(l[i]-l[i+1])
n+=abs(l[i-1]-l[i+1])
print(n)
| p03403 |
n = int(eval(input()))
a = [0] +list(map(int, input().split()))+[0]
money = [0]
for i in range(n+1):
money.append(abs(a[i]-a[i+1]))
ans = sum(money)
for i in range(n):
print((ans-sum(money[i+1:i+3])+abs(a[i]-a[i+2]))) | n = int(eval(input()))
A = [0]+ list(map(int, input().split())) + [0]
a = [0]
for i in range(1,n+2):
a.append(abs(A[i-1]-A[i]))
ans = sum(a)
for i in range(1,n+1):
x = ans - a[i] - a[i+1]
x += abs(A[i-1]-A[i+1])
print(x) | p03403 |
N = eval(input())
A = list(map(int, input().split()))
A = [0] + A + [0]
cost = sum([abs(A[i] - A[i + 1]) for i in range(N + 1)])
for i in range(N):
a, b, c = A[i:i + 3]
if max(a, b, c) == b or min(a, b, c) == b:
diff = - abs(a - b) - abs(b - c) + abs(a - c)
else:
diff = 0
print(cost + diff)
| N = eval(input())
A = [0] + list(map(int, input().split())) + [0]
cost = sum([abs(A[i] - A[i + 1]) for i in range(N + 1)])
for i in range(N):
a, b, c = A[i:i + 3]
print(cost - abs(a - b) - abs(b - c) + abs(a - c))
| p03403 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
A.append(0)
_A = []
for i in range(1,N+1):
_A.append(abs(A[i] - A[i-1]))
_A.append(abs(0-A[N]))
S = sum(_A)
for i in range(0,N):
allS = sum(_A)
allS -= (_A[i]+_A[i+1]-abs(A[i+2]-A[i]))
print(allS) | N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
A.append(0)
_A = []
for i in range(1,N+1):
_A.append(abs(A[i] - A[i-1]))
_A.append(abs(0-A[N]))
S = sum(_A)
for i in range(0,N):
allS = S
allS -= (_A[i]+_A[i+1]-abs(A[i+2]-A[i]))
print(allS) | p03403 |
N=int(eval(input()))
s= list(map(int,input().split()))
s.insert(0,0)
s.append(0)
for i in range(len(s)-2):
tmp=s[:]
del tmp[i+1]
tmp_sum=0
for i in range(len(tmp)-1):
tmp_sum+=abs(tmp[i]-tmp[i+1])
if i ==(len(tmp)-2):
print(tmp_sum) | n = int(eval(input()))
a = list(map(int, input().split()))
d = []
for i in range(n - 1):
d.append(abs(a[i + 1] - a[i]))
s = sum(d)
print((s - d[0] + abs(a[1]) + abs(a[-1])))
for i in range(n - 2):
print((s - d[i] - d[i + 1] + abs(a[i + 2] - a[i]) + abs(a[0]) + abs(a[-1])))
print((s - d[-1] + abs(a[0]) + abs(a[-2]))) | p03403 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = [0] + A + [0]
S = [0]*(N+2)
for i in range(1, N+2):
S[i] = S[i-1] + abs(B[i] - B[i-1])
max_s = S[-1]
for i in range(1, N+1):
ans = 0
ans += S[i-1]
ans += abs(B[i-1]-B[i+1])
ans += max_s - S[i+1]
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = [0] + A + [0]
diff_1 = [abs(B[i+1] - B[i]) for i in range(N+1)]
diff_2 = [abs(B[i+2] - B[i]) for i in range(N)]
ans = sum(diff_1)
for i in range(N):
tmp = ans + diff_2[i] - (diff_1[i] + diff_1[i+1])
print(tmp) | p03403 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.insert(0, 0)
a.append(0)
for i in range(n):
p = a[i + 1]
del a[i + 1]
ans = 0
for j in range(len(a) - 1):
ans += abs(a[j] - a[j + 1])
a.insert(i + 1, p)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a.insert(0, 0)
a.append(0)
ans = 0
for j in range(len(a) - 1):
ans += abs(a[j] - a[j + 1])
for i in range(n):
p = abs(a[i + 2] - a[i])
q = abs(a[i + 1] - a[i])
r = abs(a[i + 1] - a[i + 2] )
print((ans + p - q - r)) | p03403 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = [a[0]]
for i in range(n-1):
b.append(a[i+1]-a[i])
b.append(-a[-1])
for i in range(n):
k = 0
for l in range(n+1):
if l == i:
k += abs(b[i]+b[i+1])
elif l != i+1:
k += abs(b[l])
print(k)
| n = int(eval(input()))
a = list(map(int,input().split()))
a.append(0)
a.insert(0,0)
s = 0
for i in range(n+1):
s += abs(a[i]-a[i+1])
for i in range(1,n+1):
print((s-abs(a[i]-a[i-1])-abs(a[i]-a[i+1])+abs(a[i-1]-a[i+1])))
| p03403 |
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(int, input().split()))
A = list([0])
A.extend(a)
A.append(0)
sum = 0
for i in range(n):
root = list(A[:])
del root[i+1]
for j in range(1, n+1):
sum += abs(root[j]-root[j-1])
print(sum)
sum = 0
| if __name__ == '__main__':
n = int(eval(input()))
a = list(map(int, input().split()))
A = list([0])
A.extend(a)
A.append(0)
sum = 0
for i in range(1, n+2):
sum += abs(A[i]-A[i-1])
for i in range(1, n+1):
print((sum-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1])))
| p03403 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.append(0)
for i in range(n):
ans = 0
s = 0
for j in range(n+1):
if j != i:
ans += abs(s-a[j])
s = a[j]
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
a = [0] + a + [0]
s = 0
for i in range(n+1):
s += abs(a[i]-a[i+1])
for i in range(n):
print((s+abs(a[i]-a[i+2])-(abs(a[i]-a[i+1])+abs(a[i+1]-a[i+2])))) | p03403 |
import copy
N = int(eval(input()))
As = list(map(int, input().split()))
As = [0] + As + [0]
def dist(a, b):
return abs(a - b)
dAs = [dist(As[i], As[i+1]) for i in range(N+1)]
def rem(i):
ret = copy.deepcopy(dAs)
print(('copy', ret))
ret[i] = dist(As[max(0, i-1)], As[i+1])
print(('rett', ret, i))
ret = ret[:max(0, i-1)] + ret[i:]
print(('As', As))
print(('ret', ret))
return ret
def calc(i):
return sum(dAs) - dist(As[i], As[i-1]) - dist(As[i+1], As[i]) + dist(As[i+1], As[i-1])
for i in range(1, N+1):
print((calc(i)))
| import copy
import time
N = int(eval(input()))
As = list(map(int, input().split()))
As = [0] + As + [0]
t0 = time.time()
def dist(a, b):
return abs(a - b)
dAs = [dist(As[i], As[i+1]) for i in range(N+1)]
sumdAs = sum(dAs)
# print(time.time()-t0, 'a')
def rem(i):
ret = copy.deepcopy(dAs)
print(('copy', ret))
ret[i] = dist(As[max(0, i-1)], As[i+1])
print(('rett', ret, i))
ret = ret[:max(0, i-1)] + ret[i:]
print(('As', As))
print(('ret', ret))
return ret
def calc(i):
return sumdAs - dist(As[i], As[i-1]) - dist(As[i+1], As[i]) + dist(As[i+1], As[i-1])
for i in range(1, N+1):
print((calc(i)))
| p03403 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = abs(A[1])+abs(A[N])
for i in range(2,N+1):
tot += abs(A[i]-A[i-1])
for i in range(1,N+1):
if i==1:
print((tot-abs(A[1])-abs(A[2]-A[1])+abs(A[2])))
elif i==N:
print((tot-abs(A[N])-abs(A[N]-A[N-1])+abs(A[N-1])))
else:
print((tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1]))) | N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = 0
for i in range(1,N+1):
tot += abs(A[i]-A[i-1])
tot += abs(A[0]-A[N])
for i in range(1,N):
a = tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1])
print(a)
a = tot-abs(A[N]-A[N-1])-abs(0-A[N])+abs(0-A[N-1])
print(a) | p03403 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = 0
for i in range(1,N+1):
tot += abs(A[i]-A[i-1])
tot += abs(A[0]-A[N])
for i in range(1,N):
a = tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1])
print(a)
a = tot-abs(A[N]-A[N-1])-abs(0-A[N])+abs(0-A[N-1])
print(a) | N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = abs(A[1])
for i in range(2,N+1):
tot += abs(A[i]-A[i-1])
tot += abs(A[N])
print((tot-abs(A[1])-abs(A[2]-A[1])+abs(A[2])))
for i in range(2,N):
print((tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1])))
print((tot-abs(A[N])-abs(A[N]-A[N-1])+abs(A[N-1]))) | p03403 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = abs(A[1])
for i in range(2,N+1):
tot += abs(A[i]-A[i-1])
tot += abs(A[N])
for i in range(1,N+1):
if i==1:
print((tot-abs(A[1])-abs(A[2]-A[1])+abs(A[2])))
elif i==N:
print((tot-abs(A[N])-abs(A[N]-A[N-1])+abs(A[N-1])))
else:
print((tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1]))) | N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
tot = abs(A[1])
for i in range(2,N+1):
tot += abs(A[i]-A[i-1])
tot += abs(A[N])
for i in range(1,N):
a = tot-abs(A[i]-A[i-1])-abs(A[i+1]-A[i])+abs(A[i+1]-A[i-1])
print(a)
a = tot-abs(A[N]-A[N-1])-abs(A[N])+abs(A[N-1])
print(a) | p03403 |
import copy
n = int(eval(input()))
a = [0] + list(map(int,input().split())) + [0]
#print(a)
for i in range(1,len(a)-1):
ans = 0
for j in range(1,len(a)):
if(j-1 != i and j != i):
ans += abs(a[j]-a[j-1])
elif(j == i):
ans += abs(a[j+1]-a[j-1])
j+=1
print(ans)
| import copy
n = int(eval(input()))
a = [0] + list(map(int,input().split())) + [0]
#print(a)
anst = 0
for j in range(1,len(a)):
anst += abs(a[j]-a[j-1])
for j in range(1,len(a)-1):
ans = anst
ans -= abs(a[j-1]-a[j]) + abs(a[j]-a[j+1])
ans += abs(a[j-1]-a[j+1])
print(ans) | p03403 |
import fractions
from functools import reduce
from sys import stdin
N = int(stdin.readline().rstrip())
A = [int(_) for _ in stdin.readline().rstrip().split()]
for n in range(N):
path = [0]+A[0:n]+A[n+1:]+[0]
print((sum(abs(path[i]-path[i-1]) for i, _ in enumerate(path)))) | from sys import stdin
N = int(stdin.readline().rstrip())
A = [0]+[int(_) for _ in stdin.readline().rstrip().split()]+[0]
S = sum(abs(A[i+1]-A[i]) for i in range(N+1))
for i in range(1,N+1):
print((S-abs(A[i-1]-A[i])-abs(A[i]-A[i+1])+abs(A[i-1]-A[i+1]))) | p03403 |
N = int(eval(input()))
A = list(map(int, input().split()))
A = [0] + A + [0]
cost = [abs(A[i+1] - A[i]) for i in range(N+1)]
for i in range(N):
ans = sum(cost) - cost[i] - cost[i+1]
ans += abs(A[i]-A[i+2])
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A = [0] + A + [0]
cost = [abs(A[i+1] - A[i]) for i in range(N+1)]
cost_sum = sum(cost)
for i in range(N):
ans = cost_sum - cost[i] - cost[i+1]
ans += abs(A[i]-A[i+2])
print(ans) | p03403 |
n=int(eval(input()))
a=list(map(int, input().split()))
a.append(0)
for i in range(n):
cost=0
pv=0
nx=0
for j in range(len(a)):
if i == j:
continue
pv, nx = nx, a[j]
cost+=abs(pv-nx)
print(cost)
| n=int(eval(input()))
a=list(map(int, input().split()))
a=[0]+a+[0]
cost=[abs(a[i]-a[i+1]) for i in range(len(a)-1)]
total=sum(cost)
ans=0
for i in range(n):
ans = total - cost[i] - cost[i+1] + abs(a[i+2]-a[i])
print(ans)
| p03403 |
def cs(x):
ans = 0
for i in range(len(x)-1):
ans += abs(x[i+1]-x[i])
return ans
n = int(eval(input()))
a = [0] + list(map(int, input().split())) + [0]
for i in range(1, len(a)-1):
print((cs(a[:i] + a[i+1:]))) | def cs(x):
ans = 0
for i in range(len(x)-1):
ans += abs(x[i+1]-x[i])
return ans
n = int(eval(input()))
a = [0] + list(map(int, input().split())) + [0]
s = cs(a)
for i in range(1, len(a)-1):
dif = abs(a[i]-a[i-1]) + abs(a[i+1]-a[i]) - abs(a[i+1]-a[i-1])
print((s-dif)) | p03403 |
n = int(eval(input()))
tmpa = list(map(int, input().split()))
A = [0] * (n+2)
A[0] = 0
A[n+1] = 0
for i in range(1,n+1,1): A[i] = tmpa[i-1]
#普通に総和を出す
sum = 0
for i, a in enumerate(A):
if i == n+1: break #n+1はゴールなので先に行かない
sum += abs(a - A[i+1]) #a:A[i]
#引いて足す
for i in range(1, n+1, 1): #1～Nを省いたとき
nowsum = sum
nowsum -= abs(A[i-1]-A[i])
nowsum -= abs(A[i]-A[i+1])
nowsum += abs(A[i-1]-A[i+1])
print(nowsum)
| n = int(eval(input()))
A = [0] + list(map(int, input().split())) + [0]
#普通に総和を出す
sum = 0
for i, a in enumerate(A):
if i == n+1: break #n+1はゴールなので先に行かない
sum += abs(a - A[i+1]) #a:A[i]
#引いて足す
for i in range(1, n+1, 1): #1～Nを省いたとき
nowsum = sum
nowsum -= abs(A[i-1]-A[i])
nowsum -= abs(A[i]-A[i+1])
nowsum += abs(A[i-1]-A[i+1])
print(nowsum) | p03403 |
N = int(eval(input()))
A = [0] + list(map(int, input().split())) + [0]
total = 0
for i in range(N + 1):
total += abs(A[i + 1] - A[i])
for i in range(N):
print((total + abs(A[i + 2] - A[i]) - (abs(A[i + 1] - A[i] ) + abs(A[i + 2] - A[i + 1]))))
| N, *A = list(map(int, open(0).read().split()))
A = [0] + A + [0]
acc = [0] * (N + 2)
for i in range(N + 1):
acc[i + 1] = acc[i] + abs(A[i + 1] - A[i])
for i in range(N):
left = acc[i] - acc[0]
right = acc[N + 1] - acc[i + 2]
print((left + abs(A[i + 2] - A[i]) + right))
| p03403 |
n=int(eval(input()))
l=[0]+list(map(int,input().split()))+[0]
ans=0
for a,s in zip(l,l[1:]):
ans+=abs(a-s)
for i in range(n):
a,s=sorted([l[i],l[i+2]])
if a<=l[i+1]<=s:print(ans)
else:
print((ans-abs(a-l[i+1])-abs(l[i+1]-s)+s-a)) | n=eval(input())
l=[0]+list(map(int,input().split()))+[0]
ans=0
pre=0
for i in l:ans+=abs(pre-i);pre=i
for i in range(1,int(n)+1):
dif=-abs(l[i]-l[i-1])-abs(l[i]-l[i+1])+abs(l[i-1]-l[i+1])
if l[i]in(l[i-1],l[i+1]):print(ans)
elif l[i]<l[i-1]:
print((ans if l[i+1]<l[i] else ans+dif))
else:print((ans if l[i+1]>l[i] else ans+dif)) | p03403 |
n = int(eval(input()))
a = list(map(int, input().split()))
s = 0
a.insert(0, 0)
a.insert(n + 1, 0)
for i in range(1, n + 2):
s += abs(a[i - 1] - a[i])
for i in range(1, n + 1):
print((s - (abs(a[i - 1] - a[i]) + abs(a[i] - a[i + 1])) + abs(a[i - 1] - a[i + 1]))) | n = int(eval(input()))
a = [0] + list(map(int, input().split())) + [0]
s = 0
for i in range(1, n + 2):
s += abs(a[i] - a[i - 1])
for i in range(1, n + 1):
print((s - (abs(a[i] - a[i - 1]) + abs(a[i] - a[i + 1])) + abs(a[i - 1] - a[i + 1]))) | p03403 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.append(0)
for i in range(N):
ans = 0
tmp = 0
for index, a in enumerate(A):
if i != index:
ans += abs(tmp-a)
tmp = a
print(ans) | N = int(eval(input()))
A = [0]
A = A + list(map(int, input().split()))
A.append(0)
sumOfRoute = 0
tmp = 0
for a in A:
sumOfRoute += abs(tmp-a)
tmp = a
prev = 0
for i in range(1, N+1):
nexti = A[i+1]
print((sumOfRoute + abs(prev - nexti) - abs(A[i] - nexti) - abs(prev - A[i])))
prev = A[i]
| p03403 |
N = int(eval(input()))
A = list(map(int,input().split()))
L = []
A.insert(0,0)
A.insert(N+1,0)
for i in range(1,N+1):
k = 0
L.append(A[i])
del (A[i])
for j in range(N):
k += abs(A[j]-A[j+1])
A.insert(i,L[i-1])
print(k) | N = int(eval(input()))
A = list(map(int,input().split()))
A.insert(0,0)
A.insert(N+1,0)
S = 0
for i in range(N+1):
S += abs(A[i]-A[i+1])
for i in range(1,N+1):
print((S-abs(A[i-1]-A[i])-abs(A[i]-A[i+1])+abs(A[i-1]-A[i+1]))) | p03403 |
#!/usr/bin/env python3
def main():
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
fix = [0] + a[0:i] + a[i + 1:n] + [0]
ans[i] = sum([abs(fix[j] - fix[j - 1]) for j in range(1, n + 1)])
print(*ans, sep='\n')
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
def main():
n = int(input())
a = [0] + list(map(int, input().split())) + [0]
dist = [abs(a[i] - a[i - 1]) for i in range(1, n + 2)]
total = sum(dist)
ans = [0] * n
for i in range(n):
ans[i] = total - dist[i] - dist[i + 1] + abs(a[i] - a[i + 2])
print(*ans, sep='\n')
if __name__ == "__main__":
main()
| p03403 |
N = int(eval(input()))
A = [0] + list(map(int, input().split())) + [0]
dist = 0
for x, y in zip(A[:-1], A[1:]):
dist += abs(x - y)
for i in range(1, N + 1):
l, m, r = A[i - 1], A[i], A[i + 1]
d = dist
d -= abs(l - m)
d -= abs(r - m)
d += abs(r - l)
print(d) | N = int(eval(input()))
A = [0] + list(map(int, input().split())) + [0]
d = [x - y for y, x in zip(A[:-1], A[1:])]
dist = sum(abs(i) for i in d)
for i in range(N):
ans = dist - abs(d[i]) - abs(d[i + 1])
ans += abs(A[i] - A[i + 2])
print(ans) | p03403 |
import collections
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
m=[]
m2=[0]
for i in range(n):
m.append(a[i])
for i in range(n):
m2.append((m2[-1]+m[i]))
for i in range(n+1):
m2[i]-=i
m2[i]%=k
ans=0
dict=collections.defaultdict(int)
for i in range(1,n+1):
x=m2[i]
if i<=k-1:
dict[m2[i-1]]+=1
else:
dict[m2[i-1]]+=1
dict[m2[i-k]]-=1
ans+=dict[x]
print(ans) | import collections
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
m=[0]
for i in range(n):
m.append((m[-1]+a[i]))
for i in range(n+1):
m[i]-=i
m[i]%=k
ans=0
dict=collections.defaultdict(int)
for i in range(1,n+1):
x=m[i]
if i<=k-1:
dict[m[i-1]]+=1
else:
dict[m[i-1]]+=1
dict[m[i-k]]-=1
ans+=dict[x]
print(ans) | p02851 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
acc = [0] * (N + 1)
for i in range(1, N + 1):
acc[i] = acc[i - 1] + A[i - 1] - 1
acc[i] %= K
mp = defaultdict(int)
ans = 0
q = deque([])
for j in range(N + 1):
ans += mp[acc[j]]
mp[acc[j]] += 1
q.append(acc[j])
if len(q) == K:
mp[q[0]] -= 1
q.popleft()
print(ans) | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
acc = [0] * (N + 1)
for i in range(1, N + 1):
acc[i] = acc[i - 1] + A[i - 1] - 1
acc[i] %= K
mp = defaultdict(int)
ans = 0
for j in range(N + 1):
if j >= K:
mp[acc[j - K]] -= 1
ans += mp[acc[j]]
mp[acc[j]] += 1
print(ans) | p02851 |
N,K=list(map(int,input().split()))
A=[int(i) for i in input().split()]
# 2D dynamic programming solution?
dp = [[0]*(N) for i in range(N)]
dp[0] = A
num_seq = 0
for a in A:
if (a % K) == 1:
num_seq += 1
for i in range(1, len(A)):
for j in range(1,i+1):
if j == 1:
subseq_total = sum(A[i-j:i+1])
dp[j][i] = subseq_total
else:
subseq_total = dp[j-1][i-1] + A[i]
dp[j][i] = subseq_total
if (subseq_total % K) == (j+1):
num_seq += 1
#for row in dp:
# print(row)
print(num_seq)
| N,K=list(map(int,input().split()))
A=[int(i) for i in input().split()]
# 2D dynamic programming solution using 2 rows
dp = [[0]*(N) for i in range(2)]
dp[0] = A
num_seq = 0
for a in A:
if (a % K) == 1:
num_seq += 1
# pass through a single row first
for i in range(1, N): # i = row
for j in range(i, N): # j = col
if i == 1:
subseq_total = sum(A[j-1:j+1])
else:
subseq_total = dp[0][j-1] + A[j]
dp[1][j] = subseq_total
if (subseq_total % K) == (i+1):
num_seq += 1
dp[0] = dp[1]
dp[1] = [0]*N
#for row in dp:
# print(row)
print(num_seq)
| p02851 |
from collections import defaultdict
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
DBG = True and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n,k = inm()
a = inl()
h =defaultdict(int)
b = [0]*(n+1)
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i]+a[i]
b[i+1] = (s[i+1]-i-1)%k
ddprint(s)
ddprint(b)
acc = 0
for i in range(n+1):
if i>=k:
h[b[i-k]] -= 1
acc += h[b[i]]
h[b[i]] += 1
ddprint("i {} acc {} h {}".format(i,acc,h))
print(acc)
| from collections import defaultdict
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
DBG = True and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n,k = inm()
a = inl()
h =defaultdict(int)
b = [0]*(n+1)
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i]+a[i]
b[i+1] = (s[i+1]-i-1)%k
ddprint(s)
ddprint(b)
acc = 0
for i in range(n+1):
if i>=k:
h[b[i-k]] -= 1
acc += h[b[i]]
h[b[i]] += 1
#ddprint("i {} acc {} h {}".format(i,acc,h))
print(acc)
| p02851 |
from itertools import accumulate
from collections import Counter, defaultdict
import copy
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [0] + list(accumulate([(i-1) % k for i in a]))
a = [i % k for i in a]
ans = 0
start = defaultdict(int)
start[0] += 1
maps = [start]
for i in a[1:]:
now = maps[-1].copy()
now[i] += 1
maps.append(now)
for i in range(n):
v = a[i]
ans += maps[min(n,i+k-1)][v]-maps[i][v]
print(ans) | from itertools import accumulate
from collections import defaultdict
import bisect
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [0] + list(accumulate([(i-1) % k for i in a]))
a = [i % k for i in a]
ans = 0
maps = defaultdict(list)
for k1,v in enumerate(a):
maps[v].append(k1)
for i in range(n):
v = a[i]
ans += bisect.bisect_right(maps[v],i+k-1) - bisect.bisect_right(maps[v],i)
print(ans) | p02851 |
from collections import defaultdict
from itertools import accumulate
import bisect
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
s = list(accumulate([0]+a))
b = [s[i]-i for i in range(n+1)]
d = defaultdict(list)
for i in range(n+1):
d[b[i]%k].append(i)
ans = 0
for x in list(d.keys()):
l = d[x]
for j in range(len(l)):
y = l[j]
ans += max(0,bisect.bisect_right(l,k+y-1)-j-1)
print(ans)
| from collections import defaultdict
from itertools import accumulate
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
s = list(accumulate([0]+a))
b = [(s[i]-i)%k for i in range(n+1)]
d = defaultdict(int)
# 初期化
for i in range(min(k-1,n+1)):
d[b[i]]+=1
ans = 0
for i in range(n):
# 自分を除外し、k-1個先が存在すれば加える。
d[b[i]]-=1
if i+k-1<=n:
d[b[i+k-1]]+=1
ans += d[b[i]]
print(ans)
| p02851 |
import math
import itertools
def read():
N, K = list(map(int, input().strip().split()))
A = list(map(int, input().strip().split()))
return N, K, A
def solve(N, K, A):
S = [0 for _ in range(N+1)]
for i in range(N):
S[i+1] = (S[i] + A[i]) % K
count = 0
for j in range(N+1):
for i in range(j):
if (S[j] - S[i]) % K == (j - i):
count += 1
return count
if __name__ == '__main__':
inputs = read()
output = solve(*inputs)
print(("%d" % output))
| def read():
N, K = list(map(int, input().strip().split()))
A = list(map(int, input().strip().split()))
return N, K, A
def solve(N, K, A):
if K == 1:
return 0
S = [0 for _ in range(N+1)]
for i in range(N):
S[i+1] = S[i] + A[i]
count_sum = 0
count = dict()
for j in range(1, N+1):
j_mod_k = (S[j] - j) % K # 0 <= jmodk < K
if j == 1:
for i in range(max(0, j-K+1), j):
# (S[i] - i) % K の値 i_mod_k は、次のループでもほぼ重複する
# i = max(0, j-K+1) の時の i_mod_k は、i+1で破棄する
# i = j の時の i_mod_k は、i+1で生成する
i_mod_k = (S[i] - i) % K
if i_mod_k in count:
count[i_mod_k] += 1
else:
count[i_mod_k] = 1
else:
if max(0, j-K+1) != max(0, (j-1)-K+1):
i = max(0, (j-1)-K+1)
i_mod_k = (S[i] - i) % K
if i_mod_k in count:
if count[i_mod_k] == 1:
count.pop(i_mod_k)
else:
count[i_mod_k] -= 1
i = j-1
i_mod_k = (S[i] - i) % K
if i_mod_k in count:
count[i_mod_k] += 1
else:
count[i_mod_k] = 1
if j_mod_k in count:
count_sum += count[j_mod_k]
return count_sum
if __name__ == '__main__':
inputs = read()
print(('%d' % solve(*inputs)))
| p02851 |
def main():
N, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
l = [[0] * N for _ in range(N)]
a = 0
for j in range(N):
x = A[j] % K
if x == 1:
a += 1
l[j][0] = x
for i in range(1, N):
t = i + 1
y = (l[0][i - 1] + A[i]) % K
if y == t:
a += 1
l[0][i] = y
for j in range(1, N-i):
y = (l[j-1][i] + A[i+j] - A[j-1]) % K
if y == t:
a +=1
l[j][i] = y
return a
print((main()))
| def main():
N, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
l = [0] * N
a = 0
for j in range(N):
x = A[j] % K
if x == 1:
a += 1
l[j] = x
for i in range(1, N):
t = i + 1
y = (l[0] + A[i]) % K
if y == t:
a += 1
l[0] = y
for j in range(1, N-i):
y = (l[j-1] + A[i+j] - A[j-1]) % K
if y == t:
a +=1
l[j] = y
return a
print((main()))
| p02851 |
from itertools import accumulate
from collections import defaultdict
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = accumulate([0]+ A)
C = [(b-i)%K for i, b in enumerate(B)]
cnt = defaultdict(int)
cnt[C[0]] = 1
res = 0
for i in range(1, N+1):
if i >= K:
cnt[C[i-K]] -= 1
res += cnt[C[i]]
cnt[C[i]] += 1
print(res)
| from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = accumulate([0]+ A)
C = [(b-i)%K for i, b in enumerate(B)]
cnt = dict()
cnt[C[0]] = 1
res = 0
for i in range(1, N+1):
if i >= K:
cnt[C[i-K]] = cnt.get(C[i-K],0) - 1
res += cnt.get(C[i], 0)
cnt[C[i]] = cnt.get(C[i],0) + 1
print(res)
| p02851 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
class BinaryIndexedTree:
# http://hos.ac/slides/20140319_bit.pdf
def __init__(self, size):
"""
:param int size:
"""
self.bit = [0 for _ in range(size)]
self.size = size
def add(self, i, w):
"""
i番目にwを加える
:param int i:
:param int w:
:return:
"""
x = i + 1
while x <= self.size:
self.bit[x - 1] += w
x += x & -x
return
def sum(self, i):
"""
[0,i]の合計
:param int i:
:return:
"""
res = 0
x = i + 1
while x > 0:
res += self.bit[x - 1]
x -= x & -x
return res
def search(self, x):
"""
二分探索。和がx以上となる最小のインデックス(>= 1)を返す
:param int x:
:return :
"""
i = 1
s = 0
step = 1 << (self.size.bit_length() - 1)
while step:
if i + step <= self.size and s + self.bit[i + step - 1] < x:
i += step
s += self.bit[i - 1]
step >>= 1
return i
def __len__(self):
return self.size
#solve
def solve():
n, k = LI()
a = LI_()
ab = a[::1]
a[0] = a[0] % k
for i in range(n - 1):
a[i + 1] = (a[i] + a[i + 1]) % k
Bit = BinaryIndexedTree(k + 1)
ans = 0
d = deque([0])
Bit.add(0, 1)
for x, i in enumerate(a):
d.append(i)
if len(d) == k+1:
x = d.popleft()
Bit.add(x, -1)
ans += Bit.sum(i) - Bit.sum(i - 1)
Bit.add(i, 1)
print(ans)
return
#main
if __name__ == '__main__':
solve() | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
n, k = LI()
a = LI_()
ab = a[::1]
a[0] = a[0] % k
for i in range(n - 1):
a[i + 1] = (a[i] + a[i + 1]) % k
ans = 0
q = deque([0])
d = defaultdict(int)
d[0] += 1
for x, i in enumerate(a):
q.append(i)
if len(q) == k+1:
x = q.popleft()
d[x] -= 1
ans += d[i]
d[i] += 1
print(ans)
return
#main
if __name__ == '__main__':
solve() | p02851 |
n,k=list(map(int,input().split()))
a=list([(int(x)-1)%k for x in input().split()])
s=[0]
#print(a)
for i in a:
s.append((s[-1]+i)%k)
#print(s)
mp={}
ans=0
for i in range(len(s)):
if i-k>=0:
mp[s[i-k]]-=1
if s[i] in mp:
ans+=mp[s[i]]
if s[i] in mp:
mp[s[i]]+=1
else:
mp[s[i]]=1
#print(i,ans)
print(ans)
#ans+=sum(list(map(lambda x: x==0,s)))
#print(ans)
| n,k=list(map(int,input().split()))
a=list([(int(x)-1)%k for x in input().split()])
s=[0]
for i in a:
s.append((s[-1]+i)%k)
mp={}
ans=0
for i in range(len(s)):
if i-k>=0:
mp[s[i-k]]-=1
if s[i] in mp:
ans+=mp[s[i]]
mp[s[i]]+=1
else:
mp[s[i]]=1
print(ans)
| p02851 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
for i in range(n+1):
S[i]-=i
S[i]%=k
C=defaultdict(list)
for i in range(n+1):
C[S[i]].append(i)
ans=0
C=list(C.values())
for d in range(len(C)):
n=len(C[d])
if(n<=1): continue
r=0
for l in range(n):
while(r+1<n and C[d][r+1]-C[d][l]<k):
r+=1
ans+=r-l
if(r==l): r+=1
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=list(map(int,input().split()))
A=list([int(x)-1 for x in input().split()])
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
S[i+1]%=k
C=defaultdict(int)
ans=0
for i in range(n+1):
if(i-k>=0):
C[S[i-k]]-=1
ans+=C[S[i]]
C[S[i]]+=1
print(ans)
resolve() | p02851 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict,deque
def resolve():
n,k=list(map(int,input().split()))
A=list([int(x)-1 for x in input().split()])
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
S[i+1]%=k
C=defaultdict(int)
Q=deque()
ans=0
for s in S:
ans+=C[s]
C[s]+=1
Q.append(s)
if(len(Q)==k):
C[Q.popleft()]-=1
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
for i in range(n+1):
S[i]-=i
S[i]%=k
ans=0
D=defaultdict(int)
for i in range(n+1):
s=S[i]
ans+=D[s]
D[s]+=1
if(i>=k-1):
D[S[i-k+1]]-=1
print(ans)
resolve() | p02851 |
def main():
from itertools import accumulate
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A=list(accumulate(A))
A=[[(A[i]-i-1)%K,i+1] for i in range(0,N)]
A.append([0,0])
A.sort()
s=1
start=0
count=0
for i in range(0,N):
if A[i][0]==A[i+1][0]:
s+=1
else:
X=[A[i][1] for i in range(start,start+s)]
a=0
b=0
subcount=0
while len(X)-1>=a and len(X)-1>=b:
if K-1>=X[b]-X[a]:
b+=1
else:
subcount+=len(X)-b
a+=1
count+=len(X)*(len(X)-1)//2-subcount
start+=s
s=1
X=[A[i][1] for i in range(start,start+s)]
a=0
b=0
subcount=0
while len(X)-1>=a and len(X)-1>=b:
if K-1>=X[b]-X[a]:
b+=1
else:
subcount+=len(X)-b
a+=1
count+=len(X)*(len(X)-1)//2-subcount
print(count)
if __name__ == '__main__':
main()
| N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(1,N):
A[i]+=A[i-1]
A.append(0)
A.sort()
A=[((A[i]-i)%K,i) for i in range(0,N+1)]
A.sort()
count=0
s=0
t=1
while N>=t and N>=s:
if A[t][0]==A[s][0] and K>A[t][1]-A[s][1]:
t+=1
if t==N+1:
count+=((t-s)*(t-s-1))//2
else:
count+=t-s-1
s+=1
if s==t:
t+=1
print(count) | p02851 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n, k = LI()
A = [0] + LI()
for i in range(1, n + 1):
A[i] = (A[i] + A[i - 1] - 1) % k
ans = 0
D = defaultdict(int)
for j in range(n + 1):
if j >= k:
D[A[j - k]] -= 1
ans += D[A[j]]
D[A[j]] += 1
print(ans)
| from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, cos, radians, pi, sin
from operator import mul
from functools import reduce
from operator import mul
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n, k = LI()
A = [0] + LI()
for i in range(1, n + 1):
A[i] = (A[i] + A[i - 1] - 1) % k
D = defaultdict(int)
ans = 0
for i in range(n + 1):
if i >= k:
D[A[i - k]] -= 1
ans += D[A[i]]
D[A[i]] += 1
print(ans) | p02851 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, cos, radians, pi, sin
from operator import mul
from functools import reduce
from operator import mul
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n, k = LI()
A = [0] + LI()
for i in range(1, n + 1):
A[i] = (A[i] + A[i - 1] - 1) % k
D = defaultdict(int)
ans = 0
for i in range(n + 1):
if i >= k:
D[A[i - k]] -= 1
ans += D[A[i]]
D[A[i]] += 1
print(ans) | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, cos, radians, pi, sin
from operator import mul
from functools import reduce
from operator import mul
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n, k = LI()
A = LI()
L = [0]
for i in range(n):
L += [(L[-1] + A[i] - 1) % k]
D = defaultdict(int)
ans = 0
for i in range(n + 1):
if i >= k:
D[L[i - k]] -= 1
ans += D[L[i]]
D[L[i]] += 1
print(ans) | p02851 |
from collections import defaultdict, deque
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
acc = [0]
t = 0
for a_ in a:
t = (t + a_ - 1) % k
acc.append(t)
d = defaultdict(int)
ret = 0
count = 0
dq = deque()
for acc_ in acc:
ret += d[acc_]
d[acc_] += 1
dq.append(acc_)
if len(dq) >= k:
v = dq.popleft()
d[v] -= 1
print(ret)
| def main():
from collections import defaultdict, deque
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
def accumulate(a, mod):
s = 0
yield s
for x in a:
s = (s + x - 1) % mod
yield s
*acc, = accumulate(a, mod=K)
d = defaultdict(int)
dq = deque()
ans = 0
for x in acc:
ans += d[x]
d[x] += 1
dq.append(x)
if len(dq) >= K:
r = dq.popleft()
d[r] -= 1
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| p02851 |
def main():
from collections import defaultdict, deque
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
def accumulate(a, mod):
s = 0
yield s
for x in a:
s = (s + x - 1) % mod
yield s
*acc, = accumulate(a, mod=K)
d = defaultdict(int)
dq = deque()
ans = 0
for x in acc:
ans += d[x]
d[x] += 1
dq.append(x)
if len(dq) >= K:
r = dq.popleft()
d[r] -= 1
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
from collections import defaultdict, deque
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
def accumulate(a, mod):
s = 0
yield s
for x in a:
s = (s + x - 1) % mod
yield s
acc = accumulate(a, mod=K)
d = defaultdict(int)
dq = deque()
ans = 0
for x in acc:
ans += d[x]
d[x] += 1
dq.append(x)
if len(dq) >= K:
r = dq.popleft()
d[r] -= 1
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| p02851 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
A=[0]+A
R=[0]
for i in range(1,N+1):
R.append(R[-1]+A[i])
I=[i for i in range(N+1)]
ans=0
for i in range(N):
for j in range(i+1,N+1):
if (R[j]-R[i])%K==(j-i):
ans+=1
print(ans) | N,K=list(map(int,input().split()))
a=list(map(int,input().split()))
A=[0]
for i in range(N):
A.append((A[-1]+a[i]-1))
for i in range(len(A)):
A[i]%=K
#print(A)
D={}
D[0]=1
ans=0
for i in range(1,N+1):
if A[i] in D:
ans+=D[A[i]]
D[A[i]]+=1
else:
D[A[i]]=1
if i-K+1>=0:
D[A[i-K+1]]-=1
#print(D)
if K==1:
print((0))
else:
print(ans)
| p02851 |
from itertools import accumulate
from collections import Counter
n, k, *a = list(map(int, open(0).read().split()))
a = [x % k - 1 for x in a]
a = [0] + [x % k for x in accumulate(a)]
d = Counter()
ans = 0
for l, r in zip([k] * min(k, n + 1) + a, a):
d[l] -= 1
ans += d[r]
d[r] += 1
print(ans)
| n,k,*a=list(map(int, open(0).read().split()))
b=[0]*-~n
for i in range(n):b[i+1]=(a[i]+b[i]-1)%k
d={k:0}
a=0
for l,r in zip([k]*min(k,n+1)+b,b):d[l]-=1;t=d.get(r,0);a+=t;d[r]=t+1
print(a) | p02851 |
#尺取り法と累積和
from collections import deque
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#kを法とする配列を作る
a = [(i - 1) for i in a]
acc_a = [0 for i in range(n+1)]
acc_a[0] = 0
acc_a[1] = a[0] % k
#kを法とする累積和
for i in range(2,len(a) + 1):
acc_a[i] = (a[i - 1] + acc_a[i-1]) % k
ans = 0
count = {}
for i in range(k):
count[i] = 0
q = deque()
for i in acc_a:
ans += count[i]
count[i] += 1
q.append(i)
if len(q) == k:
count[q.popleft()] -= 1
print(ans) | from collections import deque
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
#kを法とする配列を作る
a = [(i - 1) for i in a]
acc_a = [0 for i in range(n+1)]
acc_a[0] = 0
acc_a[1] = a[0] % k
#kを法とする累積和
for i in range(2,len(a) + 1):
acc_a[i] = (a[i - 1] + acc_a[i-1]) % k
ans = 0
count = {}
q = deque()
for i in acc_a:
if i not in count:
count[i] = 0
ans += count[i]
count[i] += 1
q.append(i)
if len(q) == k:
count[q.popleft()] -= 1
print(ans) | p02851 |
import sys
import itertools
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, k = list(map(int, input().rstrip('\n').split()))
ls = [0] + list([int(x) - 1 for x in input().rstrip('\n').split()])
ls = [i % k for i in list(itertools.accumulate(ls))]
d = collections.defaultdict(int)
t = 0
for i, x in enumerate(ls):
t += d[x]
d[x] += 1
if i >= k - 1:
d[ls[i - k + 1]] -= 1
print(t)
if __name__ == '__main__':
solve()
| import sys
import itertools
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, k = list(map(int, readline().split()))
a = list([int(x) - 1 for x in readline().split()])
a = [0] + [i % k for i in list(itertools.accumulate(a))]
d = collections.defaultdict(int)
cnt = 0
for i in range(n + 1):
cnt += d[a[i]]
d[a[i]] += 1
if i >= k - 1:
d[a[i-k+1]] -= 1
print(cnt)
if __name__ == '__main__':
solve()
| p02851 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
r = 0
s = {0: [0]}
for i in range(n):
r = (r + a[i] - 1) % k
s[r] = s.get(r, []) + [i + 1]
ret = 0
for key in s:
a = s[key]
en = 0
for st in range(len(a)):
while en < len(a) and a[en] - a[st] < k:
en += 1
ret += en - st - 1
print(ret)
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
r = 0
s = {0: [0]}
for i in range(n):
r = (r + a[i] - 1) % k
if r in s:
s[r].append(i + 1)
else:
s[r] = [i + 1]
ret = 0
for key in s:
a = s[key]
en = 0
for st in range(len(a)):
while en < len(a) and a[en] - a[st] < k:
en += 1
ret += en - st - 1
print(ret) | p02851 |
def main():
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
v = [0] * N
r = 0
for i, a in enumerate(A, 1):
for j in range(i):
v[j] = t = (v[j] + a) % K
if t == i - j:
r += 1
return(r)
print((main()))
| def main():
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
v = {0: 1}
n = [0]
r = 0
t = 0
for i, a in enumerate(A, 1):
if i >= K:
v[n[i - K]] -= 1
t += a
j = (t - i) % K
r += v.get(j, 0)
v[j] = v.get(j, 0) + 1
n.append(j)
return r
print((main()))
| p02851 |
M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 0
accum = []
ids = []
for i, a in enumerate(A):
ids.append(i+1)
accum = list([x+a for x in accum])
accum.append(a)
ans += sum([1 if s%K == idx else 0 for s, idx in zip(accum, ids[::-1])])
print(ans) | M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 0
accum = [0]
d = {0 : 1}
for i, a in enumerate(A):
accum.append((accum[-1] + a - 1)%K)
if i >= K - 1:
d[accum[i-K+1]] -= 1
if accum[-1] in d:
ans += d[accum[-1]]
d[accum[-1]] += 1
else:
d[accum[-1]] = 1
print(ans) | p02851 |
import sys
from collections import Counter
from itertools import accumulate
read = sys.stdin.read
N, K, *A = list(map(int, read().split()))
a = list(accumulate([0] + A))
a = [(a[i] - i) % K for i in range(N + 1)]
def cmb(x):
return x * (x - 1) // 2
answer = 0
if N < K:
for i in list(Counter(a).values()):
answer += cmb(i)
else:
dic = Counter(a[:K])
for i in list(dic.values()):
answer += cmb(i)
here = K
for i, x in enumerate(a[K:]):
dic[a[i]] -= 1
answer += dic[x]
dic[x] += 1
print(answer) | import sys
from collections import defaultdict
from itertools import accumulate
read = sys.stdin.read
N, K, *A = list(map(int, read().split()))
a = list(accumulate([0] + A))
a = [(a[i] - i) % K for i in range(N + 1)]
answer = 0
dic = defaultdict(int)
for i, x in enumerate(a):
answer += dic[x]
dic[x] += 1
if i >= K - 1:
dic[a[i - K + 1]] -= 1
print(answer) | p02851 |
from itertools import *
from collections import defaultdict
def ints():
return [int(x) for x in input().split()]
def readi():
return int(eval(input()))
N, K = ints()
A = ints()
S = [0] + list(accumulate(A))
def f(i):
return (S[i]-i)%K
s = 0
for j in range(1, N+1):
fj = f(j)
for i in range(max(0, j-K+1), j):
if f(i)==fj:
s += 1
print(s)
| from itertools import *
from collections import defaultdict
def ints():
return [int(x) for x in input().split()]
def readi():
return int(eval(input()))
N, K = ints()
A = ints()
S = [0] + list(accumulate(A))
def f(i):
return (S[i]-i)%K
s = 0
memo = defaultdict(int)
for j in range(1, N+1):
fj = f(j)
if j-K>=0:
memo[f(j-K)] -= 1
memo[f(j-1)] += 1
s += memo[fj]
print(s)
| p02851 |
import math
import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
class Accumulation:
def __init__(self,X,accumfunc,init_val=0):
self.X = X
self.accumfunc = accumfunc
N = len(X)
v1 = [0] * (N+1)
v1[0] = init_val
for i in range(N):
v1[i+1] = accumfunc(v1[i],X[i])
self.v1 = v1
# 0-index
def query(self,l,r):
return self.v1[r+1] - self.v1[l]
def get_array(self):
return self.v1
class Counter:
def __init__(self):
self.dict = {}
def add(self,x):
if x in self.dict: self.dict[x] += 1
else: self.dict[x] = 1
def decrement(self,x):
self.dict[x] -= 1
def get_dict(self):
return self.dict
INF=10**20
def main():
N,K=mi()
A=list(mi())
def madd(x,y): return (x+y) % K
V = Accumulation(A,madd)
v = V.get_array()
u = [-1] * (N+1)
for i in range(N+1):
u[i] = v[i] - i
u[i] %= K
# print(u)
if K <= N:
s = u[:K]
counter = Counter()
for i in range(K):
_s = s[i]
counter.add(_s)
ans = 0
current_count = counter.get_dict()
ans += (current_count[u[0]] - 1)
for i in range(1,N+1):
# print(u[i:i+K])
old = u[i-1]
counter.decrement(old)
if i+K-1 < len(u):
new = u[i+K-1]
counter.add(new)
current_count = counter.get_dict()
ans += (current_count[u[i]] - 1)
# print(i,current_count[u[i]] - 1)
print(ans)
else:
counter = Counter()
for i in range(N+1):
counter.add(u[i])
u = counter.get_dict()
ans = 0
for i in range(K):
if not i in u: continue
c = u[i]
ans += c*(c-1)//2
print(ans)
if __name__ == "__main__":
main()
| import math
import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
class Accumulation:
def __init__(self,X,accumfunc,init_val=0):
self.X = X
self.accumfunc = accumfunc
N = len(X)
v1 = [0] * (N+1)
v1[0] = init_val
for i in range(N):
v1[i+1] = accumfunc(v1[i],X[i])
self.v1 = v1
# 0-index
def query(self,l,r):
return self.v1[r+1] - self.v1[l]
def get_array(self):
return self.v1
class Counter:
def __init__(self):
self.dict = {}
def add(self,x):
if x in self.dict: self.dict[x] += 1
else: self.dict[x] = 1
def decrement(self,x):
self.dict[x] -= 1
def get_dict(self):
return self.dict
INF=10**20
def main():
N,K=mi()
A=list(mi())
def madd(x,y): return (x+y) % K
V = Accumulation(A,madd)
v = V.get_array()
u = [-1] * (N+1)
for i in range(N+1):
u[i] = v[i] - i
u[i] %= K
# print(u)
if K <= N:
s = u[:K]
counter = Counter()
for i in range(K):
_s = s[i]
counter.add(_s)
ans = 0
current_count = counter.get_dict()
ans += (current_count[u[0]] - 1)
for i in range(1,N+1):
# print(u[i:i+K])
old = u[i-1]
counter.decrement(old)
if i+K-1 < len(u):
new = u[i+K-1]
counter.add(new)
current_count = counter.get_dict()
ans += (current_count[u[i]] - 1)
# print(i,current_count[u[i]] - 1)
print(ans)
else:
counter = Counter()
for i in range(N+1):
counter.add(u[i])
u = counter.get_dict()
ans = 0
for c in list(u.values()):
if c <= 0: continue
ans += c*(c-1)//2
print(ans)
if __name__ == "__main__":
main()
| p02851 |
[ a, b, c ] = list(map ( int, input ( ).split ( ) ));
if a < b < c:
print ( "Yes" )
else:
print ( "No" ) | x = input().split()
a, b, c = int(x[0]), int(x[1]), int(x[2])
if a < b < c:
print("Yes")
else:
print("No")
| p02392 |
(a, b, c) = input().rstrip().split(' ')
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
print('Yes')
else:
print('No') | a, b, c = list(map(int, input().split()))
if a<b<c:
print("Yes")
else:
print("No") | p02392 |
x = input().split(' ')
a = int(x[0])
b = int(x[1])
c = int(x[2])
if a < b < c:
print('Yes')
else:
print('No') | (a, b, c) = input().rstrip().split()
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
print('Yes')
else:
print('No') | p02392 |
(a, b, c) = input().rstrip().split()
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
print('Yes')
else:
print('No') | a, b, c = [int(i) for i in input().split()]
if a < b < c:
print("Yes")
else:
print("No") | p02392 |
a,b,c=list(map(int,input().split()));print('Yes' if a<b<c else 'No') | m,n,o=list(map(int,input().split()))
print('Yes'if m<n<o else'No') | p02392 |
a,b,c=list(map(int,input().split()))
if a < b and b < c:
print("Yes")
else:
print("No") | a,b,c=list(map(int,input().split()))
if a < b < c:
print("Yes")
else:
print("No") | p02392 |
a,b,c=(int(i) for i in input().split())
if a<b<c:
print("Yes")
else:
print("No") | a,b,c=list(map(int,input().split()))
if a<b<c:
print("Yes")
else:
print("No")
| p02392 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.