input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int,input().split()))
X = list(map(int, input().split()))
X.sort()
diff = []
if M != 1:
for i in range(M-1):
diff.append(X[i+1]-X[i])
else:
diff = [0]
sorted_diff = sorted(diff)
sorted_diff.reverse()
ans = sum(sorted_diff)
for i in range(min([N,M])-1):
ans -= sorted_diff[i]
p... | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
d = []
for i in range(M-1):
d.append(X[i+1]-X[i])
d.sort()
if M-N >= 0:
print((sum(d[0:M-N])))
else:
print((0)) | p03137 |
import itertools
import math
import fractions
import functools
import copy
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
sub = []
x.sort()
for i in range(m-1):
sub.append(abs(x[i]-x[i+1]))
sub.sort(reverse=True)
if n >= m:
print((0))
quit()
for i in range(n-1... | def main():
# n = int(input())
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
# s = input()
# h = [int(input()) for _ in range(n)]
x.sort()
subs = []
for i in range(1, m):
subs.append(abs(x[i]-x[i-1]))
subs.sort()
if (m < n):... | p03137 |
n,m = list(map(int,input().split()))
lst = [int(i) for i in input().split()]
lst.sort()
dst = []
if n>=m:
print((0))
exit()
for i in range(1,m):
dst.append(lst[i]-lst[i-1])
dst.sort()
if n==1:
ans = sum(dst)
else:
ans = sum(dst[:-n+1])
print(ans) | n,m = list(map(int,input().split()))
lst = list(map(int,input().split()))
lst.sort()
dst = []
for i in range(1,m):
dst.append(lst[i] - lst[i-1])
dst.sort()
if n >= m:
print((0))
elif n==1:
print((sum(dst)))
else:
print((sum(dst[:-n+1]))) | p03137 |
from itertools import combinations
import bisect
import copy
def move(positions, tmp_X, N, tmp_ans):
min_dif = float('inf')
min_idx = None
min_x = None
for x in tmp_X:
idx = bisect.bisect_left(positions,x)
if idx == N:
tmp_dif = abs(x-positions[idx-1])
tmp_idx = idx -1
elif... | N,M = list(map(int,input().split()))
if M == 1:
print((0))
exit()
X = sorted(list(map(int,input().split())))
difX = [0] + [X[i+1]-X[i] for i in range(M-1)]
difX.sort(reverse=True)
print((sum(difX)-sum(difX[:N-1]))) | p03137 |
n,m = list(map(int, input().split()))
x = [int(i) for i in input().split()]
x_sort = sorted(x)
check = []
for i in range(len(x)-1):
check.append(abs(x_sort[i+1] - x_sort[i]))
check_sorted = sorted(check)
ans = 0
if (m-n) >= 0:
for i in check_sorted[0:m-n]:
ans += i
print(ans)
else:
... | n, m = list(map(int, input().split()))
X = [int(i) for i in input().split()]
X = sorted(X)
L = []
for i in range(1, m):
L.append(X[i] - X[i - 1])
L = sorted(L)
if n >= m:
print((0))
else:
print((sum(L[0:m-n]))) | p03137 |
import sys
N, M = list(map(int, input().split()))
X = [int(_) for _ in input().split()]
X.sort()
A = []
if N >= M:
print((0))
sys.exit()
else:
for i in range(M - 1):
A.append(X[i + 1] - X[i])
for i in range(N - 1):
A.remove(max(A))
sum = sum(A)
print(sum) | import sys
N, M = list(map(int, input().split()))
X = sorted(list(map(int,input().split())))
A = []
sum = 0
if N >= M:
print((0))
sys.exit()
else:
for i in range(M - 1):
A.append(X[i + 1] - X[i])
A = sorted(A, reverse = True)
for k in A[N - 1:]:
sum += k
print(sum) | p03137 |
(n, m) = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
diff = []
for i in range(1, len(x)):
diff.append(x[i] - x[i-1])
diff.sort(reverse=True)
sum = 0
for i in range(n - 1, len(diff)):
sum += diff[i]
print(sum) | n, m = list(map(int, input().split()))
if n >= m:
print((0))
exit(0)
x = sorted(list(map(int, input().split())))
gaps = sorted([x[i] - x[i-1] for i in range(1, m)], reverse=True)
print((sum(gaps[n-1:])))
| p03137 |
from itertools import combinations
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
devide_num = min(N -1, M - 1)
devides = combinations(list(range(len(X))), devide_num)
mincost = X[-1] - X[0]
for devide in devides:
previous = 0
cost = 0
for next_point ... | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
diffs = [X[i+ 1] - X[i] for i in range(len(X) - 1)]
diffs.sort(reverse=True)
skip = N - 1
print((sum(diffs[skip:])))
| p03137 |
from heapq import heappush, heappop
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
if N >= M:
print((0))
exit()
q1 = []
for i in range(M - 1):
sec = X[i + 1] - X[i]
heappush(q1, (-sec, i + 1))
q2 = []
for n in range(N - 1):
sec, idx = h... | from heapq import heappush, heappop
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
if N >= M:
print((0))
exit()
q1 = []
for i in range(M - 1):
sec = X[i + 1] - X[i]
heappush(q1, -sec)
ans = 0
for _ in range(N - 1):
ans -= heappop(q1)
... | p03137 |
n, m = list(map(int, input().split()))
li = list(map(int, input().split()))
li.sort()
move_cost = [li[i+1] - li[i] for i in range(m-1)]
move_cost.sort()
for i in range(n-1):
if len(move_cost) == 0:
break
move_cost = move_cost[:-1]
print((sum(move_cost))) | n, m = list(map(int, input().split()))
li = list(map(int, input().split()))
li.sort()
move_cost = [li[i+1] - li[i] for i in range(m-1)]
move_cost.sort()
if n > 1:
move_cost = move_cost[:-n+1]
print((sum(move_cost))) | p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n < m:
x_distance = [abs(x[i + 1] - x[i]) for i in range(m - 1)]
x_distance.sort()
ans = 0
for i in range (m - n):
ans += x_distance[i]
print(ans)
else:
print((0))
| n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n < m:
x_distance = [x[i + 1] - x[i] for i in range(m - 1)]
x_distance.sort()
ans = 0
for i in range (m - n):
ans += x_distance[i]
print(ans)
else:
print((0))
| p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n < m:
x_distance = [x[i + 1] - x[i] for i in range(m - 1)]
x_distance.sort()
print((sum(x_distance[:(m-n)])))
else:
print((0))
| n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n < m:
x_distance = [x2 - x1 for x1, x2 in zip(x, x[1:])]
x_distance.sort()
print((sum(x_distance[:(m-n)])))
else:
print((0))
| p03137 |
n, m = list(map(int, input().split()))
*x, = sorted(map(int, input().split()))
diff = []
for i in range(m-1):
diff.append(abs(x[i]-x[i+1]))
partition = sorted(diff, reverse=True)[:(n-1)]
ans = 0
for _d in diff:
if _d in partition:
partition.remove(_d)
continue
ans += _d
p... | n, m = list(map(int, input().split()))
*x, = sorted(map(int, input().split()))
diff = []
for i in range(m-1):
diff.append(abs(x[i]-x[i+1]))
p = 0 if len(diff) < n else len(diff)-n+1
sec = sorted(diff)[:p]
print((sum(sec)))
| p03137 |
N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
D = sorted([X[n+1]-X[n] for n in range(M-1)])
if M<=N:
print((0))
else:
print((sum(D[:M-N]))) | N,M = list(map(int,input().split()))
X = sorted(map(int,input().split()))
D = sorted(x2-x1 for x1,x2 in zip(X,X[1:]))[::-1]
print((sum(D[N-1:]))) | p03137 |
import sys
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
if N>=M:
print((0))
sys.exit()
X.sort()
Y=[0]*(M-1)
for i in range(M-1):
Y[i]=X[i+1]-X[i]
Y=sorted(Y)[:-(N-M)]
print((sum(Y))) | import sys
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
X.sort()
Y=[0]*(M-1)
for i in range(M-1):
Y[i]=X[i+1]-X[i]
Y=sorted(Y)[:max(0,M-N)]
print((sum(Y))) | p03137 |
N, M = list(map(int, input().split()))
X = [int(i) for i in input().split()]
X.sort()
D = [X[i+1] - X[i] for i in range(M - 1)]
D.sort()
print((0 if M <= N else sum(D[:M-N])))
| N, M = list(map(int, input().split()))
X = list(set([int(i) for i in input().split()]))
X.sort()
D = [X[i+1] - X[i] for i in range(M - 1)]
D.sort()
print((0 if M <= N else sum(D[:M-N])))
| p03137 |
N, M = list(map(int, input().split()))
X = list(set([int(i) for i in input().split()]))
X.sort()
D = [X[i+1] - X[i] for i in range(M - 1)]
D.sort()
print((0 if M <= N else sum(D[:M-N])))
| N, M = list(map(int, input().split()))
X = list(set(map(int, input().split())))
X.sort()
D = [X[i+1] - X[i] for i in range(M - 1)]
D.sort()
print((0 if M <= N else sum(D[:M-N])))
| p03137 |
N,M = list(map(int, input().split()))
X = list(map(int,input().split()))
if N >= M:
print((0))
else:
X = sorted(X)
list = []
for i in range(M-1):
list.append(X[i+1]-X[i])
list = sorted(list)
list1 = list[:M-N]
print((sum(list1))) | N,M = list(map(int, input().split()))
X = list(map(int,input().split()))
if N >= M:
print((0))
else:
X = sorted(X)
list = [X[i]-X[i-1] for i in range(1,M)]
list = sorted(list)
list1 = list[:M-N]
print((sum(list1))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = sorted(X)
Y = list(map(lambda x,y:x-y, Y[1:],Y[:-1]))
for i in range(N-1):
if Y != []:
x = max(Y)
Y.remove(x)
else:
break
print((sum(Y)))
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
diffX = list(map(lambda x,y:x-y, X[1:], X[:-1]))
diffX.sort(reverse = True)
if N-1 >= len(diffX):
print((0))
else:
print((sum(diffX[N-1:])))
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N > M :
print((0))
else:
X.sort()
x_next = X[0]
flag = [X[_] - X[_-1] for _ in range(1,M)]
for lp in range(N-1):
ff = flag.index(max(flag))
flag.pop(ff)
print((sum(flag)))
| N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N > M :
print((0))
else:
X.sort()
x_next = X[0]
flag = [X[_] - X[_-1] for _ in range(1,M)]
flag.sort()
flag = flag[:M-N:]
print((sum(flag)))
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N > M :
print((0))
else:
X.sort()
x_next = X[0]
flag = [X[_] - X[_-1] for _ in range(1,M)]
flag.sort()
flag = flag[:M-N:]
print((sum(flag)))
| N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N >= M :
print((0))
exit()
X.sort()
flag = [b-a for a,b in zip(X,X[1:])]
flag.sort()
print((sum(flag[:M-N:]))) | p03137 |
import heapq
n,m = list(map(int, input().split(' ')))
# I am given n pieces
if n >= m:
print(0)
else:
xis = list(map(int, input().split()))
xis.sort()
distances = [v- u for u,v in zip(xis,xis[1:])]
distances.sort(key = lambda x:-x)
print(sum(distances[n-1:] or [0])) | import heapq
n,m = list(map(int, input().split(' ')))
xis = list(map(int, input().split()))
xis.sort()
distances = [v- u for u,v in zip(xis,xis[1:])]
distances.sort(key = lambda x:-x)
print(sum(distances[n-1:] or [0])) | p03137 |
def iread():
return int(eval(input()))
def sread():
return eval(input())
def aread_int():
tmp = input().split()
ret = [int(i) for i in tmp]
return ret
def aread_str():
return input().split()
if __name__ == '__main__':
n, m = list(map(int, input().split()))
... | def iread():
return int(eval(input()))
def sread():
return eval(input())
def aread_int():
tmp = input().split()
ret = [int(i) for i in tmp]
return ret
def aread_str():
return input().split()
if __name__ == '__main__':
n, m = list(map(int, input().split()))
... | p03137 |
N, M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
tmp = sorted([X[i+1] - X[i] for i in range(M-1)])
if(M <= N):
print((0))
else:
print((sum(tmp[:M-N]))) | def ans():
N, M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
tmp = sorted([X[i+1] - X[i] for i in range(M-1)])
if(M <= N):
print((0))
else:
print((sum(tmp[:M-N])))
ans() | p03137 |
N, M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
tmp = sorted([X[i+1]-X[i] for i in range(M-1)])
ans = sum(tmp[:M-N])
if(M <= N):
ans = 0
print(ans) | N, M = list(map(int,input().split()))
X = sorted(map(int,input().split()))
X = sorted([X[i+1]-X[i] for i in range(M-1)])
ans = sum(X[:M-N])
if M <= N:
ans = 0
print(ans) | p03137 |
N, M = list(map(int, input().split()))
X = sorted(map(int, input().split()))
diff = [0] * (M - 1)
for i in range(M - 1):
diff[i] = X[i + 1] - X[i]
print((sum(sorted(diff)[: max(0, M - N)])))
| N, M, *X = list(map(int, open(0).read().split()))
if N >= M:
print((0))
exit()
X.sort()
diff = []
for i in range(M - 1):
diff.append(X[i + 1] - X[i])
diff.sort()
print((sum(diff[: M - N])))
| p03137 |
N, M, *X = list(map(int, open(0).read().split()))
if N >= M:
print((0))
exit()
X.sort()
diff = []
for i in range(M - 1):
diff.append(X[i + 1] - X[i])
diff.sort()
print((sum(diff[: M - N])))
| from itertools import tee
def pairwise(iterable):
"s -> (s0,s1), (s1,s2), (s2, s3), ..."
a, b = tee(iterable)
next(b, None)
return list(zip(a, b))
N, M, *X = list(map(int, open(0).read().split()))
if N >= M:
print((0))
exit()
X.sort()
diffs = [cur - prev for prev, cur in pai... | p03137 |
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
if(N>=M):
print((0))
else:
X.sort()
b=[]
for i in range(M-1):
b.append(X[i+1]-X[i])
for i in range(N-1):
b.remove(max(b))
print((sum(b)))
| N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
if(N>=M):
print((0))
else:
X.sort()
b=[]
for i in range(M-1):
b.append(X[i+1]-X[i])
b.sort()
for _ in range(N-1):
b.pop()
print((sum(b)))
| p03137 |
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
if(N>=M):
print((0))
else:
X.sort()
b=[]
for i in range(M-1):
b.append(X[i+1]-X[i])
b.sort()
for _ in range(N-1):
b.pop()
print((sum(b)))
| n,m=list(map(int,input().split()))
l=sorted(list(map(int,input().split())))
if n>=m:
print((0))
exit()
s=l[-1]-l[0]
l=sorted([a-b for a,b in zip(l[1:],l)], reverse=True)
print((s-sum(l[:n-1])))
| p03137 |
import itertools
N, M= (int(i) for i in input().split())
X = list(int(i) for i in input().split())
X.sort()
if(N >= M):
print((0))
else:
combination = list(itertools.combinations(list(range(M)),N-1))
min = 2 * 100000
for tmp_taple in combination:
tmp_sum = 0
from_index = 0... | N, M= (int(i) for i in input().split())
if (N<M):
X = list(int(i) for i in input().split())
X.sort()
Y = [X[i] - X[i-1] for i in range(1, len(X))]
Y.sort()
print((sum(Y[0:M-N])))
else:
print((0))
"""
N個のコマ：N-1個の閉経路が存在する
各座標の距離を求める(M-1個)
M：座標の数 N:駒の数
移動しなくても通っている座標の数: N
M - N
"... | p03137 |
N,M=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
d=[0]*(M-1)
for i in range(len(X)-1):
d[i]=X[i+1]-X[i]
d=sorted(d)[::-1]
print((sum(d[N-1:]))) | N,M=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
print((sum(sorted([X[i+1]-X[i] for i in range(M-1)])[::-1][N-1:]))) | p03137 |
n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
else:
difference = []
x.sort()
for i in range(m-1):
difference.append(x[i+1]-x[i])
for i in range(n-1):
difference.remove(max(difference))
print((sum(... | n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
else:
difference = []
x.sort()
for i in range(m-1):
difference.append(x[i+1]-x[i])
difference.sort()
print((sum(difference[:m-n])))
| p03137 |
N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
d = [0] * (M - 1)
ans = 0
if N >= M:
print(ans)
else:
for i in range(M - 1):
d[i] = abs(X[i + 1] - X[i])
d.sort(reverse=True)
b = d[:N - 1]
for i in range(M - 1):
if d[i] in b:
... | N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
d = [0] * (M - 1)
if N >= M:
print((0))
else:
for i in range(M - 1):
d[i] = abs(X[i + 1] - X[i])
d.sort(reverse=True)
print((sum(d[N - 1:]))) | p03137 |
n,m =(int(i) for i in input().split())
x = list(int(i) for i in input().split())
x.sort()
sa = []
ans = 0
if m <= n:
print('0')
exit()
for i in range(m-1):
sa.append(x[i+1]-x[i])
for i in range(n-1):
tmp1 = max(sa)
sa.remove(tmp1)
ans = sum(sa)
print(ans) | n,m =(int(i) for i in input().split())
x = list(int(i) for i in input().split())
x.sort()
sa = []
ans = 0
if m <= n:
print('0')
exit()
for i in range(m-1):
sa.append(x[i+1]-x[i])
s2 = sorted(sa,reverse = True)
#print(s2)
for i in range(n-1,len(s2)):
ans += s2[i]
print(ans) | p03137 |
import heapq
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
dist = [0]*(M-1)
for i in range(M-1):
dist[i] = -(X[i+1] - X[i])
#print(dist)
heapq.heapify(dist)
for i in range(N-1):
if len(dist) == 0:
break
heapq.heappop(dist)
ans = 0
if len(... | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
dist = [0]*(M-1)
for i in range(M-1):
dist[i] = X[i+1] - X[i]
dist.sort()
ans = 0
if N < M:
for i in range((M-1)-(N-1)):
ans += dist[i]
print(ans) | p03137 |
import sys
readline = sys.stdin.readline
def main():
N, M = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
if N >= M:
print((0))
return
X.sort()
X = [abs(X[i+1]-X[i]) for i in range(M-1)]
X.sort()
ans = sum(X)
... | import sys
readline = sys.stdin.readline
def main():
N, M = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
if N >= M:
print((0))
return
X.sort()
X = [abs(X[i+1]-X[i]) for i in range(M-1)]
X.sort(reverse=True)
print... | p03137 |
n,m=list(map(int,input().split()))
x=sorted([int(i) for i in input().split()])
xbet=sorted([abs(x[i+1]-x[i]) for i in range(m-1)],reverse=True)
y=sum(xbet)
if n>=m:
print((0))
else:
print((y-sum(xbet[:n-1])))
| n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
x.sort()
y=[x[i]-x[i-1] for i in range(1,m)]
y.sort()
print((0 if n>=m else sum(y[:(m-n)]))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
L = [0]*(M-1)
for i in range(M-1):
L[i] = X[i+1]-X[i]
L.sort(reverse=True)
print((X[M-1]-X[0]-sum(L[:N-1]))) | def main():
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
h = [0]*M
for i in range(1, M):
h[i] = X[i]-X[i-1]
h.sort(reverse=True)
print((X[M-1]-X[0]-sum(h[:(N-1)])))
main() | p03137 |
K, N = map(int, input().split())
MOD = 998244353
P = N+K
fact = [1]*(P+1)
rfact = [1]*(P+1)
for i in range(P):
fact[i+1] = r = ((i+1) * fact[i]) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
def comb(n, k):
return fact[n] * rfact[k] * rfact[n-k] % MOD
pow2 = [1]*(P+1)
r = 1
for i in range(P):
... | K, N = map(int, input().split())
MOD = 998244353
P = N+K
fact = [1]*(P+1)
rfact = [1]*(P+1)
for i in range(P):
fact[i+1] = r = ((i+1) * fact[i]) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
def comb(n, k):
return fact[n] * rfact[k] * rfact[n-k] % MOD
V = [1]*(P+1)
r = 1
for i in range(P):
r ... | p03270 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 998244353
eps = 10**-7
def inp(): return int(eval(input()))
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
... | K,N = list(map(int, input().split()))
MAX = K+N+3
mod = 998244353
fac = [1]*(MAX+1)
for i in range(1,MAX+1):
fac[i] = (fac[i-1]*i)%mod
rev_m = [1]*(MAX+1)
rev_m[MAX] = pow(fac[MAX],mod-2,mod)
for i in range(MAX,0,-1):
rev_m[i-1] = (rev_m[i]*i)%mod
def Comb(n,k):#nCk
return (fac[n]*rev_m[k]*rev_m[n-k... | p03270 |
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = in... | def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = in... | p03270 |
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = in... | def prepare(k, n, MOD):
def get_factorials(m):
f = 1
factorials = [1]
for m in range(1, m + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (m + 1)
invs[m] = inv
for m in range(m, ... | p03270 |
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
K, N = reads()
MOD = 998244353
MAXN = 5000... | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
K, N = reads()
MOD = 998244353
MAXN = 4020... | p03270 |
k,n =list(map(int,input().split()))
mod = 998244353
fact=[1]*5000
for i in range(1,len(fact)):
fact[i] = fact[i-1]*i%mod
def comb(n,k,p):
if com[n][k] != -1:
return com[n][k]
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a=fact[n]
b=fact[k]
c=fact[n-k]
yey = (a*power_func(b,p... | k,n =list(map(int,input().split()))
mod = 998244353
fact = [1]*(n+k+1)
rfact = [1]*(n+k+1)
for i in range(n+k):
fact[i+1] = rr = ((i+1) * fact[i]) % mod
rfact[i+1] = pow(rr, mod-2, mod)
def comb(N, K,mod):
return fact[N] * rfact[K] * rfact[N-K] % mod
kota = []
for i in range(2,k+2):
ans = 0
... | p03270 |
K, N = list(map(int, input().split()))
mod = 998244353
A = []
p = mod - 2
while p != 0:
A = [p%2] + A[:]
p //= 2
def inved(x):
y = 1
for _ in range(len(A)):
if A[_] == 1:
y *= x
y %= mod
if _ != len(A) - 1:
y *= y
y %= mod
return y
X = [0 for i in range(2*K-1... | K, N = list(map(int, input().split()))
mod = 998244353
def inved(a):
x, y, u, v, k, l = 1, 0, 0, 1, a, mod
while l != 0:
x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
k, l = l, k % l
return x % mod
X = [0 for i in range(2*K-1)]
frac = [1]
for i in range(N + K):
frac.append(((i+1)*fr... | p03270 |
from itertools import combinations
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
fail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1].issubset(x) for i in x)
... | from itertools import combinations
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
fail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1] < x for i in x)
while... | p02837 |
from itertools import combinations
n = int(eval(input()))
r = list(range(n))
a = [([], []) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].append(x - 1)
fail = lambda x: not all(x.isdisjoint(a[i][0]) and x.issuperset(a[i][1]) for i in x)
... | from itertools import combinations
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
fail = lambda x: not all(a[i][0].isdisjoint(x) and a[i][1] < x for i in x)
wh... | p02837 |
def popcount(x):
r = 0
while x:
r += 1
x &= x - 1
return r
n = int(eval(input()))
r = list(range(n))
a = [[0, 0] for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y] |= 1 << (x - 1)
m = 0
l = (1 << n) - 1
for x in range(1... | def popcount(x):
r, q = 0, x
while x:
r += 1
x &= x - 1
return r, q
n = int(eval(input()))
r = list(range(n))
a = [[0, 0] for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y] |= 1 << (x - 1)
l = (1 << n) - 1
b = sorted(map(p... | p02837 |
def popcount(x):
r, q = 0, x
while x:
r += 1
x &= x - 1
return r, q
n = int(eval(input()))
r = list(range(n))
a = [[0, 0] for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y] |= 1 << (x - 1)
l = (1 << n) - 1
b = sorted(map(p... | from itertools import combinations, count
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
r = next(i for i in count(n, - 1) for x in map(set, combinations(r, i))
... | p02837 |
from itertools import combinations, count
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
r = next(i for i in count(n, -1) for x in map(set, combinations(r, i))
... | from itertools import combinations, count
n = int(eval(input()))
r = list(range(n))
a = [(set(), set()) for _ in r]
for i in r:
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
a[i][y].add(x - 1)
r = next(i for i in count(n, -1) for x in map(set, combinations(r, i))
... | p02837 |
import sys
from pprint import pprint
def solve(n, info):
ans = 0
for i in range(2 ** n):
true_info = {}
p_info = [0] * n
for j in range(n):
if (i >> j) & 1:
true_info[j] = info[j]
for x, y in info[j]:
if y == 1:... | import sys
from pprint import pprint
def solve(n, info):
ans = 0
for i in range(2 ** n):
true_info = {}
p_info = [0] * n
for j in range(n):
if (i >> j) & 1:
true_info[j] = info[j]
# pprint(info[j])
p_info[j] = 1
... | p02837 |
n=int(eval(input()))
X=[]*n
A=[]*n
for i in range(n):
a=int(eval(input()))
A.append(a)
xy = [list(map(int,input().split())) for _ in range(a)]
X.append(xy)
ans=0
for i in range(2**n):
cnt=0
for j in range(n):
if (i>>j)&1:
for k,l in X[j]:
if not ((i>>(k-1))&1)==l:
cnt=1
brea... | n=int(eval(input()))
X=[]*n
for i in range(n):
a=int(eval(input()))
xy = [list(map(int,input().split())) for _ in range(a)]
X.append(xy)
ans=0
for i in range(2**n):
cnt=0
for j in range(n):
if (i>>j)&1:
for k,l in X[j]:
if not ((i>>(k-1))&1)==l:
cnt=1
break
if cnt==0:
an... | p02837 |
import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
claim = []
for _ in range(N):
memo = []
A = int(eval(input()))
for _ in range(A):
x, y = input().split()
memo.append((x,y))
claim.append(memo)
maximam = 0
for i in range(2**N):
flag = True
bin_i ... | import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
claim = []
for _ in range(N):
memo = []
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
memo.append((x,y))
claim.append(memo)
maximam = 0
for bit in range(2**N):
flag ... | p02837 |
import itertools
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
xy = []
for _ in range(n):
m = int(readline())
tmp = [list(map(int, readline().split())) for _ in range(m)]
xy.append(tmp)
ans = 0
for l ... | import itertools
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
xy = []
for _ in range(n):
m = int(readline())
tmp = [list(map(int, readline().split())) for _ in range(m)]
xy.append(tmp)
# 逆から
for l ... | p02837 |
N = int(eval(input()))
A = []
XY = []
honest_count = []
for i in range (N):
a = int(eval(input()))
A.append(a)
inter = []
for x in range(a):
xy = list(map(int, input().split()))
inter.append(xy)
XY.append(inter)
for i in range(2 ** N):
pt = [0] * N
ck = 1
... | import itertools
n = int(eval(input()))
l = []
for i in range(n):
d = int(eval(input()))
for dd in range(d):
x, y = list(map(int, input().split()))
l.append([i, x-1, y])
ans = 0
for p in itertools.product([0, 1], repeat=n):
for ll in l:
if p[ll[0]] == 1 and p[ll[1]] != l... | p02837 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
chk = [[set(),set()] for _ in range(n)]
for o in range(n):
a = int(eval(input()))
for i in range(a):
x,y = [int(i) for i in input().split()]
if y == 0:
chk[o][0].add(x-1)
if y == 1:
chk[o][1].add(x-1)
chk = tuple(... | n = int(eval(input()))
a = []
xy = []
for i in range(n):
a += [int(eval(input()))]
xy += [[list(map(int,input().split())) for i in range(a[i])]]
honest = []
for i in range(2 ** n):
flag = 0
for j in range(n):
if (i >> j)&1 == 1: #j番目は正直であるとき
for person_state in xy[j]:
... | p02837 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | p02837 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | p02837 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [[set(), set()] for _ in range(N)]
for i in range(N):
m = int(eval(input()))
for j in range(m):
x, y = list(map(int, input().split()))
A[i][y].add(x)
ans = 0
for i in... | p02837 |
# ABC147C - HonestOrUnkind2
from itertools import combinations
def main():
N = int(eval(input()))
testimonies = {i: {} for i in range(1, N + 1)}
for i in range(1, N + 1):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
tes... | # ABC147C - HonestOrUnkind2
from itertools import combinations
def main():
N = int(eval(input()))
testimonies = [[] for i in range(N + 1)]
for i in range(1, N + 1):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
testimoni... | p02837 |
from itertools import product
N = int(eval(input()))
A = []
XY = [[] for _ in range(N)]
for i in range(N):
A.append(int(eval(input())))
for j in range(A[i]):
XY[i].append(list(map(int, input().split())))
ans = 0
for pattern in product(list(range(2)), repeat=N): # 0:不正直 1:正直
flag = True
for i... | N = int(eval(input()))
XY = []
for i in range(N):
A = int(eval(input()))
XY.append([list(map(int, input().split())) for _ in range(A)])
ans = 0
for bit in range(1 << N):
honest_cnt = 0
flag = True
for i in range(N):
if (bit >> i) & 1 == 0:
continue
honest_cnt += 1
for x, y in ... | p02837 |
N=int(eval(input()))
A=[]
X=list()
for i in range(N):
X.append([])
Y=list()
for i in range(N):
Y.append([])
for i in range(N):
A_i=int(eval(input()))
A.append(A_i)
for j in range(A_i):
x,y=list(map(int,input().split()))
X[i].append(x)
Y[i].append(y)
max_nin=0
#bi... | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
shogen=[]
nums=[]
for i in range(n):
a=int(readline())
nums.append(a)
xy=[0]*a
for j in range(a):
xy[j]=list(map(int,readline().split()))
shogen.append... | p02837 |
N = int(eval(input()))
path = []
ans = 0
ap = path.append
for i in range(N):
A = int(eval(input()))
ap([])
for j in range(A):
x, y = list(map(int,input().split()))
x -= 1
path[-1].append((x, y))
for i in range(1<<N):
i |= (1<<N)
judge = True
for j in range(N... | N = int(eval(input()))
path = []
ans = 0
for i in range(N):
A = int(eval(input()))
path.append([])
for j in range(A):
x, y = list(map(int,input().split()))
x -= 1
path[-1].append((x, y))
for i in range(1<<N):
i |= (1<<N)
judge = True
for j in range(N):
... | p02837 |
n = int(eval(input()))
la, lxy = [], []
for i in range(n):
a = int(eval(input()))
la.append(a)
xy = []
for j in range(a):
xy.append(list(map(int, input().split())))
lxy.append(xy)
lb = []
for i in range(2**n):
lb += [str(bin(i))[2:].zfill(n)]
lc = [sum(int(j) for j in i) for i in lb]
lc, ... | import sys
input = sys.stdin.readline
n = int(eval(input()))
la, lxy = [], []
for i in range(n):
a = int(eval(input()))
la.append(a)
xy = []
for j in range(a):
xy.append(list(map(int, input().split())))
lxy.append(xy)
lb = []
for i in range(2**n):
lb += [str(bin(i))[2:].zfill(n)]
lc = ... | p02837 |
n=int(eval(input()))
A=[{} for _ in range(n)]
for i in range(n):
for _ in range(int(eval(input()))):
x,y=list(map(int,input().split()))
A[i][x]=y
a=0
for i in range(2**n):
t=0
for j in range(n):
if i>>j&1:
if A[j] and any(i>>~-k&1!=A[j][k] for k in A[j]): break
else: t+=1
el... | n=int(eval(input()))
A=[]
for i in range(n):
for _ in range(int(eval(input()))):
x,y=list(map(int,input().split()))
A+=[(i,x-1,y)]
a=0
for i in range(2**n):
if all(i>>j&1<1 or i>>x&1==y for j,x,y in A):
a=max(a,sum(map(int,bin(i)[2:])))
print(a) | p02837 |
N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
temp = []
for _ in range(A):
temp.append(list(map(int, input().split())))
XY.append(temp)
max_honest = 0
for c in range(1 << N):
check = [0] * N
contradict = False
temp = c
cnt2 = 0
... | N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
temp = []
for _ in range(A):
temp.append(list(map(int, input().split())))
XY.append(temp)
max_honest = 0
for c in range(1 << N):
check = [0] * N
contradict = False
cnt1 = 0
while c !... | p02837 |
N = int(eval(input()))
testimony = [[]for i in range(N)]
for i in range(N):
num = int(eval(input()))
for j in range(num):
person, state = list(map(int, input().split()))
testimony[i].append([person-1,state])#3次元配列の作り方
honest = 0
for i in range(1, 2**N):
flag = 0
for j in range... | n = int(eval(input()))
testimony = [[] for _ in range(n)]
for i in range(n):
for j in range(int(eval(input()))):
x,y = list(map(int, input().split()))
testimony[i].append((x,y))
honest = 0
for i in range(2**n):
flag = True
for j in range(n):
if (i>>j)&1:
for x,... | p02837 |
n = int(eval(input()))
def make_remark_list(i, r):
# -1: 不明, 0: 嘘つき, 1: 真実
people = [-1] * n
people[i] = 1
for x, y in r:
people[x - 1] = y
return people
def check(x, y):
new_list = []
for a, b in zip(x, y):
a, b = min(a, b), max(a, b)
if (a, b) ==... | def check(x, y):
for a, b in zip(x, y):
if a != b and b != -1:
return False
else:
return True
n = int(eval(input()))
remarks = []
cnt_max = 0
for _ in range(n):
a = int(eval(input()))
x = [tuple(map(int, input().split())) for i in range(a)]
r = [-1] * n
... | p02837 |
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().r... | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().r... | p02837 |
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().r... | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().r... | p02837 |
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[-1]*N for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().r... | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
tes = [[] for i in range(N)]
for i in range(N):
A = int(readline())
for j in range(A):
x,y = list(map(int,readline().rstri... | p02837 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
STATE = [[]]*N
for i in range(N):
a = int(eval(input()))
STATE[i] = [list(map(int, input().split())) for i in range(a)]
def main():
ans = 0
for i in range(1<<N):
ans = max(ans, detect(i))
print(ans)
def detect(i):... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
R = [[] for i in range(N)]
for i in range(N):
A = int(eval(input()))
R[i] = [list(map(int, input().split())) for i in range(A)]
ans = 0
for i in range(1<<N):
CNT = 0
for j in range(N)... | p02837 |
from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
tmp = [-1] * n
... | from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
ok = True
for ... | p02837 |
n = int(eval(input()))
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(eval(input()))
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
for i in range(2... | n = int(eval(input()))
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(eval(input()))
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
cnt=0
for i in ... | p02837 |
n = int(eval(input()))
X = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
x = x-1
X[i].append((x, y))
ans = 0
for i in range(2**n):
cnt = 0
temp = [-1]*n
for j in range(n):
if (... | n = int(eval(input()))
g = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
x -= 1
g[i].append((x, y))
ans = 0
for i in range(2**n):
temp = [-1]*n
for j in range(n):
if (i >> j) & ... | p02837 |
n = int(eval(input()))
t = [[] for _ in range(n)]
s = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
if y == 1:
t[i].append(x - 1)
else:
s[i].append(x - 1)
res = 0
for k in r... | import itertools as it
n = int(eval(input()))
lis = [[] for _ in range(n)]
val = list(it.product([0, 1], repeat=n))
for i in range(n):
for j in range(int(eval(input()))):
x, y = list(map(int, input().split()))
x = x - 1
lis[i].append((x, y))
def honesty(k, lis, n):
for ... | p02837 |
#!/usr/bin/env python3
#ABC147 C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Count... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02837 |
from itertools import product as pro
n = int(eval(input()))
xy = []
for i in range(n):
a_i = int(eval(input()))
xy.append([tuple(map(int, input().split())) for _ in range(a_i)])
ans = 0
for l in pro([0, 1], repeat=n):
for i, t in enumerate(l):
if t == 1:
if not all(l[x-1] =... | from itertools import product
n = int(eval(input()))
xy = []
for _ in range(n):
a = int(eval(input()))
tmp = [list(map(int, input().split())) for _ in range(a)]
xy.append(tmp)
ans = 0
for bit in product([0, 1], repeat=n):
for i, liar in enumerate(bit):
if liar and any(bit[x - 1] !=... | p02837 |
n=int(eval(input()))
a=[]
for i in range(n):
m=int(eval(input()))
a.append([])
for i in range(m):
a[-1].append(list(map(int,input().split())))
ans=0
for i in range(2**n):
s=bin(i)[2:].zfill(n)
f=True
for j,k in enumerate(a):
for x,y in k:
if s[x-1]!=str(y) and s[j]=="1":f=False
... | n=int(eval(input()))
xy=[[]for _ in range(n)]
for i in range(n):
for j in range(int(eval(input()))):
xy[i].append(list(map(int,input().split())))
ans=0
for i in range(1,1<<n):
syojiki=[(i&(1<<j)!=0)+0 for j in range(n)]
flag=True
for j in range(n):
for x,y in xy[j]:
if syojiki[x-1]!=y a... | p02837 |
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
remarks = [[]] * n
max_v = 0
for i in range(n):
a = int(eval(input()))
remarks[i] = [tuple(map(int, input().split())) for _ in range(a)]
for i in range(2 ** n):
i_bin = format(i, 'b').zfi... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(eval(input()))
said = [[]] * n
for i in range(n):
said[i] = [list(map(int, input().split())) for _ in range(int(eval(input())))]
ans = 0
n_bit = '0' + str(n) + 'b'
for i in range(2 ** n):
... | p02837 |
from collections import defaultdict
def is_testimony_correct(hypothesis, testimony):
# 証言の対象者が仮説上、正直者となっているかを検証。
for target, is_honest in list(testimony.items()):
if int(hypothesis[target]) == is_honest:
continue
return False
return True
def is_hypothesis_correct(... | from collections import defaultdict
def is_testimony_correct(hypothesis, testimony):
# 証言の対象者が仮説上、正直者となっているかを検証。
for target, is_honest in list(testimony.items()):
if int(hypothesis[target]) == is_honest:
continue
return False
return True
def is_hypothesis_correct(... | p02837 |
N = int(eval(input()))
lst = [[] for _ in range(N)]
for i in range(N):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
lst[i].append([x - 1, y])
ans = 0
for i in range(2 ** N):
check = [-1] * N #1:正直者、0:不親切
count = 0 #カウント用
flag = True
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
N = int(eval(input()))
lst = [[] for _ in range(N)]
for i in range(N):
A = int(eval(input()))
for _ in range(A):
XY = tuple(map(int, input().split()))
lst[i].append(XY)
ans = 0
for i in ran... | p02837 |
# -*- coding: utf-8 -*-
# C
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
from itertools import product
N = int(eval(input()))
A = [0] * N
x = []
for i in range(N):
A[i] = int(eval(input()))
d = []
for j in range(A[i]):
d.append(tuple(map(int, input().split())))
x.ap... | # -*- coding: utf-8 -*-
# C
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
from itertools import product
N = int(eval(input()))
A = [0] * N
x = []
for i in range(N):
A[i] = int(eval(input()))
d = []
for j in range(A[i]):
d.append(tuple(map(int, input().split())))
x.ap... | p02837 |
n = int(eval(input()))
l = []
A = []
for i in range(n):
a = int(eval(input()))
A += [a]
l_1 = []
for j in range(a):
l_1 += [list(map(int, input().split()))]
l += [l_1]
ans = 0
for i in range(1 << n):
honest = []
liar = []
for j in range(n):
if ((i >> j)... | n = int(eval(input()))
num_of_sug = []
sug = []
for i in range(n):
m = int(eval(input()))
num_of_sug += [m]
sug += [[tuple(map(int, input().split())) for _ in range(m)]]
ans = 0
for i in range(2 ** n):
liar = []
honest = []
for j in range(n):
if ((i >> j) & 1):
... | p02837 |
n = int(eval(input()))
a = [0] * n
s = [[]] * n
for i in range(n):
a[i] = int(eval(input()))
tmp = [[]] * a[i]
for j in range(a[i]):
tmp[j] = [num for num in map(int, input().split())]
s[i] = tmp
# print(n)
# print(a)
# print(s)
ans = 0
for i in range(2 ** n):
pattern = '{:0' + str(n) + 'b... | n = int(eval(input()))
a = [0] * n
sl = []
for i in range(n):
a = int(eval(input()))
s = []
for j in range(a):
x, y = list(map(int, input().split()))
s.append([x, y])
sl.append(s)
ans = 0
# bit 全探索
# 1 = 正直者、0 = 不親切な人
for i in range(1 << n):
#print('pattern', bin(i))
all_ok = Tr... | p02837 |
import itertools
n = int(eval(input()))
data = {}
for x in range(n):
data[x] = []
for y in range(int(eval(input()))):
k, l = list(map(int, input().split()))
data[x].append((k - 1, l))
ans = 0
for i in itertools.product([1,0], repeat=n):
h = True
for x in range(n):
i... | import itertools
n = int(eval(input()))
data = []
for x in range(n):
for y in range(int(eval(input()))):
k, l = list(map(int, input().split()))
data.append((x, k - 1, l))
ans = 0
for i in itertools.product([1,0], repeat=n):
s = sum(list(i))
for g in data:
if i[g[0]] == 1 a... | p02837 |
import itertools
n = int(eval(input()))
data = []
for x in range(n):
for y in range(int(eval(input()))):
k, l = list(map(int, input().split()))
data.append((x, k - 1, l))
ans = 0
for i in itertools.product([1,0], repeat=n):
s = sum(list(i))
if ans > s:
continue
for g ... | import itertools
import sys
input = sys.stdin.readline
n = int(eval(input()))
data = []
for x in range(n):
for y in range(int(eval(input()))):
k, l = list(map(int, input().split()))
data.append((x, k - 1, l))
ans = 0
for i in itertools.product([1,0], repeat=n):
s = sum(list(i))
f... | p02837 |
def dudge(k):
for i in reversed(list(range(n))):
p = (k >> i) % 2
#print(' i = ', i, ' p = ', p)
if p == 0: continue
for claim in xy[i]:
x = claim[0]
y = claim[1]
truth = (k >> x-1) % 2
#print(' x = ', x, ' y = ', y, ' t... | def dudge(k):
for i in reversed(list(range(n))):
p = (k >> i) % 2
#print(' i = ', i, ' p = ', p)
if p == 0: continue
for claim in xy[i]:
x = claim[0]
y = claim[1]
truth = (k >> x-1) % 2
#print(' x = ', x, ' y = ', y, ' t... | p02837 |
def dudge(k):
for i in reversed(list(range(n))):
p = (k >> i) % 2
#print(' i = ', i, ' p = ', p)
if p == 0: continue
for claim in xy[i]:
x = claim[0]
y = claim[1]
truth = (k >> x-1) % 2
#print(' x = ', x, ' y = ', y, ' t... | def dudge(k):
for i in range(n):
p = (k >> i) % 2
if p == 0: continue
for claim in xy[i]:
x = claim[0]
y = claim[1]
truth = (k >> x-1) % 2
if truth == 1 and y == 0:
return False
elif truth == 0 and y ==... | p02837 |
n = int(eval(input()))
testimony = [] # 各iの証言
for i in range(n):
t = []
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
t.append((x - 1, y))
testimony.append(t)
best = 0 # 正直者の最大人数
for honest in range(1 << n): # 正直者をあらかじめ仮定して破綻を確認する
tmp = 0
fo... | n = int(eval(input()))
testimony = [] # 各iの証言
for i in range(n):
t = []
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
t.append((x - 1, y))
testimony.append(t)
best = 0 # 正直者の最大人数
for honest in range(1 << n): # 正直者をあらかじめ仮定して破綻を確認する
for i in range(... | p02837 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def... | p02837 |
def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x-1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N... | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x-1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N):... | p02837 |
n = int(eval(input()))
l = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,(input().split())))
l[i].append([x-1,y])
ans = 0
for i in range(1 << n):
h = []
for j in range(n):
h.append(i & 1 << j != 0)
b = T... | n = int(eval(input()))
l = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,(input().split())))
l[i].append([x-1,y])
ans = 0
for i in range(1 << n):
h = []
for j in range(n):
h.append(i & 1 << j != 0)
b = T... | p02837 |
def digitSum(n):
s = str(bin(n))
s = s[2:]
array = list(map(int, s))
return sum(array)
N = int(eval(input()))
A = []
X = []
Y = []
res = 0
for i in range(N):
a = int(eval(input()))
A.append(a)
X_temp = []
Y_temp = []
for j in range(a):
x,y = list(map(int,input... | def digitSum(n):
s = str(bin(n))
s = s[2:]
array = list(map(int, s))
return sum(array)
N = int(eval(input()))
A = []
X = []
Y = []
res = 0
for i in range(N):
a = int(eval(input()))
A.append(a)
X_temp = []
Y_temp = []
for j in range(a):
x,y = list(map(int,input... | p02837 |
N = int(eval(input()))
s = [[] for _ in range(N)]
for i in range(N):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
s[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
if (i >> j) & 1 ... | N = int(eval(input()))
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
evidences[i].append((x - 1, y))
result = 0
for i in range(1, 2 ** N):
consistent = True
for j in range(N):
... | p02837 |
n = int(eval(input()))
a_list = []
person_list = []
syogen_list = []
ans = 0
for i in range(0, n):
w = []
v = []
a = int(eval(input()))
for j in range(0, a):
x,y = list(map(int,input().split()))
w.append(x)
v.append(y)
person_list.append(w)
syogen_list.a... | n = int(eval(input()))
a_list = []
person_list = []
syogen_list = []
ans = 0
for i in range(0, n):
w = []
v = []
a = int(eval(input()))
for j in range(0, a):
x,y = list(map(int,input().split()))
w.append(x)
v.append(y)
person_list.append(w)
syogen_list.a... | p02837 |
from itertools import product
n = int(eval(input()))
xy = [[] for i in range(n)]
for i in range(n):
for j in range(int(eval(input()))):
xy[i].append(list(map(int, input().split())))
ans = 0
for bit in product([0, 1], repeat=n):
f = 0
for i, j in enumerate(bit):
if j == 1:
... | from itertools import product
def solve(bit):
for i, j in enumerate(bit):
if j == 1:
for x, y in xy[i]:
if bit[x - 1] != y:
return 0
return sum(bit)
n = int(eval(input()))
xy = [[] for i in range(n)]
for i in range(n):
for j in ran... | p02837 |
n = int(eval(input()))
xys = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
xys[i].append((x-1, y))
def digitsum(x, base=2):
ret = 0
while x>0:
ret += x % base
x = x // base
retu... | n = int(eval(input()))
xys = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
xys[i].append((x-1, y))
def digitsum(x, base=2):
ret = 0
while x>0:
ret += x % base
x = x // base
retu... | p02837 |
N = int(eval(input()))
A = [0] * N
X = [[] for _ in range(N)]
for i in range(N):
A[i] = int(eval(input()))
for j in range(A[i]):
X[i].append(list(map(int, input().split())))
Truth = 2 ** N
ans = 0
while(bin(Truth) != bin(2 ** (N + 1))):
for i in range(N):
if(bin(Truth)[i+3] == "1"):
for ... | N = int(eval(input()))
x = [[0] * (N-1) for _ in range(N)]
y = [[0] * (N-1) for _ in range(N)]
A = [0] * N
for i in range(N):
A[i] = int(eval(input()))
for j in range(A[i]):
x[i][j], y[i][j] = list(map(int, input().split()))
n = 2 ** N
Flag = 0
ans = 0
while(n < 2 ** (N+1)):
Flag = 0
for i in r... | p02837 |
N = int(eval(input()))
M = []
for _ in range(N):
A = int(eval(input()))
state = []
for _ in range(A):
x, y = list(map(int, input().split()))
x -= 1
state.append((x, y))
M.append(state)
ans = 0
for mask in range(1 << N):
can = True
for i, s in enumerate(M)... | N = int(eval(input()))
S = []
for _ in range(N):
A = int(eval(input()))
S.append([tuple(map(int, input().split())) for _ in range(A)])
def sol(state):
for i, A in enumerate(S):
if (state & (1 << i)) == 0:
continue
for j, s in A:
if ((state & (1 << (j - 1... | p02837 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.