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:
... | #!/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":
... | 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... | 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... | 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(in... | 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(in... | 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 = la... | 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 = la... | 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 ... | #!/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 ... | 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)
... | 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)
... | 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
... | 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 200... | 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:
... | 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 // 4... | 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
sel... | 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]... | 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] = ... | 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 _ i... | 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
... | 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])
... | 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 ... | #!/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 ... | 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)
... | 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):
sel... | 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) ... | 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]:
... | 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_un... | 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:
... | 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 an... | 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:
segtre... | 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... | 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(... | 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]... | 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(... | 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(... | 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(... | 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]:
... | 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):... | 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... | 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... | 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... | 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() # デック．番長順番待ちキューをシミュレート... | 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):
hea... | 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
... | 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
... | 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())
... | 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))))
... | 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::... | 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]))
... | 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:]:
... | 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... | 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]:
co... | 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... | 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 rangem... | 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]... | 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[-... | 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
... | 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):
... | 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])
... | 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 = 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
prin... | 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... | 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]) + ab... | 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])
... | 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]-... | 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])
pr... | 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... | 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-... | 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(... | 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(... | 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(... | 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])+... | 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])
... | 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を省いたとき... | 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]... | 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... | 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 = ... | 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... | #!/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... | 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 ... | 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[... | 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.stdi... | 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.stdi... | 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:
... | 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 ... | 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:
... | 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:
... | 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 ... | 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(k... | 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
f... | 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... | 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... | 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 =... | 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 ... | 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... | 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]]... | 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[... | 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(... | #!/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(... | 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
... | 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]
... | 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]... | 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... | 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]
... | 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]==... | 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:
... | 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, ... | 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, ... | 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, ... | 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, ... | 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
... | 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=... | 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=... | 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)... | 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
... | 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 = ... | 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 = ... | 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))]
... | 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.de... | 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:
... | 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... | 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] =... | 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[a... | 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... | 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]
d... | 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(... | 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 ... | 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):
se... | 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):
se... | 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.