input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
"""
普通に端っこを基準にして、貪欲的に爆弾をおいていく方法を考えるのがよさそう。
座標圧縮したうえで、遅延セグ木で各座標に蓄積しているダメージを管理しておけばよい。
一番左端のやつの体力を削れるだけの爆弾を設置してみる:O(1)
次の左端になるモンスターの位置(体力が1以上あるモンスターのなかで一番左端のやつの座標)を探す。これはO(logN)かかる。
このサイクルをモンスターが全滅するまで行うので、O(N)サイクル回す。したがって全体でO(NlogN)
"""
from math import ceil
class lazySegTree:
def __init__(self,n):
... | """
lazyseg使う方法とかもあるが、imos法使うのが簡単そう。
座標圧縮は必須。
"""
from math import ceil
N,D,A = list(map(int,input().split()))
XH = [list(map(int,input().split())) for _ in range(N)]
XH.sort()
coordinates = set()
for x,h in XH:
coordinates.add(x)
coordinates.add(x+2*D+1)
compress = {x:i for i,x in enumerate(sor... | p02788 |
N,D,A=list(map(int,input().split()))
D*=2 # 爆発の長さ
X=[None]*N
for i in range(N):
X[i]=list(map(int,input().split()))
X=sorted(X,key=lambda x:x[0])
lastX=X[-1][0] # 最後のモンスターの場所
from collections import defaultdict
damage=defaultdict(int)
ans=0
for i in range(len(X)):
x=X[i][0]
if X[i][1]>0:
dele=s... | N,D,A=list(map(int,input().split()))
D*=2 # 爆発の長さ
X=[None]*N
for i in range(N):
X[i]=list(map(int,input().split()))
X=sorted(X,key=lambda x:x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage=0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs=deque() # 爆弾が切れるタイミング
# [位置、効力]
ans=0
for i in range(len(X)):
... | p02788 |
from collections import deque
def updiv(a,b):
if a % b == 0:
return a // b
else:
return a // b + 1
N,D,A = list(map(int,input().split()))
XH = []
for i in range(N):
x,h = list(map(int,input().split()))
XH.append([x,h])
XH.sort()
q = deque([])
qs = 0
ans = 0
... | import bisect
from collections import deque
import math
n, d, A = list(map(int, input().split()))
xh = []
for _ in range(n):
x, h = list(map(int, input().split()))
xh.append([x, h])
xh.sort(key=lambda x: x[0])
monster_x = []
monster_hp = []
for i in range(n):
monster_x.append(xh[i][0])
mo... | p02788 |
from collections import deque
N, D, A = list(map(int, input().split()))
ys = []
hs = []
for i in range(N):
X, H = list(map(int, input().split()))
ys.append((X,-(-H//A)))
ys = sorted(ys, key=lambda x : x[0])
l = ys[0][0] + 2*D
li = dmg = r = 0
hs2 = [0]*N
for i, (y, h) in enumerate(ys):
while... | N, D, A = list(map(int, input().split()))
ys = []
for i in range(N):
X, H = list(map(int, input().split()))
ys.append((X,-(-H//A)))
ys.sort(key=lambda x : x[0])
li = dmg = r = 0
hs = [0]*N
for i, (y, h) in enumerate(ys):
while ys[li][0]+2*D < y:
dmg -= hs[li]
li += 1
hs[i] = ... | p02788 |
import sys
from bisect import bisect_right
read = sys.stdin.read
N, D, A, *XH = list(map(int, read().split()))
X = XH[::2]
H = XH[1::2]
D *= 2
X, H = list(zip(*sorted(zip(X, H))))
damage = [0] * (N + 1)
answer = H[0] // A + min(1, H[0] % A)
damage[0] += A * answer
damage[bisect_right(X, X[0] + D)] -= A... | import sys
from bisect import bisect_right
read = sys.stdin.read
N, D, A, *XH = list(map(int, read().split()))
X = XH[::2] + [-1]
H = XH[1::2] + [-1]
D *= 2
X, H = list(zip(*sorted(zip(X, H))))
damages = [0] * (N + 2)
answer = 0
for i in range(1, N + 1):
damages[i] += damages[i - 1]
h = H[i]... | p02788 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from builtins import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
from collections import deque
def main():
n, d, a = map(int, input().split())
x... | #!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from builtins import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
from collections import deque
def main():
n, d, a = map(int, input().split())
x... | p02788 |
from math import ceil
from collections import deque
N, D, A = list(map(int, input().split()))
monsters = []
for i in range(N):
x, h = list(map(int, input().split()))
monsters.append((x, h))
monsters.sort()
damege_sum = 0
ans = 0
q = deque([])
for i in range(N):
x, h = monsters[i]
while ... | from math import ceil
from collections import deque
N, D, A = list(map(int, input().split()))
monsters = []
for i in range(N):
x, h = list(map(int, input().split()))
monsters.append((x, h))
monsters.sort()
damage_sum = 0
ans = 0
q = deque([])
for i in range(N):
x, h = monsters[i]
wh... | p02788 |
import sys
import socket
if socket.gethostname() in ['N551J', 'F551C']:
sys.stdin = open('f1.in')
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(eval(input()))
def read_str_list():
return input().split()
def read_str():
return eval... | import sys
import socket
from collections import deque
if socket.gethostname() in ['N551J', 'F551C']:
in_file = 'f1.in'
in_file = 'after_contest_01.in'
sys.stdin = open(in_file)
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(eval(input())... | p02788 |
import bisect
import math
n,d,a=list(map(int,input().split()))
xh=[list(map(int,input().split())) for i in range(n)]
xh.sort()
x=[xh[i][0] for i in range(n)]
h=[xh[i][1] for i in range(n)]
g=[0]*n
cnt=0
for i in range(n):
#print(h)
if h[i]>0:
m=math.ceil(h[i]/a)
cnt+=m
k=bi... | import bisect
import math
import sys
input=sys.stdin.readline
n,d,a=list(map(int,input().split()))
xh=[list(map(int,input().split())) for i in range(n)]
xh.sort()
x=[xh[i][0] for i in range(n)]
h=[xh[i][1] for i in range(n)]
g=[0]*n
cnt=0
for i in range(n):
if h[i]>0:
m=math.ceil(h[i]/a)
... | p02788 |
n, d, a = list(map(int, input().split()))
XH = []
for i in range(n):
x, h = list(map(int, input().split()))
XH.append((x, h))
XH.sort()
X = [x for x, h in XH]
H = [h for x, h in XH]
# n, d, a = 9, 2, 2
# X = [1, 3, 4, 6, 9, 10, 12, 13, 16]
# H = [7, 6, 7, 5, 10, 3, 8, 9, 6]
X.append(10**10)
H.append... | n, d, a = list(map(int, input().split()))
XH = [tuple(map(int, input().split())) for i in range(n)]
XH.sort()
X = [x for x, h in XH]
H = [h for x, h in XH]
X.append(10**10)
H.append(0)
j = 0
S = [0]*(n+1)
ans = 0
for i in range(n):
H[i] = max(0, H[i]-S[i])
c = -(-H[i]//a)
while X[j] <= X[i] + 2... | p02788 |
k,n=list(map(int,input().split()))
l1=list(map(int,input().split()))
l2 = [x+k for x in l1]
l=l1+l2
ans=[]
for i in range(n):
ans.append(max(l[i+1:i+n])-l[i] )
print((min(ans))) | k,n,*a=list(map(int,open(0).read().split()))
a+=[k+a[0]]
print((k-max(y-x for x,y in zip(a,a[1:])))) | p02725 |
inputted = list(map(int, input().split()))
K = inputted[0]
N = inputted[1]
A = list(map(int, input().split()))
distancies = []
for i, Ai in enumerate(A):
current = i
to = (i + 1) % len(A)
distance = A[to] - A[current] if i < len(A) - 1 else K - A[current] + A[0]
distancies.append(distance)
... | inputted = list(map(int, input().split()))
K = inputted[0]
N = inputted[1]
A = list(map(int, input().split()))
distancies = []
for i, Ai in enumerate(A):
current = i
to = (i + 1) % len(A)
distance = A[to] - A[current] if to != 0 else K - A[current] + A[0]
distancies.append(distance)
answer... | p02725 |
k,n = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(n-1):
for j in range(n-1-i):
if A[j] > A[j+1]:
A[j],A[j+1] = A[j+1],A[j]
max_d = 0
max_index = 0
for i in range(n-1):
if A[i+1] - A[i] > max_d:
max_d = A[i+1]-A[i]
max_inde... | k,n = list(map(int,input().split()))
A = list(map(int,input().split()))
max_d = 0
max_index = 0
for i in range(n-1):
if A[i+1] - A[i] > max_d:
max_d = A[i+1]-A[i]
max_index = i
if k-A[n-1]+A[0] > max_d:
max_d = k-A[n-1]+A[0]
max_index = n-1
min_distance = 0
if(max_index... | p02725 |
K, N = list(map(int, input().split()))
house = list(map(int,input().split()))
house = house + house
min = house[N - 1] - house[0]
for i in range(N - 1):
if K - (house[N + 1 + i] - house[i]) < min:
min = K - (house[N + 1 + i] - house[i])
print(min) | K, N = list(map(int, input().split()))
house = list(map(int,input().split()))
min = house[N - 1] - house[0]
for i in range(N - 1):
if K - (house[i + 1] - house[i]) < min:
min = K - (house[i + 1] - house[i])
print(min) | p02725 |
K, N = list(map(int, input().split()))
As = list(map(int, input().split()))
Ds = []
past = 0
for i, a in enumerate(As):
if not i==0:
Ds.append(a-past)
past = a
Ds.append(As[0]+K-As[-1])
print((K-max(Ds))) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
K, N = mapint()
As = list(mapint())
lis = []
for i in range(1, N):
lis.append(As[i]-As[i-1])
lis.append(As[0]+(K-As[-1]))
print((K-max(lis))) | p02725 |
from os import readlink
K, N = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = K - (X[0] + K - X[-1])
for i in range(1, N):
ans = min(ans, K - (X[i] - X[i - 1]))
print(ans)
|
K, N = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = K + X[0] - X[-1]
for i in range(1, N):
ans = max(ans, X[i] - X[i - 1])
print((K - ans))
| p02725 |
import sys
input = sys.stdin.readline
def main():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = []
for i in range(N-1):
diff.append(A[i+1] - A[i])
diff.append(A[0]+K-A[N-1])
print((sum(diff)-max(diff)))
if __name__ == '__main__':
... | import sys
input = sys.stdin.readline
def main():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = [A[i+1] - A[i] for i in range(N-1)]
diff.append(A[0]+K-A[N-1])
print((sum(diff)-max(diff)))
if __name__ == '__main__':
main()
| p02725 |
import sys
input = sys.stdin.readline
def main():
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
longest = a[0] + k - a[-1]
for i in range(n - 1):
longest = max(longest, a[i+1] - a[i])
print((k - longest))
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
def main():
k, n = list(map(int, input().split()))
a = tuple(map(int, input().split()))
dis_max = (k - a[-1]) + a[0]
for i1 in range(1, n):
dis = a[i1] - a[i1-1]
dis_max = max(dis_max, dis)
print((k - dis_max))
if __name__ == '__main__':
... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int,input().split()))
for i in range(N):
A.append(A[i]+K)
d = 0; ans = float("INF")
for i in range(N):
d = 0
for j in range(N-1):
d += A[i+j+1] - A[i+j]
ans = min(ans, d)
print(ans) | K, N = list(map(int, input().split()))
A = list(map(int,input().split()))
for i in range(N):
A.append(A[i]+K)
d = [0]*(N)
max_d, max_i = 0, -1
for i in range(N):
d[i] = A[i+1] - A[i]
if d[i] > max_d:
max_d = d[i]
max_i = i + 1
ans = 0
for i in range(N-1):
ans += A[i+max_i+1] - A[i+max_i]
p... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int,input().split()))
for i in range(N):
A.append(A[i]+K)
d = [0]*(N)
max_d, max_i = 0, -1
for i in range(N):
d[i] = A[i+1] - A[i]
if d[i] > max_d:
max_d = d[i]
max_i = i + 1
ans = 0
for i in range(N-1):
ans += A[i+max_i+1] - A[i+max_i]
p... | K, N = list(map(int, input().split()))
A = list(map(int,input().split()))
A.append(A[0] + K)
d = 0
for i in range(N):
d = max(d, A[i+1] - A[i])
print((K - d)) | p02725 |
k , n = (int(x) for x in input().split())
a = [int(i) for i in input().split()]
b = []
for i in range(n-1):
b.append(a[i+1] - a[i])
b.append(a[0] + k -a[n-1])
lans=0
ans = 999999999999
for i in range(len(b)):
lans = 0
for j in range(len(b)):
if i != j:
lans ... | k , n = (int(x) for x in input().split())
a = [int(i) for i in input().split()]
b = []
for i in range(n-1):
b.append(a[i+1] - a[i])
b.append(a[0] + k -a[n-1])
ans=0
b.sort()
for i in range(len(b)-1):
ans = b[i] + ans
print(ans) | p02725 |
(k,n),(*a,) = [list(map(int,i.split())) for i in open(0)]
a.append(a[0]+k)
print((k - max(a[i+1]-a[i] for i in range(n)))) | k,n,*a = list(map(int, open(0).read().split()))
a.append(a[0]+k)
print((k - max(a[i+1]-a[i] for i in range(n)))) | p02725 |
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | #!/usr/bin/env python3
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = 0
a.append(k+a[0])
a.reverse()
for i in range(n):
a[i]-=a[i+1]
ans = k-max(a)
print(ans) | p02725 |
# 初期入力
K,N = (int(x) for x in input().split(" "))
A = [0]
for i in input().split():
if i !="0":
A.append( int(i) )
# 1軒ずつ距離のリスト
x =[A[i+1] - A[i] for i,v in enumerate(A[:-1]) ]
if N == len(A):
x.append(K -A[-1])
else:
x.append(K - A[-1] +A[1])
# 求めるのは K － max(隣と離れた家の距離)
kyori_min = ... | # 初期入力
K,N = (int(x) for x in input().split(" "))
A = list(map(int, input().split()))
A.append(0) # 基準地点を最後に追加、スタートが０でもうまくいく
# 1件となりまでの距離
kyori = [ A[i+1] -A[i] for i,v in enumerate(A[:-1]) ]
kyori[-1] = kyori[-1] + K # n番目から基準までは全体から「引く」
kyori.append(A[0] -A[-1] ) # 基準から1番目までの距離
x_saisyo_saigo = kyori[-2] +k... | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
x = a[0] + k-a[-1]
ans = 0
for i in range(n-1):
ans = max(ans,a[i+1]-a[i])
ans = max(ans,x)
print((k-ans)) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
b = 0
for i in range(n-1):
b = max(b,a[i+1]-a[i])
b = max(b,a[0]+k-a[-1])
print((k-b)) | p02725 |
k,n,*l=list(map(int,open(0).read().split()));print((min((l[i-1]-l[i])%k for i in range(n)))) | k,n,*l=list(map(int,open(0).read().split()))
print((k-max((l[i]-l[i-1])%k for i in range(n)))) | p02725 |
f=lambda:[*list(map(int,input().split()))]
k,n=f()
l=f()
l+=[l[0]+k]
a=0
for i in range(n):
a=max(a,l[i+1]-l[i])
print((k-a)) | k,n,*l=list(map(int,open(0).read().split()))
l+=[l[0]+k]
print((k-max(l[i+1]-l[i] for i in range(n)))) | p02725 |
import itertools
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = float('inf')
roots = list(itertools.permutations(a))
for i in range(n):
sum_d = 0
root = list(roots[i])
for j in range(1, n):
sum_d += min(abs(root[j] - root[j - 1]), abs(k - root[j] + ro... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d_list = [] * n
for i in range(1, n):
d_list.append(a[i] - a[i - 1])
d_list.append(k - a[n - 1] + a[0])
ans = sum(d_list) - max(d_list)
print(ans)
| p02725 |
import sys
k, n = list(map(int, sys.stdin.readline().split()))
an = list(map(int, sys.stdin.readline().split()))
dai = an[0]+k-an[-1]
for i in range(1, n):
dai = max(dai, an[i]-an[i-1])
print((k-dai)) | import sys
k, n = list(map(int, sys.stdin.readline().split()))
an = list(map(int, sys.stdin.readline().split()))
dai = an[0]+k-an[-1]
for i in range(1, n):
if an[i]-an[i-1]>dai:
dai = an[i]-an[i-1]
print((k-dai)) | p02725 |
k,n = list(map(int, input().split()))
a = list(map(int,input().split()))
k2 = k // 2
bet = [210000] * (n - 1) + [0] * 1
for i in range(n):
for j in range(n):
if i != j:
if (0 <= a[i] < 10) and (10 < a[j] < 20):
bet[i] = min(bet[i], abs(a[i]) - (a[j] - k))
e... | k,n = list(map(int, input().split()))
a = list(map(int,input().split()))
max_dist = 0
for i in range(n):
nxt = (i + 1) %n
distance = a[nxt] - a[i]
if distance < 0:
distance += k
max_dist = max(max_dist, distance)
print((k - max_dist)) | p02725 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string ... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string ... | p02725 |
# coding: utf-8
from itertools import permutations
def solve(*args: str) -> str:
k, n = list(map(int, args[0].split()))
A = list(map(int, args[1].split()))
ret = k+1
for P in permutations(A):
total = 0
cur = P[0]
for a in P[1:]:
total += min(abs(k-a)+c... | # coding: utf-8
def solve(*args: str) -> str:
k, n = list(map(int, args[0].split()))
A = list(map(int, args[1].split()))
D = [k-A[-1]+A[0]] + [A[i+1]-A[i] for i in range(n-1)]
return str(k-max(D))
if __name__ == "__main__":
print((solve(*(open(0).read().splitlines()))))
| p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
m = 0
s = 0
for i in range(n):
m = max(m, a[i+1] - a[i])
s += a[i+1] - a[i]
print((s - m)) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
m = 0
for i in range(n):
m = max(m, a[i+1] - a[i])
print((k - m)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
m = 0
for i in range(n):
m = max(m, a[i+1] - a[i])
print((k - m)) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
m = []
for i in range(n):
m.append(a[i+1] - a[i])
print((k - max(m))) | p02725 |
#coding:utf-8
import itertools
k, n = list(map(int, input().split()))
a = tuple(map(int, input().split()))
ans = 100000000000000000000
dist = []
pattern = sorted(list(itertools.permutations(a)))
#print(pattern)
#print(len(pattern))
for i in range(len(pattern)):
tmp = 0
for j in range(0,n-1):
... | #coding:utf-8
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
dist = []
#逆周りの方が距離が短く済むので、距離を2倍にして考える
#池の一周の長さ+a[0]を座標として追加
a.append(a[0] + k)
#距離が最大になる経路は通らないので除外する
for i in range(n):
dist.append(a[i+1] - a[i])
#print(a, dist)
#池の一周の長さから、距離が最大になるところを除外したものが最短
print((k ... | p02725 |
from collections import deque
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = deque()
for i in range(n):
for j in range(1,n):
if a[j]-a[i] >= abs(a[j]-a[i]-k):
ans.append(abs(a[j]-a[i]-k))
else:
ans.append(a[j]-a[i])
print((max(ans))) | k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = a[0]+(k-a[-1])
for i in range(n-1):
ans = max(ans,a[i+1]-a[i])
print((k-ans)) | p02725 |
k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
x = [0]*n
for i in range(n):
t = a[i] - a[i-1]
if i == 0:
t += k
x[i] = t
x[i] = t
print((sum(i for i in sorted(x)[:-1]))) | k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
l = [0]*n
l[-1] = k+a[0]-a[-1]
for i in range(n-1):
l[i] = a[i+1] - a[i]
print((sum(sorted(l)[:-1]))) | p02725 |
k, n = list(map(int,input().split()))
a = list(map(int,input().split()))
cost = 10**9
y = min(a)
for i in range(n):
cost_r = 0
cost_l = 0
r = a[i:] + a[:i]
l = list(reversed(a[:i+1])) + list(reversed(a[i+1:]))
for j in range(n-1):
if r[j+1] < r[j]:
cost_r += k - r[j]... | k, n = list(map(int,input().split()))
a = list(map(int,input().split()))
cost = max(a[0]+k-a[-1],a[-1]-a[-2])
for i in range(1,n-1):
cost = max(a[i]-a[i-1],a[i+1]-a[i],cost)
print((k-cost)) | p02725 |
#n=int(input())
k,n=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
mn=min(al)
mx=max(al)
dis=[]
for i in range(n-1):
dis.append(al[i+1]-al[i])
dis.append(mn+(k-mx))
dis.sort(reverse=False)
ans=0
for i in range(n-1):
ans+=di... | #n=int(input())
k,n=list(map(int,input().split()))
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
difl=[]
for i in range(n-1):
difl.append(al[i+1]-al[i])
difl.append(al[0]+k-al[n-1])
print((k-max(difl))) | p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
d=[]
for i in range(len(a)-1):
d.append(abs(a[i]-a[i+1]))
d.append(k-a[-1]+a[0])
d+=d[:n-2]
ans=[]
for i in range(n):
total=sum(d[i:i+n-1])
ans.append(total)
print((min(ans))) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
d=[]
for i in range(n-1):
d.append(a[i+1]-a[i])
d.append(k-a[-1]+a[0])
d=sorted(d,reverse=True)
print((sum(d[1:]))) | p02725 |
K, N = list(map(int,input().split()))
A = list(map(int,input().split()))
max = K - A[N-1] + A[0]
A.sort()
for i in range(N-1):
if(max < A[i+1] - A[i]):
max = A[i+1] - A[i]
print((K - max)) | K, N = list(map(int,input().split()))
A = list(map(int,input().split()))
max = K - A[N-1] + A[0]
for i in range(N-1):
if(max < A[i+1] - A[i]):
max = A[i+1] - A[i]
print((K - max)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
m = k
for i in range(n):
b = a[i::] + a[0:i]
r = 0
for j in range(n-1):
#print(r, b[j+1], b[j])
if b[j] > b[j+1]:
r = r + b[j+1] + (k - b[j])
else:
r = r + b[j+1] - b[j]
... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
maxdist = 0
for i in range(n-1):
maxdist = max(maxdist, a[i+1] - a[i])
maxdist = max(maxdist, (k - a[-1]) + a[0])
print((k - maxdist)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(1, n+1):
if i == 1:
distance = k - (a[0] + (k - a[-1]))
mindistance = distance
a.append(a[0])
a.pop(0)
else:
distance = k - (a[0] - a[-1])
if distance < mindistan... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
distance = []
for i in range(len(a) - 1):
distance.append(a[i+1] - a[i])
mindistance = 0
for j in distance:
mindistance += j
print((mindistance - max(distance))) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
li = []
for i in range(n - 1):
li.append(a[i + 1] - a[i])
if a[0] == 0:
li.append(k - a[n - 1])
li.sort()
li.pop(-1)
else:
li.append(k - a[n - 1] + a[0])
li.sort()
li.pop(-1)
print((sum(li))) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
li = []
for i in range(n - 1):
li.append(a[i + 1] - a[i])
li.append(k + a[0] - a[n - 1])
print((k - max(li))) | p02725 |
import itertools
k, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.append(k)
a.reverse()
l = []
for i in range(n):
l.append(a[i]-a[i+1])
k = []
for i in itertools.permutations(l, r=n-1):
k.append(sum(i))
print((min(k))) | K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
D=[A[0]-A[-1]+K]
for i in range(N-1):
D.append(A[i+1]-A[i])
print((K-max(D)))
| p02725 |
p,q= input().split()
a,b =(int(p), int(q))
f = list(map(int,input().split()))
f_list = list(f)
out_dis =f_list[0] + a -f_list[b-1]
dis_list=[out_dis]
for i in range(b-1):
dis = f_list[i+1]-f_list[i]
dis_list.append(dis)
print((int((sum(dis_list)-max(dis_list))))) | k , n= list(map(int, input().split()))
a_list = list(map(int, input().split()))
diff_list = []
for i in range(n-1):
diff_list.append(a_list[i+1]- a_list[i])
diff_list.append(k-a_list[n-1] + a_list[0])
print((sum(diff_list)-max(diff_list))) | p02725 |
K,N=[int(x) for x in input().rstrip().split()]
A=[int(x) for x in input().rstrip().split()]
flag=1
now=0
mae=[]
back=[]
for i in range(N-1):
mae.append(A[i+1]-A[i])
mae.append(A[len(A)-1]-A[0])
for i in range(N-1,0,-1):
back.append(A[i]-A[i-1])
back.append(abs(A[0])+abs(K-A[N-1]))
back.sort()
mae... | K,N=[int(x) for x in input().rstrip().split()]
A=[int(x) for x in input().rstrip().split()]
A14=K-A[N-1]+A[0]
sa=[A14]
for i in range(N-1):
sa.append(A[i+1]-A[i])
sa.sort()
ans=0
for i in range(N-1):
ans+=sa[i]
print(ans) | p02725 |
k,n = list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(a[0]+k)
longd=0
for i in range(n):
tmp=abs(a[i+1]-a[i])
longd=max(longd,tmp)
print((k-longd)) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(a[0]+k)
x=0
for i in range(len(a)-1):
dis=abs(a[i+1]-a[i])
x=max(x,dis)
print((k-x)) | p02725 |
K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
A.append(K+A[0])
maxdist,maxindx = 0,0
for i,a in enumerate(A):
dist = -a
if i+1 == len(A):
dist += K
else:
dist += A[i+1]
if dist > maxdist:
maxdist = dist
maxindx = i
ans = 0
num=0
fo... | K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
A.append(K+A[0])
ans=0
maxdist=0
for i,a in enumerate(A):
if i == len(A)-1:
break
dist = A[i+1]-a
ans += dist
maxdist=max(maxdist,dist)
print((ans-maxdist)) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
distance = []
for i in range(N-1):
distance.append(A[i+1] - A[i])
distance.append(K - A[-1] + A[0])
for i in range(N):
if distance[i] == max(distance):
start = i
ans = K - max(distance)
print(ans) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
distance = []
for i in range(N-1):
distance.append(A[i+1] - A[i])
distance.append(K - A[-1] + A[0])
ans = K - max(distance)
print(ans) | p02725 |
k,n = list(map(int,input().split()))
L = list(map(int,input().split()))
li = []
for i in range(n-1):
li.append(L[i+1]-L[i])
li.append(k-L[n-1]+L[0])
#print(L,li)
min1 =10**10
#min1 = k-L[n-1]+L[0]
for i in range(n):
min1 = min(min1,(k-li[i]))
#print(min1)
print(min1) | k,n = list(map(int,input().split()))
L = list(map(int,input().split()))
li = []
for i in range(n-1):
li.append(L[i+1]-L[i])
li.append(k-L[n-1]+L[0])
li.sort()
print((k-li[n-1])) | p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
for j in range(n-1):
a.append(a[j]+k)
sum=[0]*n
for I in range(n):
for i in range(n-1):
sum[I]=sum[I]+a[I+i+1]-a[I+i]
print((min(sum))) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(a[0]+k)
dist=[0]*n
for i in range(1,len(a)):
dist[i-1]=a[i]-a[i-1]
print((sum(dist)-max(dist))) | p02725 |
import sys
# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
import math
# import numpy as np
readline = sys.stdin.readline
MOD =... | import sys
# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
# import numpy as np
readline = sys.stdin.readline
M... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A += [i+K for i in A]
diff = [A[i+1] - A[i] for i in range(N*2-1)]
length = sum(A)
for i in range(len(diff) - N + 1):
length = min(length, sum(diff[i:i+N-1]))
print(length) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = [A[i+1] - A[i] for i in range(N-1)]
if 0 in A:
diff.append(K- A[-1])
else:
diff.append(A[0] + K - A[-1])
print((sum(diff) - max(diff))) | p02725 |
k, n = list(map(int, input().split()))
house = list(map(int, input().split()))
load = [0]*k
for i in house:
load[i] = 1
def check(lst):
return k - lst.index(1) -1
best_way = k
for i in house:
right = load[i+1:]
left = load[:i]
a_way = right + left
way = min(check(a_way), ch... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
max_dist = 0
for i in range(n):
nxt = (i+1) % n
distance = a[nxt] - a[i]
if distance < 0:
distance += k
max_dist = max(max_dist, distance)
print((k-max_dist)) | p02725 |
K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
A.append(K)
B = []
for i in range(N):
B.append(abs(A[i]-A[i+1]))
#print(B)
ans = K
for i in range(N):
ans = min(ans,sum(B)-B[i])
print(ans)
|
K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
B = []
for i in range(N-1):
B.append(abs(A[i+1]-A[i]))
B.append(K+A[0]-A[-1])
#print(B)
print((K-max(B)))
| p02725 |
K,N=list(map(int,input().split()))
A=list(int(i) for i in input().split())
A.append(A[0])
#print(A)
a=[]
for i in range(N-1):
a.append(abs(A[i]-A[i+1]))
#print(a)
a.append(abs(K-A[N-1]))
#print(a)
ans=1000
tmp=0
for i in range(N):
tmp=sum(a)-a[i]
if tmp<ans:
ans=tmp
#print(tmp)
pr... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
A.append(A[0]+K)
dif = 0
for i in range(1, N+1):
dif = max(dif, A[i] - A[i-1])
#print(dif)
print((K-dif))
| p02725 |
import sys
K,N = list(map(int, sys.stdin.readline().strip().split()))
A = list(map(int, sys.stdin.readline().strip().split()))
# K = 20
# N = 3
# A =[0, 5, 15]
# A =[5, 10, 15]
distance = []
# 家間距離
for i,a in enumerate(A):
if i == len(A) - 1:
distance.append(K - A[i] + A[0])
else:
... | K,N,*A = list(map(int, open(0).read().split()))
ans = []
for i in range(N-1):
ans.append(abs(A[i+1] - A[i]))
ans.append(A[0] + K - A[-1])
ans.sort()
ans.pop()
print((sum(ans))) | p02725 |
max,n = list(map(int,input().split()))
l = list(map(int,input().split()))
double = [ i + max for i in l]
ll = l + double
sum = 0
home = 0
ans = 9999999
for i in range(n):
for j in range(n-1):
sum += ll[i+j+1] - ll[i+j]
#print('ll[i+j+1]%d - ll[i+j]%d= sum%d i=%d j=%d'%(ll[i+j+1],... | k,n = list(map(int,input().split()))
l = list(map(int,input().split()))
ll = l[:]
ll.append(k)
ll.pop(0)
s = []
x = (l[0] + k) - l[-1]
for i,j in zip(l,ll):
s.append(j - i)
print((k - max(s+[x]))) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = A[0] + K - A[-1]
ans = A[-1] - A[0]
for i in range(1, N):
dist = K - A[i] + A[i - 1]
if dist < ans:
ans = dist
print(ans)
| import sys
def input():
return sys.stdin.readline().strip()
def main():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = [K - A[i] + A[i - 1] for i in range(1, N)]
print((min(min(ans), A[-1] - A[0])))
main()
| p02725 |
k, n = list(map(int, input().split()))
a = [int(i) for i in input().split()]
diff_a = [0] * n
diff_a[0] = (a[0] + k) - a[n - 1]
for i in range(1, n):
diff_a[i] = a[i] - a[i - 1]
print((k - max(diff_a))) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a += [k + a[0]]
print((k - max([a[i + 1] - a[i] for i in range(n)]))) | p02725 |
K, N = list(map(int, input().split()))
A = [int(x) for x in input().split()]
minV = (K - A[N-1]) + A[0]
minI = 0
for i in range(1,N+1):
if i == N:
tmp = K - A[i-1]
else:
tmp = A[i] - A[i-1]
# print(i, tmp)
if minV < tmp:
minV = tmp
minI = i
... | K, N = list(map(int, input().split()))
A = [int(x) for x in input().split()]
maxV = 0
ans = 0
for i in range(N-1):
tmp = A[i+1] - A[i]
ans += tmp
maxV = max(tmp, maxV)
ans += K - A[N-1]+A[0]
# print(ans)
maxV = max(maxV, K - A[N-1]+A[0])
print((ans - maxV))
| p02725 |
t,n=list(map(int,input().split()))
x=list(map(int,input().split()))
xx=[i+t for i in x]
x=x+xx
dis=[]
for i in range(2*n-1):
dis.append(x[i+1]-x[i])
ans=[]
for j in range(2*n-2):
ans2=dis[j:j+n-1]
ans.append(sum(ans2))
print((min(ans))) | t,n=list(map(int,input().split()))
x=list(map(int,input().split()))
x.insert(0,x[-1]-t)
dis=[x[i+1]-x[i] for i in range(n)]
print((sum(dis)-max(dis)))
| p02725 |
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
l = k - a[n-1] + a[0]
t = 0
for i in range(n):
p = 0
j = i + 1
while True:
if j == n:
j = 0
if j == i:
break
if j == 0:
p += l
else:
... | k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
t = 10 ** 6
for i in range(n - 1):
a.append(a[i] + k)
for i in range(len(a)-n+1):
t = min(t,a[i+n-1] - a[i])
print(t) | p02725 |
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = 10 ** 8
for i in range(n-1):
a.append(a[i]+k)
for i in range(n):
ans = min(ans,a[i+n-1] - a[i])
print(ans) | k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n-1):
a.append(k+a[i])
ans = a[n-1]-a[0]
for i in range(n,n*2-1):
ans = min(ans,a[i]-a[i-n+1])
print(ans) | p02725 |
# Problem C - Traveling Salesman around Lake
K, N = list(map(int, input().split()))
a_list = list(map(int, input().split()))
# initialization
min_cost = 10**8
a_len = len(a_list)
for i in range(len(a_list)):
a = a_list[i]
ushiro_i = 0
mae_i = 0
# 1つ後ろを取る
if i-1<0:
ushiro_i ... | # Problem C - Traveling Salesman around Lake
# input
K, N = list(map(int, input().split()))
A_list = list(map(int, input().split()))
list_len = len(A_list)
# initialization
min_ans = 10**18
# search
for i in range(list_len):
mae_i = 0
if i==list_len-1:
mae_i = 0
else:
mae_... | p02725 |
List = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(0,List[1]):
A.append(A[i]+List[0])
D = []
for i in range(0,List[1]):
D.append(A[i+List[1]-1]-A[i])
print((min(D))) | List = list(map(int, input().split()))
A = list(map(int, input().split()))
D = []
for i in range(1,List[1]):
D.append(A[i]-A[i-1])
D.append(A[0]+List[0]-A[List[1]-1])
print((List[0]-max(D))) | p02725 |
from sys import stdin
inp = stdin.readline
n, k = [int(x) for x in inp().strip().split()]
array = [int(x) for x in inp().strip().split()]
distance = [0]*(k + 2)
for i in range(k - 1):
distance[1+i] = array[i+1] - array[i]
if array[0] == 0:
distance[k] = 20-array[k-1]
else:
distance[k] ... | from sys import stdin
inp = stdin.readline
n, k = [int(x) for x in inp().strip().split()]
array = [int(x) for x in inp().strip().split()]
distance = [0]*(k * 2)
for i in range(k - 1):
distance[i] = array[i+1] - array[i]
distance[k-1] = n-array[k-1] + array[0]
distance[2*k-1] = n-array[k-1] + a... | p02725 |
from sys import stdin
inp = stdin.readline
n, k = [int(x) for x in inp().strip().split()]
array = [int(x) for x in inp().strip().split()]
distance = [0]*(k * 2)
for i in range(k - 1):
distance[i] = array[i+1] - array[i]
distance[k-1] = n-array[k-1] + array[0]
distance[2*k-1] = n-array[k-1] + a... | from sys import stdin
inp = stdin.readline
n, k = [int(x) for x in inp().strip().split()]
array = [int(x) for x in inp().strip().split()]
distance = [0]*(k * 2)
for i in range(k - 1):
distance[i] = array[i+1] - array[i]
distance[k-1] = n-array[k-1] + array[0]
print((n-max(distance))) | p02725 |
k, n = list(map(int, input().split()))
l = list(map(int, input().split()))
c = n*(n-1)//(n-1)
s = [0 for _ in range(c)]
for i in range(c):
for j in range(n-1):
if l[j+1] == 0:
s[i] += abs(k-l[j])
else:
s[i] += abs(l[j+1]-l[j])
temp = l.pop(0)
l.append(temp)
print((min(s))) | k,n = list(map(int, input().split()))
l = list(map(int, input().split()))
d = []
for i in range(n):
if i + 1 < n:
d.append(l[i+1]-l[i])
else:
if 0 in l:
d.append(k - l[i])
else:
d.append(k - l[i] + l[0])
sum = sum(d)
a = []
for i in range(n):
a.append(sum - d[i])
print((min(... | p02725 |
k,n = list(map(int, input().split()))
l = list(map(int, input().split()))
d = []
for i in range(n):
if i + 1 < n:
d.append(l[i+1]-l[i])
else:
if 0 in l:
d.append(k - l[i])
else:
d.append(k - l[i] + l[0])
sum = sum(d)
a = []
for i in range(n):
a.append(sum - d[i])
print((min(... | k, n = list(map(int, input().split()))
l = list(map(int, input().split()))
d = []
for i in range(n):
if i+1<n:
d.append(abs(l[i+1]-l[i]))
else:
if 0 in l:
d.append(abs(k - l[i]))
else:
d.append(abs(k - l[i] + l[0]))
print((sum(d)-max(d))) | p02725 |
K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
L = []
T = K+A[0]-A[-1]
for i in range(N-1):
L.append(A[i+1]-A[i])
L.append(T)
print((K-max(L))) | K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
L = [K+A[0]-A[-1]]
for i in range(N-1):
L.append(A[i+1]-A[i])
print((K-max(L))) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [None] * n
sum = 0
for i in range(n):
if i == n-1:
d[n-1] = k - a[n-1] + a[0]
else:
d[i] = a[i+1] - a[i]
sum += d[i]
ans = 2 * 10**11
for i in range(n):
if sum - d[i] < ans:
ans = sum - ... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [None] * n
sum = 0
for i in range(n):
if i == n-1:
d[n-1] = k - a[n-1] + a[0]
else:
d[i] = a[i+1] - a[i]
sum += d[i]
print((sum - max(d))) | p02725 |
#C - Traveling Salesman around Lake WA(ヒント)
K,N = list(map(int,input().split()))
A = list(map(int, input().split()))
A[N+1:] = A#Aを二回繰り返して円を表現
A_reverse = reversed(A)
distance_list = []
for i in range(N):#スタート地点の数
distance = 0
for j in range(N-1):#道の数
distance += abs(A[i+1] - A[i])#道の距離
... | #C - Traveling Salesman around Lake WA(ヒント)
K,N = list(map(int,input().split()))
A = list(map(int, input().split()))
A[N+1:] = [A[0] + K]#Aを二回繰り返して円を表現
distance_list = []
for i in range(N):
distance = abs(A[i] - A[i+1])
distance_list.append(distance)
distance_list.remove(max(distance_list))
print((... | p02725 |
K, N = list(map(int, input().split(' ')))
A_ls = list(map(int, input().split(' ')))
l, max_l = 0, 0
for i in range(N):
l = A_ls[(i + 1) % len(A_ls)] - A_ls[i]
if l < 0:
l = K - A_ls[i] + A_ls[(i + 1) % len(A_ls)]
max_l = max(max_l, l)
print((K - max_l)) | K, N = list(map(int, input().split(' ')))
A_ls = list(map(int, input().split(' ')))
rst = 0
for i in range(N):
l = A_ls[(i + 1) % len(A_ls)] - A_ls[i]
if l < 0:
l = A_ls[(i + 1) % len(A_ls)] + K - A_ls[i]
rst = max(rst, l)
print((K - rst)) | p02725 |
K, N = list(map(int, input().split(' ')))
A_ls = list(map(int, input().split(' ')))
max_l = -1
for i in range(N):
l = A_ls[(i + 1) % len(A_ls)] - A_ls[i]
if l < 0:
l = K - A_ls[i] + A_ls[(i + 1) % len(A_ls)]
if max_l == -1:
max_l = l
else:
max_l = max(max_l, l)
print((... | K, N = list(map(int, input().split(' ')))
A_ls = list(map(int, input().split(' ')))
max_l = 0
for i in range(N):
l = A_ls[(i + 1) % N] - A_ls[i]
if l < 0:
l = K - A_ls[i] + A_ls[(i + 1) % N]
max_l = max(max_l, l)
print((K - max_l)) | p02725 |
K, N = list(map(int,input().split()))
#K: 湖1周の長さ, N:湖の周りにある家の数
A = list(map(int, input().split()))
ans = 10**10
for i in range(N):
for j in range(2):
if j == 0: #時計周り
if i == 0:
dif = A[0]+(K-A[-1])
else:
dif = A[i] - A[i-1]
... | K, N = list(map(int,input().split()))
#K: 湖1周の長さ, N:湖の周りにある家の数
A = list(map(int, input().split()))
A.sort()
dist = [A[0]+K-A[-1]] + [A[i]-A[i-1] for i in range(1, N)]
print((K-max(dist)))
| p02725 |
# スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
ans = 0
max = 0
for i in range(N):
if(i == N - 1):
A2 = K + A[0]
else:
A2 = A[i+1]
# 距離が最大のもの以外をansに加算
if(max < abs(A2 - A[i])):
ans += max
max = abs(A2 - A[i])
else:
... | # スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
# 最も離れた場所を求める(通常)
max_val = 0
for i in range(N-1):
max_val = max(max_val, A[i+1] - A[i])
# 最も離れた場所を求める(先頭と終端)
max_val = max(max_val, K - A[N-1] + A[0])
print((K-max_val)) | p02725 |
i = list(map(int, input().split()))
K = i[0]
N = i[1]
s = list(map(int, input().split()))
m = K
for i in range(N):
for j in range(i,N):
t = max(abs(s[i] - s[j]), K - abs(s[i] - s[j]))
if t <= m:
m = t
print(m) | i = list(map(int, input().split()))
K = i[0]
N = i[1]
s = list(map(int, input().split()))
m = K
for i in range(N - 1):
t = max(abs(s[i] - s[i + 1]), K - abs(s[i] - s[i + 1]))
if t <= m:
m = t
if max(abs(s[0] - s[N - 1]), K - abs(s[0] - s[N - 1])) <= m:
m = max(abs(s[0] - s[N - 1]), K - abs(... | p02725 |
circum_total = [int(n) for n in input().split()]
circum = circum_total[0]
total = circum_total[1]
distances = [int(n) for n in input().split()]
def dist_from_node_forward(node_index, distances):
forward_distances = distances[node_index:]
forward_distances.extend([n + circum for n in distances[:node_... | circum_total = [int(n) for n in input().split()]
circum = circum_total[0]
total = circum_total[1]
distances = [int(n) for n in input().split()]
mindist = circum
for index in range(len(distances)):
if index == len(distances) - 1:
rightdist = distances[0] + circum - distances[index]
else:
... | p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
s=0
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
b.append(k+a[0]-a[n-1])
c=sorted(b,reverse=True)
for i in range(1,n):
s+=c[i]
print(s) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[]
for i in range(len(a)-1):
b.append(a[i+1]-a[i])
b.append(abs(a[-1]-a[0]-k))
b.sort()
b[-1]=0
print((sum(b))) | p02725 |
k,n = list(map(int,input().split()))
diff = lambda x:x[1]-x[0]
a = list(map(int,input().split()))
distance = a+[a[0]+k]
diffs = [diff(distance[i:i+2]) for i in range(len(distance)-1)]
diffs = diffs + [diffs[i] for i in range(0,n-2)]
sums = [sum(diffs[i:i+n-1]) for i in range(len(diffs)-(n-2))]
print((min(sums))... | k,n = list(map(int,input().split()))
diff = lambda x:x[1]-x[0]
a = list(map(int,input().split()))
distance = a+[a[0]+k]
diffs = [diff(distance[i:i+2]) for i in range(len(distance)-1)]
print((k - max(diffs)))
| p02725 |
k,n=list(map(int,input().split()))
A=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(A[i+1]-A[i])
l.append(k-A[-1]+A[0])
print((sum(l)-max(l))) | k,n=list(map(int,input().split()))
A=list(map(int,input().split()))
l=[k-A[-1]+A[0]]
[l.append(A[i+1]-A[i]) for i in range(n-1)]
print((k-max(l))) | p02725 |
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [0] * (k-1)
for i in range(k-1):
b[i] = a[i+1]-a[i]
b.append(n-a[-1]+a[0])
print((sum(b)-max(b))) | n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [a[i+1]-a[i] for i in range(k-1)]
b.append(n-a[-1]+a[0])
print((n-max(b))) | p02725 |
k,n = list(map(int,input().split()))
a = list(map(int,input().split()))
a.append(a[0]+k-a[n-1])
counter = 0
for i in range(n):
if counter < a[i+1]-a[i]:
counter = a[i+1]-a[i]
print((min(k-counter,a[n-1]-a[0]))) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
a.append(a[0]+k)
cnt=0
for i in range(n):
cnt=max(cnt,a[i+1]-a[i])
print((k-cnt)) | p02725 |
(K, N) = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+K)
A_next = []
max = 0
result = 0
j = 0
k = 0
#print(A)
for x in range(1, len(A)):
#print(x)
#print(A[x]-A[x-1])
#print(A[x-1])
#print(A_next)
A_next.append(abs(A[x] - A[x-1]))
if max < A_next[j]:
... | N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(N+a[0])
#print(a)
max = 0
for i in range(len(a)-1):
p = abs(a[i]-a[i+1])
max = p if max < p else max
print((N-max))
| p02725 |
K, N = list(map(int, input().split()))
a = list(map(int, input().split()))
dist = []
for i in range(N-1):
dist.append(a[i + 1] - a[i])
dist.append(a[0] + (K - a[-1]))
total = []
for i in range(len(dist)):
total.append(sum(dist) - dist[i])
print((min(total)))
| K, N = list(map(int, input().split()))
a = list(map(int, input().split()))
dist = []
for i in range(N-1):
dist.append(a[i + 1] - a[i])
dist.append(a[0] + (K - a[-1]))
ans = sum(dist) - max(dist)
print(ans)
| p02725 |
import statistics
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
dist = []
for i in a:
target = i
tmp = [abs(j - target) if abs(j - target) < abs(j - (target + k)) else abs(j - (target + k)) for j in a]
dist.append(sum(tmp))
print((min(dist))) | import statistics
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
dist = []
for num, i in enumerate(a[:]):
if num == (n - 1):
dist.append(abs((k + a[0]) - i))
else:
dist.append(abs(a[num + 1] - i))
ind = dist.index(max(dist))
dist.pop(ind)
print((sum(dist))) | p02725 |
K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
B = []
C = []
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(A[0]+K-A[N-1])
for i in range(N-1):
C.append(min(B))
B.remove(min(B))
print((sum(C))) | K,N = list(map(int,input().split()))
A = list(map(int,input().split()))
B = []
C = []
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(A[0]+K-A[N-1])
B.remove(max(B))
print((sum(B))) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dis = A[0] + (K - A[-1])
for i in range(N-1):
dis = max(dis, A[i+1]-A[i])
print((K-dis)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+K)
dis = 0
for i in range(N):
dis = max(dis, A[i+1]-A[i])
print((K-dis)) | p02725 |
#author : dokueki
import sys
def IOE():
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
def rev(x, limit):
s = 0
for i in range(len(x) - 1):
if x[i] == 0:
x[i] = limit
s += abs(x[i] - x[i + 1])
# print(s)
return s
... | #author : dokueki
import sys
def IOE():
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
def main():
k, n = list(map(int, sys.stdin.readline().split()))
a = list(map(int, sys.stdin.readline().split()))
minn = min(a[n - 1] - a[0], int(10e10))
for i in ran... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
x = A[:]
k = -1
for _ in range(N):
x = x[1:] + x[:1]
diff = sum([min(K - abs(x[i] - x[i+1]), abs(x[i] - x[i+1])) for i in range(N - 1)])
if k == -1 or k > diff:
k = diff
print(k) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = [min(K - abs(A[i] - A[i+1]), abs(A[i] - A[i+1])) for i in range(-1, N - 1)]
diff.sort()
print((sum(diff) - diff[-1]))
| p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dA = []
for i in range(1, N):
dA.append(A[i] - A[i-1])
if i == N - 1:
dA.append(A[0] - (A[i] - K))
dA = sorted(dA)
print((sum(dA[:N-1]))) | # C - Traveling Salesman around Lake
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dist = []
for i in range(N-1):
dist.append(abs(A[i] - A[i+1]))
dist.append(abs(K - A[-1] + A[0]))
dist = sorted(dist, reverse=True)
print((sum(dist[1:]))) | p02725 |
K, N = tuple(int(v) for v in input().split())
A_list = tuple(int(a) for a in input().split())
# 各点の距離
x_iter = iter(A_list)
y_iter = iter(A_list)
next(y_iter)
d_list = [y - x for x, y in zip(x_iter, y_iter)]
d_list.append(K - A_list[-1] + A_list[0])
d_list += d_list
l = len(d_list) // 2
sum_d = [sum(d... | K, N = tuple(int(v) for v in input().split())
A_list = list(int(a) for a in input().split())
# # 各点の距離
# x_iter = iter(A_list)
# y_iter = iter(A_list)
# next(y_iter)
#
# d_list = [y - x for x, y in zip(x_iter, y_iter)]
# d_list.append(K - A_list[-1] + A_list[0])
# d_list += d_list
#
# l = len(d_list) /... | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a2 = a + [aa + k for aa in a]
max_inter = 0
for i in range(n*2 - 1):
max_inter = max(max_inter, a2[i+1] - a2[i])
print((k - max_inter)) | k, n = list(map(int, input().split()))
arr = list(map(int, input().split()))
max_inter = 0
max_inter = max(max_inter, arr[0]+k - arr[-1])
for i in range(n-1):
max_inter = max(max_inter, arr[i+1] - arr[i])
print((k - max_inter)) | p02725 |
inputs = [int(i) for i in input().split()]
K,N = inputs[0],inputs[1]
input_lines = [int(i) for i in input().split()]
max_range = input_lines[0]+(K-input_lines[-1])
for i in range(N):
if i!=N-1:
torange = input_lines[i+1]-input_lines[i]
if torange>max_range:
max_range = torang... | k,n = list(map(int,input().split()))
a_inputs = [int(a) for a in input().split()]
longest = a_inputs[0]+(k-a_inputs[-1])
for i in range(n-1):
if a_inputs[i+1]-a_inputs[i]>longest:
longest = a_inputs[i+1]-a_inputs[i]
print((k-longest)) | p02725 |
def solve():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
# 距離の最大値を求める．
max_dist = 0
for i in range(N):
for j in range(N):
# 時計回りの距離
dist1 = abs(A[i] - A[j])
# 反時計回りの距離
dist2 = K - dist1
if... | def solve():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
max_dist = 0
for i in range(1, N):
dist_tmp = A[i] - A[i-1]
if(dist_tmp > max_dist):
max_dist = dist_tmp
dist_over_zero = K - (A[N-1] - A[0])
if(dist_over_... | p02725 |
# -*- coding: utf-8 -*-
data = input().split()
round = int(data[0])
cnt_house = int(data[1])
distance = input().split()
min_dist = None
for start in range(cnt_house):
move_dist = 0
for i in range(cnt_house - 1):
if start + i == cnt_house - 1:
move_dist += round - int(distance[start... | # -*- coding: utf-8 -*-
data = input().split()
round = int(data[0])
cnt_house = int(data[1])
distance = input().split()
min_dist = None
for start in range(cnt_house):
if start == 0:
move_dist = int(distance[cnt_house - 1]) - int(distance[start])
else:
move_dist = (round - int(distance[star... | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
all_length = k*2
point = []
for i in range(n):
a_left = k-a[i]
a_right = k+a[i]
point.append(a_left)
point.append(a_right)
point = list(set(point))
point.sort()
num = len(point)
num = round(num/2)
distance = []
... | k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+k)
l = 0
for i in range(n):
l = max(l, A[i+1]-A[i])
print((k-l)) | p02725 |
from collections import deque
K, N = list(map(int, input().split()))
A = deque(list(map(int, input().split())))
A.appendleft(K - A[-1] + A[0])
sa_max = A[0]
for i in range(1, N):
sa = A[i + 1] - A[i]
if sa_max < sa:
sa_max = sa
print((A[-1] + A[0] - (sa_max + A[1])))
| K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(K - A[-1] + A[0])
sa_max = A[-1]
for i in range(N - 1):
sa = A[i + 1] - A[i]
if sa_max < sa:
sa_max = sa
print(((A[-2] - A[0]) + A[-1] - sa_max))
| p02725 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.