input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
K, N = list(map(int,input().split()))
A = list(map(int, input().split()))
l = 0
L = []
for i in range(N-1):
l = A[i+1] - A[i]
L.append(l)
L.append(K-A[N-1]+A[0])
Ans = []
for j in range(len(L)):
l = sum(L) - L[j]
Ans.append(l)
print((min(Ans)))
| K, N = list(map(int,input().split()))
A = list(map(int, input().split()))
l = 0
L = []
for i in range(N-1):
l = A[i+1] - A[i]
L.append(l)
L.append(K-A[N-1]+A[0])
print((sum(L)-max(L))) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
maxd = (K - A[-1]) + A[0]
for i in range(1, N):
d = A[i] - A[i - 1]
maxd = max(maxd, d)
print((K - maxd)) | K, N = list(map(int, input().split()))
A = tuple(map(int, input().split()))
maxd = K - A[-1] + A[0]
for i in range(1, N):
d = A[i] - A[i-1]
maxd = max(maxd, d)
ans = K - maxd
print(ans) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [a[i] - a[i-1] for i in range(1, n)]
d.insert(0, a[0])
d.append(k - a[-1])
sum_d = sum(d)
most_min_path = 10000
for i in range(n):
if i == 0:
normal_ck = sum_d - d[i] - d[-1]
reverse_ck = sum_d - d[i+1]
... | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
d = [a[i+1] - a[i] for i in range(n)]
l = 0
for i in range(n):
l = max(l, a[i+1] - a[i])
print((k - l)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
d = [a[i+1] - a[i] for i in range(n)]
l = 0
for i in range(n):
l = max(l, a[i+1] - a[i])
print((k - l)) | def main():
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(a[0] + k)
max_length = 0
for i in range(n):
max_length = max(max_length, a[i+1] - a[i])
print((k - max_length))
if __name__ == '__main__':
main()
| p02725 |
K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=0
for i in range(N):
for j in range(N):
C=abs(A[i]-A[j])
D=K-C
if C>D:
saidai=D
else:
saidai=C
if ans<saidai:
ans=saidai
else:
pass
p... | K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
dis=A[0]+K-A[N-1]
for i in range(N-1):
if A[i+1]-A[i]>=dis:
dis=A[i+1]-A[i]
else:
pass
print((K-dis))
| p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a += [k]
x = [a[i+1]-a[i] for i in range(n)]
answer = sum(x)
for i in range(n):
_x = x[:i] + x[i+1:]
answer = min(answer, sum(_x))
print(answer) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a += [k]
x = [a[0]]
for i in range(n):
_a = a[i+1] - a[i]
x += [_a]
x[0] = x[0]+x[-1]
x = x[:-1]
x.remove(max(x))
print((sum(x))) | p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
m=0
for i in range(n):
for j in range(i+1,n):
l=min(a[j]-a[i],k-a[j]+a[i])
m=max(m,l)
print((k-m)) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
m=0
for i in range(n-1):
m=max(m,a[i+1]-a[i])
m=max(m,k-a[n-1]+a[0])
print((k-m)) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
distance = []
for i in range(N-1):
dis = A[i + 1] - A[i]
# if i == N - 1:
# dis = A[i] - A[1]
distance.append(dis)
dis = K - A[N - 1] + A[0]
distance.append(dis)
# print(distance)
# print(max(distance))
# ... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
distance = []
for i in range(N-1):
dis = A[i + 1] - A[i]
distance.append(dis)
dis = K - A[N - 1] + A[0]
distance.append(dis)
index = distance.index(max(distance))
print((K - distance[index]))
| p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
res = []
for i in range(n-1):
j = a[i+1] - a[i]
res.append(j)
l = k + a[0] - a[n-1]
res.append(l)
m = max(res)
print((k - m)) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
data=[0]*n
for i in range(n-1):
data[i]=a[i+1]-a[i]
data[n-1]=k+a[0]-a[n-1]
print((sum(data)-max(data))) | p02725 |
K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
distance=max(A)-min(A)
for i in range(N):
A.append(A[i]+K)
for i in range(N):
distance=min(distance,A[i+N-1]-A[i])
print(distance) | K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
A+=[A[0]+K]
print((min(K-(A[i+1]-A[i]) for i in range(N)))) | p02725 |
import sys
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
far = k + A[0] - A[-1]
for x, y in zip(A[1:], A):
if far < x - y:
far = x - y
print((k-far)) | import sys
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
far = k + A[0] - A[-1]
y = A[0]
for x in A:
if far < x - y:
far = x - y
y = x
print((k-far)) | p02725 |
import sys
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
far = k + A[0] - A[-1]
y = A[0]
for x in A[1:]:
dis = x - y
if far < dis:
far = dis
y = x
print((k - far)) | import sys
def main():
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
far = k + A[0] - A[-1]
y = A[0]
for x in A[1:]:
dis = x - y
if far < dis:
far = dis
y = x
print((k - far))
if __name__ == "__main__":
main() | p02725 |
import sys
def main():
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
A += [k + A[0]]
far = max(x - y for x, y in zip(A[1:], A))
print((k - far))
if __name__ == "__main__":
main() | import sys
def main():
read = sys.stdin.buffer.read
k, n, *A = list(map(int, read().split()))
A += [A[0] + k]
far = max(y - x for x, y in zip(A, A[1:]))
print((k - far))
if __name__ == "__main__":
main() | p02725 |
import itertools
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A_list = list(itertools.permutations(A, N))
ans = 10**8
for i in A_list:
tmp = 0
if (i[0] == min(A) and i[2] == max(A)) or (i[0] == max(A) and i[2] == min(A)):
for j in range(N-1):
i... | K,N = list(map(int, input().split()))
A = [int(a) for a in input().split()]
ans = A[-1]-A[0]
for i in range(N-1):
ans = min(ans, K-A[i+1]+A[i])
print(ans)
| p02725 |
K,N = list(map(int,input().split()))
L = [i for i in map(int,input().split())]
L.append(L[0]+K)
dist = []
for i in range(N):
dist.append(abs(L[i+1]-L[i]))
print((sum(dist)-max(dist))) | K,N = list(map(int,input().split()))
L = [i for i in map(int,input().split())]
L.append(L[0]+K)
dist = []
for i in range(N):
dist.append(L[i+1]-L[i])
print((sum(dist)-max(dist))) | p02725 |
K,N=list(map(int, input().split()))
A=list(map(int, input().split()))
max_diff = 0
for i in range(0,N):
for j in range(i,N):
ck = abs(A[j] - A[i])
if max_diff < ck:
if ck <= K/2:
max_diff = ck
print(max_diff)
| K,N=list(map(int, input().split()))
A=list(map(int, input().split()))
max_diff = 0
ck = 0
for i in range(0,N):
if i == N -1:
ck = abs(A[(i+1)%N] + K - A[i])
else:
ck = abs(A[(i+1)%N] - A[i])
if max_diff < ck:
max_diff = ck
print((K - max_diff))
| p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [0] * n
d_max = 0
for i in range(n - 1):
d[i] = a[i + 1] - a[i]
d_max = max(d_max, d[i])
d[-1] = (k - a[-1]) + a[0]
d_max = max(d_max, d[-1])
print((k - d_max))
| k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d_max = 0
for i in range(n - 1):
d = a[i + 1] - a[i]
d_max = max(d_max, d)
d = (k - a[-1]) + a[0]
d_max = max(d_max, d)
print((k - d_max))
| p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d_max = 0
for i in range(n - 1):
d = a[i + 1] - a[i]
d_max = max(d_max, d)
d = (k - a[-1]) + a[0]
d_max = max(d_max, d)
print((k - d_max))
| k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d_max = 0
for i in range(n - 1):
d = a[i + 1] - a[i]
if d > d_max:
d_max = d
d = (k - a[-1]) + a[0]
if d > d_max:
d_max = d
print((k - d_max))
| p02725 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dist = 0
for a in A:
dist |= 1 << a
dist = format(dist, "0%db" % K)
d = dist.index("1")
ans = 0
count = 0
for i in range(K):
if dist[(d + i) % K] == "1":
ans = max(ans, count)
count = 0
else:
cou... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dist = [0] * K
for a in A:
dist[a] = 1
d = dist.index(1)
ans = 0
count = 0
for i in range(K):
if dist[(d + i) % K] == 1:
ans = max(ans, count)
count = 0
else:
count += 1
ans = max(ans, count)
pr... | p02725 |
K, N = [ int(i) for i in input().split()]
n = [int(i) for i in input().split()]
total = []
for i in range(0, N):
distances = n
if i > 0:
distances[i-1] += K
total.append(max(distances) - distances[i])
print((min(total))) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+K)
maxD = 0
for n in range(0, N):
maxD = max(maxD, A[n+1] - A[n])
print((K - maxD)) | p02725 |
K, N = list(map(int, input().split()))
Alist = list(map(int, input().split()))
#for each house, traverse clock/anti-clock wise
Alen = len(Alist)
min_distance = 10000000
for s in range(Alen):
distance = 0
start_p = s
current_p = s
next_p = 0 # random number
#clock-wise
while (True):
# cal... | K, N = list(map(int, input().split()))
Alist = list(map(int, input().split()))
#for each house, traverse clock/anti-clock wise
Alen = len(Alist)
min_distance = 10000000
for s in range(Alen):
distance = 0
current_p = s
#clock-wise distance
if (current_p == (Alen-1)):
next_p = 0
distance = ... | p02725 |
K, N = list(map(int,input().split()))
As = list(map(int, input().split()))
distList = []
for idx, dist in enumerate(As):
if idx == 0:
distList.append(K - As[-1] + dist)
else:
distList.append(dist - As[idx - 1])
min_dist = 0
for idx, dist in enumerate(distList):
target_dist = 0
for i in... | K, N = list(map(int,input().split()))
As = list(map(int, input().split()))
As.append(K + As[0])
print((K - max([y - x for x,y in zip(As, As[1:])])))
| p02725 |
K, N=list(map(int, input().split()))
A=list(map(int, input().split()))
box = []
for i in range(N):
a = abs(A[i-1]-A[i])
if a>K/2:
a = K - a
box.append(a)
box.extend(box)
dis = []
for i in range(N):
d = sum(box[i:i+N-1])
dis.append(d)
print((min(dis))) | K, N=list(map(int, input().split()))
A=list(map(int, input().split()))
box = []
for i in range(N):
d = abs(A[i-1]-A[i])
if d>K/2:
d = K - d
box.append(d)
print((K-max(box))) | p02725 |
K, N = list(map(int, input().split()))
loc = list(map(int, input().split()))
distances = []
total = []
for i in range(N-1):
distances.append(loc[i+1] - loc[i])
distances.append(loc[0] + K - loc[N-1])
for i in range(N):
total.append(K - distances[i])
print((min(total)))
| K, N = list(map(int, input().split()))
loc = list(map(int, input().split()))
distances = []
total = []
for i in range(N-1):
distances.append(loc[i+1] - loc[i])
distances.append(loc[0] + K - loc[N-1])
max_dis = max(distances)
print((K - max_dis))
| p02725 |
k, n = list(map(int,input().split()))
xs = list(map(int,input().split()))
xs = xs + [x+k for x in xs]
ans = float('inf')
for i in range(n):
a = xs[i:i+n]
delta = a[-1] - a[0]
ans = min(delta, ans)
print(ans) | k, n = list(map(int,input().split()))
xs = list(map(int,input().split()))
xs = xs + [x+k for x in xs]
ans = float('inf')
for i in range(n):
delta = xs[i+n-1] - xs[i]
ans = min(delta, ans)
print(ans)
| p02725 |
k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
a = a + [a[0]+k]
dif = [0]*n
for i in range(n):
dif[i] += a[i+1] - a[i]
dif.sort()
print((k-dif[-1])) | k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
a = a + [a[0]+k]
dif = [0]*n
for i in range(n):
dif[i] += a[i+1] - a[i]
print((k-max(dif))) | p02725 |
k,n,*a=list(map(int,open(0).read().split()))
a+=a[0]+k,
print((min(k-a[i+1]+a[i]for i in range(n)))) | k,n,*l=list(map(int,open(0).read().split()))
print((min((l[i-1]-l[i])%k for i in range(n)))) | p02725 |
K, N = list(map(int,input().split()))
List = list(map(int,input().split()))
d = []
for i in range(N):
for j in range(N):
x = min(abs(List[i]-List[j]), K-abs(List[i]-List[j]))
d.append(x)
result = K - int(max(d))
print(result) | K, N = list(map(int,input().split()))
List = list(map(int,input().split()))
d = []
for i in range(1,N):
x = min(abs(List[i]-List[i-1]), K-abs(List[i]-List[i-1]))
d.append(x)
d.append(min(abs(List[N-1]-List[0]), K-abs(List[N-1]-List[0])))
result = K - int(max(d))
print(result) | p02725 |
K,N = list(map(int,input().split()))
li = list(map(int,input().split()))
#反時計回りか時計回りの合計距離を、個数出して比較
for i in range(N):#i番目の家を出発地にした時の最小距離を順に求めていく
iti_t=i#初期位置
iti_h=i#初期位置
lon_t=0
lon_h=0
for j in range(N-1):#初期位置から進めていく
if iti_t !=(N-1):
lon_t+=li[iti_t+1]-li[iti_t]
iti_t+=1
el... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
result = A[0] - A[N - 1] + K
for i in range(N - 1):
result = max(result, A[i + 1] - A[i])
print((K - result)) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
# tmp1 = A[-1] - A[0]
# tmp2 = A[-1] - (20 - A[0] - A[-1])
# tmp2 = A[-1] - A[1]
# print(min(tmp1, tmp2))
# # print(A[-1]-A[0])
# ans = []
ans = -1
for i in range(N):
tmp = 0
I = A[i]
for j in range(N-1):
i... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
# tmp1 = A[-1] - A[0]
# tmp2 = A[-1] - (20 - A[0] - A[-1])
# tmp2 = A[-1] - A[1]
# print(min(tmp1, tmp2))
# # print(A[-1]-A[0])
# ans = []
ans = -1
for i in range(N):
# 右方向
tmp = A[-1] - A[i]
if i != 0:
tmp... | p02725 |
def main():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = float('inf')
for i in range(N):
if A[i] > A[i-1]:
tmp = (K + A[i-1]) - A[i]
else:
tmp = A[i-1] - A[i]
ans = min(ans, tmp)
for i in range(N):
... | def main():
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [0] * (2 * N)
for i in range(2*N):
if i < N:
B[i] = A[i]
else:
B[i] = K + A[i - N]
l = 0
for i in range(N):
tmp = B[i+1] - B[i]
l = m... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
max_dis = 0
for i in range(N - 1):
for j in range(i+1, N):
tmp = A[j] - A[i]
if tmp > K // 2:
tmp -= K//2
max_dis = max(max_dis, tmp)
print((K - max_dis)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = K - (A[-1] - A[0])
for i in range(N - 1):
tmp = A[i + 1] - A[i]
ans = max(tmp,ans)
print((K - ans)) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
max_dist = 0
for i in range(N):
if i == N - 1:
dist = A[0] + K - A[i]
else:
dist = A[i+1] - A[i]
if dist > max_dist:
max_dist = dist
print((K - max_dist)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff = [abs(A[i-1] - A[i]) for i in range(1, N)]
diff.append(abs(A[0] - A[N-1] + K))
print((K - max(diff))) | p02725 |
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(k - a[-1] + a[0])
print((k - max(diff)))
| k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(k + a[0])
diff = [a1 - a0 for a0, a1 in zip(a, a[1:])]
print((k - max(diff)))
| p02725 |
def around(K,A):
N2 = A.pop(0)
A.append(N2+K)
return A
K,N = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
X = 0
X_min = 1000000000
for j in range(0,len(A)):
X=0
# print(A)
X = A[len(A)-1] - A[0]
# print(X)
# for i in range(0,len(A)-1): #i番目の家... | K,N = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
X = 0
space = 0
idx = 0
A.append(A[0]+K)
for j in range(0,len(A)-1):
X=0
X = A[j+1] - A[j]
if space < X:
space = X
idx = j
print((A[idx] + K - A[idx+1] )) | p02725 |
K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
b=[]
for i in range(N):
if A[i]==0:
b.append(A[N-1])
else:
for j in range(i+1,N):
b.append(K-(A[j]-A[i]))
print((min(b)))
| K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
b=[]
for i in range(N-1):
b.append(K-(A[i+1]-A[i]))
b.append(A[N-1]-A[0])
print((min(b)))
| p02725 |
k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
D = [j - i for i, j in zip(A, A[1:])] + [k-A[-1]+A[0]]
md = max(D)
ans = k - md
print(ans) | k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A += [A[0] + k]
D = [j - i for i, j in zip(A, A[1:])]
ans = k - max(D)
print(ans) | p02725 |
k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [a[0]+k-a[n-1]]
for i in range(1,n):
d.append(a[i]-a[i-1])
print((sum(d)-max(d))) | 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(a[0]+k-a[n-1])
print((sum(d)-max(d))) | p02725 |
import sys
input = sys.stdin.readline
k, n = [int(w) for w in input().split()]
a_li = [int(w) for w in input().split()]
dist = k - a_li[-1] + a_li[0]
for i in range(1, n):
dist = max(dist, a_li[i] - a_li[i - 1])
print((k - dist))
| import sys
input = sys.stdin.readline
k, n = [int(w) for w in input().split()]
a_li = [int(w) for w in input().split()]
dist = k - a_li[-1] + a_li[0]
for a1, a2 in zip(a_li[:-1], a_li[1:]):
dist = max(dist, a2-a1)
print((k - dist))
| p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
if A[0] != 0:
B = A + [K]
else:
B = A
#print(B)
for i in range(N):
B.append(A[i] + K)
#print(B)
ans = 10000000
C =[]
for i in range(N):
cnt = 0
for j in range(i, i + N - 1):
cnt +=B[j+1] - B[j]
... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
a = K + A[0]
A = A + [a]
#print(A)
B = []
for i in range(N):
B.append(A[i+1] - A[i])
B = sorted(B,reverse = False)
print((sum(B) - max(B))) | p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
ma=0
for i in range(n-1):
ma=max(ma,a[i+1]-a[i])
print((k-max(ma,a[0]+k-a[n-1]))) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
check_l =[]
for i in range(len(a)-1):
check_l.append(a[i+1]-a[i])
check_l.append(k+a[0]-a[n-1])
print((k-max(check_l))) | p02725 |
K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
l=[]
s=0
for i in range(N):
A.append(A[i]+K)
for i in range(N):
for j in range(N-1):
s+=A[i+1]-A[i]
l.append(s)
s=0
print((min(l))) | K,N=list(map(int,input().split()))
A=list(map(int,input().split()))
l=[]
A.append(A[0]+K)
for i in range(N):
l.append(A[i+1]-A[i])
print((K-max(l)))
| p02725 |
import itertools
K,N = list(map(int,(input().split())))
A = list(map(int,(input().split())))
ans = []
for i in range(N):
if i < N-1:
ans.append(A[i+1]-A[i])
ans.append(K-A[N-1])
fin = []
for i in itertools.combinations(ans,N-1):
fin.append(sum(i))
print((min(fin))) | K,N = list(map(int,(input().split())))
A = list(map(int,(input().split())))
ans = []
for i in range(N-1):
ans.append(A[i+1]-A[i])
ans.append(K-A[N-1]+A[0])
print((K-(max(ans)))) | p02725 |
K, N = list(map(int, input().split()))
lis = list(map(int, input().split()))
dis=[]
for _ in range(N):
p = lis.pop(0)
lis.append(p)
d = 0
for i in range(N-1):
if lis[i+1] > lis[i]:
d += (lis[i+1]-lis[i])
else:
d += (K - lis[i]) + lis[i+1]
dis.append(d)
print((min(dis))) | K, N = list(map(int, input().split()))
lis = list(map(int, input().split()))
dis=[]
lis.append(lis[0])
for i in range(N):
if lis[i+1] > lis[i]:
dis.append(lis[i+1]-lis[i])
else:
dis.append((K - lis[i]) + lis[i+1])
print((sum(dis)-max(dis))) | p02725 |
# -*- coding: utf-8 -*-
def calc(k, kiten, a):
koho1 = abs(kiten -a)
koho2 = kiten + k - a
koho3 = a + k - kiten
return min(koho1, koho2, koho3)
def main():
k, n = list(map(int, input().split()))
a_list = list(map(int, input().split()))
max_kkn = a_list[0] + k - a_list[-... | # -*- coding: utf-8 -*-
def calc(k, kiten, a):
koho1 = abs(kiten -a)
koho2 = kiten + k - a
koho3 = a + k - kiten
return min(koho1, koho2, koho3)
def main():
k, n = list(map(int, input().split()))
a_list = list(map(int, input().split()))
max_kkn = a_list[0] + k - a_list[-... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
li = []
for i in range(N):
if i == 1:
cadA = A[N-1] - A[0]
else:
cadA = K - A[i] + A[i-1]
if i == N-1:
cadB = A[N-1] - A[0]
cadB = 100000000000
else:
cadB = A[i] + (K - A[i+1])
... | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
distance = [0] * N
for i in range(N):
if not i == N-1:
distance[i] = A[i+1] - A[i]
else:
distance[N-1] = A[0] + (K - A[N-1])
distance.sort()
distance.pop()
print((sum(distance)))
| p02725 |
#どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
... | #どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
... | p02725 |
def calc_sub(arg, start):
global n,k
sub = 0
for i in range(n):
if i != 0:
idx = start + i
if idx < n:
sub += arg[idx] - arg[idx-1]
else:
idx = idx - n
if idx == 0:
sub += arg[0] + (k - arg[n-1])
else:
sub += arg[idx] - arg[idx... | k, n = list(map(int, input().split()))
a = input().split()
l_si_i = [int(s) for s in a]
#print(l_si_i)
num_list = []
for i in range(n):
if i == 0:
sub = l_si_i[0] + (k - l_si_i[n-1])
else:
sub = l_si_i[i] - l_si_i[i-1]
num_list.append(sub)
#print(num_list)
#print(sum(num_list))
id... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
max_diff = A[0] + (K - A[-1])
for i in range(1, N):
max_diff = max(max_diff, A[i] - A[i - 1])
print((K - max_diff)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0] + K)
max_diff = -1
for i in range(1, N + 1):
max_diff = max(max_diff, A[i] - A[i - 1])
print((K - max_diff)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = a[-1] - a[0]
for i in range(1, n):
start = a[i]
end = a[i-1]+k
ans = min(ans, end-start)
print(ans) | def main():
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
cost = 10**10
for i in range(n-1):
cost = min(cost, k - abs(a[i]-a[i+1]))
print((min(cost, k-abs(a[0]+k-a[n-1]))))
if __name__ == "__main__":
main() | p02725 |
def main():
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
cost = 10**10
for i in range(n-1):
cost = min(cost, k - abs(a[i]-a[i+1]))
print((min(cost, k-abs(a[0]+k-a[n-1]))))
if __name__ == "__main__":
main() | def main():
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
cost = a[n-1]-a[0]
for i in range(n-1):
cost = min(cost, k-(a[i+1]-a[i]))
print(cost)
if __name__ == "__main__":
main() | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
max = k + a[0] - a[n-1]
for i in range(n-1):
tmp = a[i+1] - a[i]
if tmp > max:
max = tmp
print((k-max)) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
max = k + a[0] - a[n-1]
prev = a[0]
for i in a[1:]:
tmp = i - prev
if tmp > max:
max = tmp
prev = i
print((k-max)) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = []
ans.append(max(a) - min(a))
for i in range(n):
if a[i] > k // 2:
a[i] = (k - a[i]) * -1
ans.append(max(a) - min(a))
print((min(ans))) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
l = [a[0] + k - a[-1]]
for i in range(1, n):
l.append(a[i] - a[i - 1])
print((sum(l) - max(l))) | p02725 |
P, N = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr.sort()
mn = arr[-1] - arr[0]
for i in range(N):
val = arr.pop(0)
arr.append(val + P)
mn = min([mn, arr[-1] - arr[0]])
print(mn)
| P, N = list(map(int, input().split()))
arr = list(map(int, input().split()))
mn = 100000000
l, r = 0, len(arr) - 1
for i in range(N):
if (arr[r] - arr[l]) < mn:
mn = arr[r] - arr[l]
arr[l] += P
l = (l + 1) % N
r = (r + 1) % N
print(mn)
| p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = max(A) - min(A)
for i in range(N):
A[-(i+1)] -= K
if max(A) - min(A) < ans:
ans = max(A) - min(A)
print(ans) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
dist = [0] * (N)
for i in range(N-1):
dist[i] = A[i+1] - A[i]
dist[N-1] = A[0] - A[-1] + K
print((K - max(dist))) | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A += [A[0] + K]
gap = max(y-x for x,y in zip(A, A[1:]))
print((K - gap)) | import sys
read = sys.stdin.buffer.read
K, N, *A = list(map(int, read().split()))
A.append(A[0] + K)
gap = max(y - x for x, y in zip(A, A[1:]))
print((K - gap)) | p02725 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, N, *A = list(map(int, read().split()))
A.append(K + A[0])
D = 0
for i, j in zip(A, A[1:]):
d = j - i
if d > D:
D = d
print((K - D))
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, N, *A = list(map(int, read().split()))
A.append(K + A[0])
d = [j - i for i, j in zip(A, A[1:])]
print((K - max(d)))
| p02725 |
k, n = list(map(int, input().split()))
An = list(map(int, input().split()))
mn = 0
Amax = max(An)
Amin = min(An)
for i in range(len(An)):
cal = 0
A = An[i:] + An[:i]
for i in range(len(A)-1):
if A[i] == Amax and A[i+1] == Amin:
cal += A[i+1] + k - A[i]
elif A[i]... | k, n = list(map(int, input().split()))
An = list(map(int, input().split()))
node = [An[i+1] - An[i] for i in range(len(An) - 1)]
node = node[:] + [k - An[n-1] + An[0]]
print((k - max(node))) | p02725 |
k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = k
b = a[0] + (k-a[-1])
prev = a[0]
for i, v in enumerate(a):
if i == 0:
ans = min(ans, k-b)
ans = min(ans, k-abs(v-prev))
prev = v
print(ans) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = k
b = a[0] + (k-a[-1])
prev = a[0]
for i, v in enumerate(a):
if i == 0:
ans = min(ans, k-b)
ans = min(ans, k-(v-prev))
prev = v
print(ans) | p02725 |
K, N = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(len(A)):
min_this = 0
for j in range(len(A)-1):
now_point = A[i+j-len(A)]
next_point = A[i+j+1-len(A)]
if next_point - now_point < 0:
min_this += (K-now_point) + next_point
... | K, N = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(len(A)):
now_point = A[i]
last_point = A[i-1]
if last_point == 0:
last_point = K
if last_point - now_point <= 0:
now_min = (K-now_point) + last_point
else:
now_min = last_point -... | p02725 |
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A2 = [K+a for a in A]
A3 = A + A2
dist = [0] * N
for i in range(N):
j = i + N - 1
dist[i] = A3[j] - A[i]
print((min(dist)))
| K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A3 = A + [K+a for a in A]
dist = [A3[i+N-1] - A[i] for i in range(N)]
print((min(dist)))
| p02725 |
import sys
input = lambda: sys.stdin.readline().rstrip()
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])
ans = k - l
print(ans) | 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])
ans = k - l
print(ans) | p02725 |
k,n = list(map(int, input().split()))
c = list(map(int,input().split()))
answer = k
x = c[n-1]-c[0]
if x < answer:
answer = x
y = c[0]+k-c[1]
if y < answer:
answer = y
z = k-c[n-1]+c[n-2]
if z < answer:
answer = z
w = c[n-1] - c[0]
if w < answer:
answer = w
for i in range(1,n-1):
a =... | k,n = list(map(int,input().split()))
lst = list(map(int,input().split()))
dst = []
for i in range(n-1):
dst.append(lst[i+1]-lst[i])
dst.append(lst[0] + k-lst[n-1])
dst_rev = sorted(dst)
ans = 0
for i in range(n-1):
ans += dst_rev[i]
print (ans) | p02725 |
# ABC160_C
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
# mid=(a[0]+a[-1])/2
d=[]
for i in range(n-1):
d.append(a[i+1]-a[i])
# d.append(k-a[-1])
# d=[k-a[-1]]+d
# print(d)
ans=10**10
d=[k-a[-1]+a[0]]+d
d+=[k-a[-1]+a[0]]
# print(d)
for i in range(1,n):
t=min(k-d[i-1],k-d[i... | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
d=[]
d.append(k-a[-1]+a[0])
for i in range(1,n):
d.append(a[i]-a[i-1])
ans=10**18
for di in d:
t=k-di
ans=min(ans,t)
print(ans) | p02725 |
I=lambda:list(map(int,input().split()))
p,n=I()
l=I()
mi=10**9+7
for i in range(n):
te=0
j=i
while (j+1)%n!=i%n:
if j==n-1:
te+=abs(l[-1]-sum(l))
else:
te+=abs(l[j%n]-l[(j+1)%n])
j+=1
mi=min(te,mi)
l=l[::-1]
for i in range(n):
te=0
... | I=lambda:list(map(int,input().split()))
p,n=I()
l=I()
ne=[]
ma=10**9+7
for i in range(n-1):
ne.append(abs(l[i]-l[i+1]))
if l[-1]==p:
ne.append(l[0]-l[-1])
else:
ne.append(l[0]+abs(p-l[-1]))
g=sum(ne)
for i in ne:
ma=min(ma,g-i)
print(ma)
| p02725 |
k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
d=0
for i in range(n-1):
d=max(sorted(a)[i+1]-sorted(a)[i],d)
d=max(k+sorted(a)[0]-sorted(a)[n-1],d)
print((k-d)) | k,n=list(map(int,input().split()))
a=list(map(int,input().split()))
d=0
for i in range(n-1):
d=max(a[i+1]-a[i],d)
d=max(k+a[0]-a[n-1],d)
print((k-d)) | p02725 |
N , M = list(map(int,input().split()))
L = []
for _ in range(M):
m = tuple(map(int,input().split()))
L.append(m)
if N == 1:
for ans in range(0,10):
ans = str(ans)
for x in L:
if ans[x[0] - 1] != str(x[1]):
break
else:
print(ans)
... | N, M = list(map(int,input().split()))
L = []
for _ in range(M):
m = tuple(map(int,input().split()))
L.append(m)
if(N == 1): lower = 0
else: lower = 10 ** (N - 1)
for ans in range(lower, 10 ** N ):
ans = str(ans)
for x in L:
if ans[x[0] - 1] != str(x[1]):
break
... | p02761 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
if M == 0:
ans = 0
if N == 2:
ans = 10
if N == 3:
ans = 100
print(ans)
exit()
sc = []
dic = dict()
for _ in range(M):
sc.append(list(map(int, input().split())))
sc.sort(key=lambd... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
if M == 0:
ans = 0
if N == 2:
ans = 10
if N == 3:
ans = 100
print(ans)
exit()
sc = []
dic = dict()
out = ""
for _ in range(M):
sc.append(list(map(int, input().split())))
sc.sort... | p02761 |
#n = int(input())
#s = input()
#n, k= map(int,input().split())
#da = list(map(int,input().split()))
n,m = list(map(int,input().split()))
da = [list(map(int,input().split())) for i in range(m)]
ans = -1
for i in range(10**(n)):
now = str(i)
ju = True
for j in range(m):
if len(now) < da... | # n = int(input())
# s = input()
n, m = list(map(int,input().split()))
# da = list(map(int,input().split()))
# a = [int(input()) for i in range(n)]
da = [list(map(int,input().split())) for i in range(m)]
def ch(x):
k = len(x)
if n!=k: return False
for i in range(m):
if k < da[i][0]:
... | p02761 |
from collections import defaultdict
N, M = list(map(int, input().split()))
SC = [list(map(int, input().split())) for _ in range(M)]
d = defaultdict(list)
for s, c in SC:
d[s].append(c)
if any(len(set(v)) > 1 for v in list(d.values())):
print((-1))
elif d[1] == [0] and N > 1:
print((-1))
el... |
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
cand = [-1] * N
flag = False
for s, c in X:
s -= 1
if cand[s] == -1:
cand[s] = c
elif cand[s] != c:
flag = True
if flag or (N > 1 and cand[0] == 0):
print((-1))
else:
ans... | p02761 |
def main():
n, m = input_list()
sc = []
d = {}
mk = 0
for i in range(m):
s, c = input_list()
if s in d and d[s] != c:
print((-1))
exit()
d[s] = c
mk = max(s, mk)
for i in range(1000):
si = str(i)
if len(si) < n:
continue
check = True
ls ... | def main():
n,m = input_list()
sc = {}
for i in range(m):
s, c = input_list()
if s in sc and sc[s] != c:
print((-1))
exit()
sc[s] = c
for i in range(1000):
si = str(i)
if len(si) != n:
continue
ok = True
for keta, num in list(sc.items()):
index ... | p02761 |
n,m=list(map(int,input().split()))
sc=[]
for i in range(m):
sc.append(list(map(int,input().split())))
# print((sc))
if n==1:l=[i for i in range(0,10)]
if n==2:l=[i for i in range(10,100)]
if n==3:l=[i for i in range(100,1000)]
for ll in l:
k=list(str(ll))
if all([k[s-1]==str(c) for s,c in sc]):
... | def ii():return int(eval(input()))
def mi():return list(map(int,input().split()))
n,m=mi()
sc=[]
for _ in range(m):
sc+=tuple(mi()),
if n==3:
l=list(range(100,1000))
if n==2:
l=list(range(10,100))
if n==1:
l=list(range(0,10))
for i in l:
num=str(i)
if all([num[s-1]==str(c) for s,c ... | p02761 |
n,m = list(map(int, input().split()))
t = [-1]*n
for _ in range(m):
s,c = list(map(int, input().split()))
s -= 1
if t[s] != -1 and t[s] != c:
print((-1))
exit()
t[s] = c
if n != 1:
if t[0] == 0:
print((-1))
exit()
if t[0] == -1:
t[0] = 1
for i in range(... | n,m = list(map(int, input().split()))
p = [-1]*n
for i in range(m):
s,c = list(map(int, input().split()))
s -= 1
if p[s] == -1:
p[s] = c
if p[s] != c:
print((-1))
exit()
if n == 1:
if p[0] == -1:
print((0))
exit()
else:
if p[0] == -1:
p[0] = 1
for i in range(1,... | p02761 |
n,m=list(map(int,input().split()))
sl=[];cl=[]
for i in range(m):
s,c=list(map(int,input().split()))
sl.append(s)
cl.append(c)
isThere=False
#ans=10**n-1
for i in range(10**n):
st=list(str(i))
flag=True
if len(st)==n:
for j in range(m):
if st[sl[j]-1]!=str(cl... | #k=int(input())
n,m=list(map(int,input().split()))
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
sl=[]
cl=[]
for i in range(m):
s,c=list(map(int,input().split()))
sl.append(s)
cl.append(c)
flag=False
for i in range(1000):
if len(str(i))==n:
... | p02761 |
import sys
N,M=list(map(int,input().split()))
x=[-1]*N
valid=True
for _ in range(M):
s,c=list(map(int,input().split()))
if x[s-1]!=-1 and x[s-1]!=c:
print((-1))
sys.exit()
x[s-1]=c
if N>1 and x[0]==0:
print((-1))
else:
ans=0
for i in range(N):
if x[i]... | N,M=list(map(int,input().split()))
x=[-1]*N
for _ in range(M):
s,c=list(map(int,input().split()))
s-=1
if ((s==c==0 and N>1) or
x[s]!=-1 and x[s]!=c):
print((-1))
exit()
x[s]=c
if x[0]==-1:
x[0]=0+(N>1)
for i in range(N):
if x[i]==-1: x[i]=0
print((''.j... | p02761 |
# -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
s = list()
c = list()
for i in range(m):
si, ci = list(map(int, input().split()))
si -= 1
s.append(si)
c.append(ci)
for i in range(1000):
digit = list(str(i))
... | # -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
s = list()
c = list()
for i in range(m):
si, ci = list(map(int, input().split()))
si -= 1
s.append(si)
c.append(ci)
# KeyInsight
# 全探索
# https://www.youtube.com/wa... | p02761 |
n, m = list(map(int, input().split()))
sc = [list(map(int, input().split())) for _ in range(m)]
ans = float('inf')
k = 0
if n == 2: k = 10
elif n == 3: k = 100
for i in reversed(list(range(k, 1000))):
#print(f'i: {i}')
flg = True
for s, c in sc:
#print(f'{s}桁目が{c}?', end=' ')
if l... | n, m = list(map(int, input().split()))
sc = [list(map(int, input().split())) for _ in range(m)]
ans = float('inf')
k = 0
if n == 2: k = 10
elif n == 3: k = 100
for i in range(k, 1000):
flg = True
for s, c in sc:
if list(str(i))[s-1] == str(c): continue
flg = False
if flg:
... | p02761 |
n, m = list(map(int, input().split()))
sc = [list(map(int, input().split())) for i in range(m)]
ans = -1
for i in range(1000):
can = 1
t = str(i)
if len(t)!=n: continue
for s,c in sc:
if int(t[s-1])!=c: can = 0
if can:
ans = i
... | n, m = list(map(int, input().split()))
sc = [list(map(int, input().split())) for i in range(m)]
for i in range(1000):
x = str(i)
if len(x)!=n: continue
can = 1
for s,c in sc:
if int(x[s-1])!=c: can = 0
if can:
print(i)
b... | p02761 |
n,m=list(map(int,input().split()))
li=[]
if n==1:
score="0"
else:
score="1"+"0"*(n-1)
for i in range(m):
s,c=list(map(int,input().split()))
if n!=1 and s==1 and c==0:
print("-1")
quit()
li.append([s,c])
for j in range(len(li)):
if li[j][0]==s and li[j][1]!=c:... | n,m=list(map(int,input().split()))
li=[]
if n==1:
score="0"
else:
score="1"+"0"*(n-1)
for i in range(m):
s,c=list(map(int,input().split()))
if n!=1 and (s,c)==(1,0):
print("-1")
quit()
li.append([s,c])
for j in range(len(li)):
if li[j][0]==s and li[j][1]!=c:
... | p02761 |
N,M = list(map(int,input().split()))
sc = [list(map(int,input().split())) for i in range(M)]
s = [sc[i][0] for i in range(len(sc))]
c = [sc[i][1] for i in range(len(sc))]
judge=False
for i in range(len(s)):
for j in range(len(s)):
if s[i]==s[j] and c[i] != c[j]:
print((-1))
... | N,M = list(map(int,input().split()))
sc = [list(map(int,input().split())) for i in range(M)]
judge = False
target = [-1 for i in range(N)]
for i in range(M):
if sc[i][1] + target[sc[i][0]-1] == sc[i][1]-1 or sc[i][1] + target[sc[i][0]-1] == 2*sc[i][1]:
target[sc[i][0]-1] = sc[i][1]
else:
... | p02761 |
N, M = list(map(int, input().split()))
scs = [tuple(map(int, input().split())) for _ in range(M)]
if N == 1:
L, R = 0, 9
elif N == 2:
L, R = 10, 99
else:
L, R = 100, 999
for x in range(L, R+1):
ss = list(map(int, str(x)))
# print(x, ss)
for s, c in scs:
if ss[s-1] != c:
... | import sys
N, M = list(map(int, input().split()))
scs = [tuple(map(int, input().split())) for _ in range(M)]
anss = [-1] * N
for s, c in scs:
s -= 1
if anss[s] != -1 and anss[s] != c:
print((-1))
sys.exit()
if N >= 2 and s == 0 and c == 0:
print((-1))
sys.exit(... | p02761 |
def myAnswer(N:int,M:int,S:list,C:list)-> int:
ans=-1
for i in range(10**N):
if(len(str(i)) == N):
for s,c in zip(S,C):
tmp=list(str(i))
if(tmp[s-1] != str(c)):
break
else:
if(ans == -1):
ans=i
... |
def solve(N,M,S,C) -> int:
for n in range(10**N):
length = len(str(n))
if(length == N):
n = str(n)
for s,c in zip(S,C):
if(int(n[s-1]) != c):
break
else:
return n
return -1
def main():
N... | p02761 |
def main():
N, M = (int(i) for i in input().split())
from collections import defaultdict
dic = defaultdict(set)
for i in range(M):
s, c = (int(i) for i in input().split())
dic[s].add(c)
if 0 in dic[1] and N != 1:
return print(-1)
for i in range(1, N+1):
... | def main():
N, M = (int(i) for i in input().split())
dic = {}
for i in range(M):
s, c = (i for i in input().split())
if s in dic.keys() and dic[s] != c:
return print(-1)
dic[s] = c
for t in range(1000):
t = str(t)
if len(t) != N:
... | p02761 |
def main():
N, M = (int(i) for i in input().split())
dic = {}
for i in range(M):
s, c = (int(i) for i in input().split())
if s in dic.keys() and dic[s] != c:
return print(-1)
dic[s] = c
# print(dic)
for i in range(1000):
s = str(i)
if le... | def main():
N, M = (int(i) for i in input().split())
dic = {}
for i in range(M):
s, c = (i for i in input().split())
if s in dic.keys() and dic[s] != c:
return print(-1)
dic[s] = c
# print(dic)
for i in range(1000):
s = str(i)
if len(s) ... | p02761 |
import time
def input_int_list():
return [int(thing) for thing in input().split(" ")]
def No():
print((-1))
exit()
N,M=input_int_list()
s_c_tuple_list=[input_int_list() for i in range(M)]
the_dict={}
for tup in s_c_tuple_list:
s,c=tup
if s==1 and c==0:
if N==1:
... | import time
def input_int_list():
return [int(thing) for thing in input().split(" ")]
def No():
print((-1))
exit()
N,M=input_int_list()
s_c_tuple_list=[input_int_list() for i in range(M)]
the_dict={}
for tup in s_c_tuple_list:
s,c=tup
if s==1 and c==0:
if N==1:
... | p02761 |
N, M = list(map(int, input().split()))
sc= [list(input().split()) for i in range(M)]
ans = -1
for i in range(10**N):
if len(str(i)) != N:
continue
else:
cnt = 0
s = str(i)
for j in range(M):
if s[int(sc[j][0])-1] == sc[j][1]:
cnt += 1
... | N, M = list(map(int, input().split()))
sc= [list(input().split()) for i in range(M)]
ans = -1
for i in range(10**N):
if len(str(i)) != N:#N桁の数だけを考える
continue
else:
cnt = 0
s = str(i)
for j in range(M):
if s[int(sc[j][0])-1] == sc[j][1]:
cnt ... | p02761 |
n, m = list(map(int, input().split()))
sc = [tuple(map(int, input().split())) for j in range(m)]
for i in range(0 if n == 1 else 10**(n - 1), 10**n):
if all(str(i)[s - 1] == str(c) for s, c in sc):
print(i)
break
else:
print((-1)) | n, m = list(map(int, input().split()))
sc = [tuple(map(int, input().split())) for j in range(m)]
for i in range(10**n):
if len(str(i)) == n and all(str(i)[s - 1] == str(c) for s, c in sc):
print(i)
break
else:
print((-1)) | p02761 |
n, m = list(map(int, input().split()))
listans = ["0"] * n
ans = 0
for i in range(m):
s, c = list(map(str, input().split()))
if n > 1 and s == "1" and c == "0":
ans = -1
if listans[int(s)-1] != c:
if listans[int(s)-1] == "0":
listans[int(s)-1] = c
else :
... | n, m = list(map(int, input().split()))
listans = [0] * n
ans = 0
for i in range(m):
s, c = list(map(int, input().split()))
s -= 1
if listans[s] == 0:
listans[s] = c
elif listans[s] != c:
ans = -1
if n > 1 and s == 0 and c == 0:
ans = -1
if n > 1 and listans[... | p02761 |
n, m = list(map(int, input().split()))
sc = []
for _ in range(m):
s_, c_ = list(map(int, input().split()))
sc.append([s_-1, c_])
ans = [-1 for _ in range(n)]
for s, c in sc:
if s == 0 and c == 0:
if n != 1:
print((-1))
exit()
if ans[s] is -1: ans[s] = c
el... | n, m = list(map(int, input().split()))
dic = {i: -1 for i in range(1, n + 1)}
for _ in range(m):
s_, c_ = list(map(int, input().split()))
if dic[s_] == -1:
dic[s_] = c_
else:
if dic[s_] != c_:
print((-1))
exit()
if n == 1:
if dic[1] == -1:
prin... | p02761 |
check = 0
check2 = 0
kensa = 0
kekka = ""
num = []
hantei = "OK"
INF = input().split()
gyosu = int(INF[1])
keta = int(INF[0])
out = []
for l in range(keta):
out.append(0)
for i in range(gyosu):
num.append([int(j) for j in input().split()])
if gyosu > 0 :
check = int(num[0][0])
check2 = in... | n,m = list(map(int,input().split()))
ans_list = ["x"]*n
for i in range(m):
a,b = list(map(int,input().split()))
b = str(b)
#print(ans_list)
if ans_list[a-1] != b and ans_list[a-1] != "x":
print((-1))
exit()
else:
ans_list[a-1] = b
if ans_list[0] == "0" and n != 1:
... | p02761 |
def check(x):
if len(str(x))!=N:
return False
for i in range(M):
if str(x)[S[i]]!=str(C[i]):
return False
return True
N,M=list(map(int,input().split()))
S=[]
C=[]
for i in range(M):
s,c=list(map(int,input().split()))
s-=1
S.append(s)
C.append(c)
#print(S,C)
for i in range(1... | N,M=list(map(int,input().split()))
#SC=[s,c for input().split() in range(M)]
SC=[list(input().split()) for i in range(M)]
'''
SC=[]
for i in range(M):
SC.append((input().split()))
'''
def check(x):
x=str(x)
if len(x)!=N:
return False
for s,c in SC:
if x[int(s)-1]!=c:
return False
... | p02761 |
N,M = list(map(int,input().split()))
from collections import defaultdict
sc = defaultdict(set)
for _ in range(M):
s,c = list(map(int,input().split()))
sc[s].add(c)
if N == 1:
if len(sc[1]) > 1:
print((-1))
elif len(sc[1]) == 1:
print((sc[1].pop()))
else:
print... | N,M = list(map(int, input().split()))
from collections import defaultdict
SC = defaultdict(set)
for _ in range(M):
s,c = list(map(int, input().split()))
SC[s].add(c)
if N == 1:
if len(SC[1]) > 1:
ans = -1
elif len(SC[1]) == 1:
ans = SC[1].pop()
else:
ans = 0
... | p02761 |
n, m = list(map(int, input().split()))
sc = [tuple(map(int, input().split())) for i in range(m)]
for i in range(10**n):
ans = str(i)
if len(ans) != n:
continue
if all([ans[s-1] == str(c) for s, c in sc]):
print(ans)
break
else:
print((-1)) | n, m = list(map(int, input().split()))
sc = [tuple(map(int, input().split())) for i in range(m)]
for i in range(10**n):
ans = str(i)
if len(ans) != n:
continue
if all([ans[s-1] == str(c) for s, c in sc]):
print(ans)
exit()
print((-1)) | p02761 |
n,m = list(map(int,input().split()))
sc = [list(map(int,input().split())) for _ in range(m)]
for i in range(1000):
li = []
j = str(i)
for k in range(len(j)):
li.append(int(j[k]))
if len(li) != n:
continue
else:
flag = True
for s,c in sc:
if... | n,m = list(map(int,input().split()))
sc = [list(map(int,input().split())) for _ in range(m)]
li = [-1] * n
for s,c in sc:
if li[s-1] == -1 or li[s-1] == c:
li[s-1] = c
else:
print((-1))
exit()
if n != 1 and s == 1 and c == 0:
print((-1))
exit()
for i... | p02761 |
ranges = [list(range(10)), list(range(10, 100)), list(range(100, 1000))]
N, M = list(map(int, input().split()))
s = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
s[i], c[i] = list(map(int, input().split()))
ans = 0
found = False
for candidate in ranges[N - 1]:
valid = True
... | N, M = list(map(int, input().split()))
ans = [-1 for i in range(N)]
valid = True
for i in range(M):
s, c = list(map(int, input().split()))
if ans[s - 1] < 0:
ans[s - 1] = c
elif ans[s - 1] != c:
valid = False
if not valid:
print((-1))
else:
if N == 1:
if a... | p02761 |
n,m = list(map(int,input().split()))
s,c = [0]*m,[0]*m
for i in range(m):
s[i],c[i] = list(map(int,input().split()))
s[i] -= 1
number = ['0']*n
for j in range(m):
if number[s[j]] != '0' and number[s[j]] != str(c[j]):
print('-1')
quit()
elif s[j] == 0 and c[j] == 0 and n != 1:
... | n,m = list(map(int,input().split()))
s,c = [0]*m,[0]*m
for i in range(m):
s[i],c[i] = list(map(int,input().split()))
s[i] -= 1
ans = ''
number = ['0']*n
for j in range(m):
flag_1 = (number[s[j]] != '0' and number[s[j]] != str(c[j]))
flag_2 = (s[j] == 0 and c[j] == 0 and n != 1)
if flag_1 o... | p02761 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.readline().split()))
lines = [line.rstrip() for line in sys.stdin.readlines()]
ret = -1
MIN = 0 if N == 1 else pow(10, N - 1)
MAX = 10 if N == 1 else... | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.readline().split()))
lines = [list(map(int, sys.stdin.readline().split())) for _ in range(M)]
ret = -1
for n in range(0, pow(10, N)):
if len(str(... | p02761 |
N,M = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(M)]
if N==1:
for i in range(10):
flg = 0
for j in range(M):
s,c = A[j]
if str(i)[s-1]==str(c):
continue
else:
flg = 1
... | N,M = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(M)]
n = -1
for x in range(1000):
x = str(x)
if len(x)!=N:continue
ind = 0
for i in range(M):
s,c = A[i]
if x[int(s)-1]!=str(c):
ind=1
break
if ind==0:
... | p02761 |
n, m = list(map(int, input().split()))
num_list = ['X'] * n
def ans():
if n == 1 and m == 0:
return 0
for i in range(m):
set = list(map(str, input().split()))
if set[0] == '1' and set[1] == '0' and n != 1:
return -1
else:
if num_list[int(set[0]... | n, m = list(map(int, input().split()))
num_list = ['X'] * n
def ans():
if n == 1 and m == 0:
return 0
for i in range(m):
set = list(map(str, input().split()))
if set[0] == '1' and set[1] == '0' and n != 1:
return -1
else:
if num_list[int(set[0]... | p02761 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.