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]
print(ans) | 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):
sub[i] = 0
print((sum(sub))) | 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):
print((0))
else:
print((sum(subs[0:m-n])))
if __name__ == '__main__':
main()
| 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 idx == 0:
tmp_dif = abs(x-positions[idx])
tmp_idx = idx
else:
dif1, dif2 = abs(x-positions[idx-1]), abs(x-positions[idx])
if dif1 >= dif2:
tmp_dif = dif2
tmp_idx = idx
else:
tmp_dif = dif1
tmp_idx = idx - 1
if min_dif > tmp_dif:
min_dif = tmp_dif
min_idx = tmp_idx
min_x = x
del positions[min_idx]
idx = bisect.bisect_left(positions, min_x)
positions.insert(idx, min_x)
tmp_X.remove(min_x)
return tmp_ans + min_dif
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N >= M:
print((0))
exit()
ans = float('inf')
for cmb in combinations(X,N):
tmp_ans = 0
tmp_X = copy.deepcopy(X)
positions = sorted(list(cmb))
for position in positions: tmp_X.remove(position)
while len(tmp_X) > 0:
tmp_ans = move(positions, tmp_X, N, tmp_ans)
ans = min(tmp_ans, ans)
print(ans) | 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:
print((0)) | 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 in devide:
cost += X[next_point] - X[previous]
if next_point + 1 < M:
previous = next_point + 1
else:
break
# last
cost += X[-1] - X[previous]
mincost = min(cost, mincost)
print(mincost)
| 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 = heappop(q1)
heappush(q2, idx)
heappush(q2, M)
cur = 0
ans = 0
for n in range(N):
idx = heappop(q2)
ans += X[idx - 1] - X[cur]
cur = idx
print(ans)
| 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)
print((X[-1] - X[0] - ans))
| 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
print(ans)
| 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()))
x = aread_int()
x = sorted(x)
x_dist = [0] * (m - 1)
for i in range(m - 1) :
x_dist[i] += abs(x[i] - x[i + 1])
if n > m :
print((0))
exit()
cost = sum(x_dist)
for i in range(n - 1) :
max_idx = x_dist.index(max(x_dist))
cost -= x_dist[max_idx]
# print(x_dist[max_idx])
x_dist[max_idx] = 0
print(cost) | 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()))
x = aread_int()
x = sorted(x)
x_dist = [0] * (m - 1)
for i in range(m - 1) :
x_dist[i] += abs(x[i] - x[i + 1])
if n > m :
print((0))
exit()
x_dist = sorted(x_dist)
idx = len(x_dist) - 1
cost = sum(x_dist)
for i in range(n - 1) :
cost -= x_dist[idx]
x_dist[idx] = 0
idx -= 1
print(cost) | 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 pairwise(X)]
diffs.sort()
print((sum(diffs[: M - N])))
| 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
for to_index in tmp_taple:
tmp_sum += X[to_index] - X[from_index]
from_index = to_index + 1
if(from_index < M-1):
tmp_sum += X[M-1] - X[from_index]
if(min > tmp_sum):
min = tmp_sum
print(min) | 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(difference)))
| 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:
b.remove(d[i])
else:
ans += d[i]
print(ans) | 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(dist) != 0:
ans = -sum(dist)
print(ans)
| 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)
for i in range(N-1):
ans -= X[-i-1]
print(ans)
if __name__ == '__main__':
main() | 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((sum(X[N-1:])))
if __name__ == '__main__':
main() | 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):
r = pow2[i+1] = (r * 2) % MOD
def calc(A):
M = A//2
r = 0
if A % 2:
p = K - 2*M + N - 2
for m in range(max(0, 2*M+2-K), min(M, N-1)+1):
r += pow2[m] * comb(M, m) * (comb(p, N-m) + comb(p-1, N-m-1)) % MOD
if 2*M+2-K <= N <= M:
r += pow2[N] * comb(M, N) % MOD
else:
p = K - 2*M + N - 1
for m in range(max(0, 2*M+1-K), min(N, M)+1):
r += pow2[m] * comb(M, m) * comb(p, N-m) % MOD
return r % MOD
ans = []
for i in range(2, 2*K+1):
if i <= K:
ans.append(calc(i - 1))
else:
ans.append(calc(2*K - i + 1))
print(*ans, sep='\n')
| 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 = (r * 2) % MOD
V[i+1] = r * rfact[i+1] % MOD
memo = {}
def calc(A):
if A in memo:
return memo[A]
M = A//2
r = 0
if A % 2:
p = K - 2*M + N - 2
for m in range(max(0, 2*M+2-K), min(M, N-1)+1):
r += V[m] * rfact[M-m] * (fact[p]*rfact[N-m] + fact[p-1]*rfact[N-m-1])*rfact[p-N+m] % MOD
if 2*M+2-K <= N <= M:
r += V[N] * rfact[M-N] % MOD
r *= fact[M]
else:
p = K - 2*M + N - 1
for m in range(max(0, 2*M+1-K), min(N, M)+1):
r += V[m] * rfact[M-m] * rfact[N-m] * rfact[p-N+m] % MOD
r *= fact[M] * fact[p]
r = memo[A] = r % MOD
return r
ans = []
for i in range(2, 2*K+1):
if i <= K:
ans.append(calc(i - 1))
else:
ans.append(calc(2*K - i + 1))
print(*ans, sep='\n')
| 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 = inpl()
MAX = K+N+10
fac = [1]*(MAX+1)
for i in range(1,MAX+1):
fac[i] = (fac[i-1]*i)%mod
gyakugen = [1]*(MAX+1)
gyakugen[MAX] = pow(fac[MAX],mod-2,mod)
for i in range(MAX,0,-1):
gyakugen[i-1] = (gyakugen[i]*i)%mod
def Comb(n,k):#nCk
return (fac[n]*gyakugen[k]*gyakugen[n-k])%mod
#K=k,N=n,0pair = 0
def calc(k,n,i):
#i=2に帰着させる
pairs = (i-2)//2
k -= pairs
n -= pairs
#色々と例外処理
if n < 0 or k <= 0:
return 0
elif k == 1 and n >= 2:
return 0
if n == 0: #球が0個なら1通り
ans = 1
else:
ans = 0
#i=2の時の数え上げ
for x in range(2):
ball = n-x #球
box = k-1 #箱
ans += Comb(box-1+ball,ball)%mod
ans *= pow(2,pairs,mod) #0pairの選び方
return ans % mod
ans = []
for i in range(2,K+2):
if i%2 == 0:
pairs = (i-2)//2
tmp = 0
for p0 in range(pairs+1): #p0 = 0pairの数
tmp1 = calc(K-p0*2 , N , i-p0*2) %mod #k-p0*2,i-p0*2で0pairが0組
tmp2 = Comb(pairs,p0) %mod #0pairの選び方
tmp += tmp1 * tmp2
tmp %= mod
ans.append(tmp)
print(tmp)
ans = ans[::-1]
for i in range(1,K):
print((ans[i]))
| 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])%mod
def f(n,k,i):
if i == 2:
if n < 0 or (k==1 and n>=2): #例外処理
return 0
if n == 0:
ans = 1
else:
ans = Comb(k-2+n,n) + Comb(k-2+n-1,n-1)
return ans % mod
else: #i>2
Sp = i//2-1
ans = 0
for p in range(Sp+1):
ans += g(n,k,i,p)
return ans % mod
def g(n,k,i,p):
Sp = i//2-1
if p == 0:
return f(n-Sp,k-Sp,2) * pow(2,Sp,mod) % mod
else: #p>0
return g(n,k-2*p,i-2*p,0) * Comb(Sp,p)
ans = []
for i in range(2,K+2):
if i%2 == 0:
tmp = f(N,K,i)
ans.append(tmp)
print(tmp)
ans = ans[::-1]
for i in range(1,K):
print((ans[i]))
| 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] = inv
return factorials, invs
def solve_sub(k, n, p, factorials, invs):
"""Number of patterns where any pair(s) of p pairs appear when n dices are rolled"""
ret = 0
for q in range(1, min(p, n // 2) + 1):
# tmp1 = factorials[p + q - 1] * invs[q] * invs[p - 1] % MOD
tmp1 = (factorials[p] * invs[q] % MOD) * invs[p - q] % MOD
tmp2 = (factorials[k + n - 2 * q - 1] * invs[n - 2 * q] % MOD) * invs[k - 1] % MOD
ret += tmp1 * tmp2 * (-1) ** (q - 1)
ret %= MOD
return ret
def solve(k, n):
if k == 1:
return [0]
factorials, invs = prepare(k + n, MOD)
all_patterns_odd = factorials[k + n - 1] * invs[n] * invs[k - 1] % MOD
all_patterns_even0 = factorials[k + n - 2] * invs[n] * invs[k - 2] % MOD
all_patterns_even1 = factorials[k + n - 3] * invs[n - 1] * invs[k - 2] % MOD
# print(all_patterns_even0, all_patterns_even1)
buf = []
for i in range(2, k + 2):
pairs = i // 2 - max(0, i - k - 1)
if i % 2 == 0:
ans = all_patterns_even0 - solve_sub(k - 1, n, pairs - 1, factorials, invs)
# print(solve_sub(k - 1, n, pairs - 1, factorials, invs))
ans += all_patterns_even1 - solve_sub(k - 1, n - 1, pairs - 1, factorials, invs)
# print(solve_sub(k - 1, n - 1, pairs - 1, factorials, invs))
ans %= MOD
else:
ans = (all_patterns_odd - solve_sub(k, n, pairs, factorials, invs)) % MOD
buf.append(ans)
return buf
MOD = 998244353
k, n = list(map(int, input().split()))
ans = solve(k, n)
print(('\n'.join(map(str, ans))))
print(('\n'.join(map(str, ans[-2::-1]))))
| 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] = inv
return factorials, invs
def solve_sub(k, n, p, factorials, invs):
"""Number of patterns where any pair(s) of p pairs appear when n dices are rolled"""
ret = 0
fp, ik = factorials[p], invs[k - 1]
for q in range(1, min(p, n // 2) + 1):
# tmp1 = factorials[p + q - 1] * invs[q] * invs[p - 1] % MOD
tmp1 = (fp * invs[q] % MOD) * invs[p - q] % MOD
tmp2 = (factorials[k + n - 2 * q - 1] * invs[n - 2 * q] % MOD) * ik % MOD
if q % 2 == 1:
ret += tmp1 * tmp2
else:
ret -= tmp1 * tmp2
ret %= MOD
return ret
def solve(k, n):
if k == 1:
return [0]
factorials, invs = prepare(k + n, MOD)
all_patterns_odd = factorials[k + n - 1] * invs[n] * invs[k - 1] % MOD
all_patterns_even0 = factorials[k + n - 2] * invs[n] * invs[k - 2] % MOD
all_patterns_even1 = factorials[k + n - 3] * invs[n - 1] * invs[k - 2] % MOD
buf = []
for i in range(2, k + 2):
pairs = i // 2 - max(0, i - k - 1)
if i % 2 == 0:
ans = all_patterns_even0 - solve_sub(k - 1, n, pairs - 1, factorials, invs)
ans += all_patterns_even1 - solve_sub(k - 1, n - 1, pairs - 1, factorials, invs)
ans %= MOD
else:
ans = (all_patterns_odd - solve_sub(k, n, pairs, factorials, invs)) % MOD
buf.append(ans)
return buf
MOD = 998244353
k, n = list(map(int, input().split()))
ans = solve(k, n)
print(('\n'.join(map(str, ans))))
print(('\n'.join(map(str, ans[-2::-1]))))
| 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] = inv
return factorials, invs
def solve_sub(k, n, p, factorials, invs):
"""Number of patterns where any pair(s) of p pairs appear when n dices are rolled"""
ret = 0
fp, ik = factorials[p], invs[k - 1]
for q in range(1, min(p, n // 2) + 1):
# tmp1 = factorials[p + q - 1] * invs[q] * invs[p - 1] % MOD
tmp1 = (fp * invs[q] % MOD) * invs[p - q] % MOD
tmp2 = (factorials[k + n - 2 * q - 1] * invs[n - 2 * q] % MOD) * ik % MOD
if q % 2 == 1:
ret += tmp1 * tmp2
else:
ret -= tmp1 * tmp2
ret %= MOD
return ret
def solve(k, n):
if k == 1:
return [0]
factorials, invs = prepare(k + n, MOD)
all_patterns_odd = factorials[k + n - 1] * invs[n] * invs[k - 1] % MOD
all_patterns_even0 = factorials[k + n - 2] * invs[n] * invs[k - 2] % MOD
all_patterns_even1 = factorials[k + n - 3] * invs[n - 1] * invs[k - 2] % MOD
buf = []
for i in range(2, k + 2):
pairs = i // 2 - max(0, i - k - 1)
if i % 2 == 0:
ans = all_patterns_even0 - solve_sub(k - 1, n, pairs - 1, factorials, invs)
ans += all_patterns_even1 - solve_sub(k - 1, n - 1, pairs - 1, factorials, invs)
ans %= MOD
else:
ans = (all_patterns_odd - solve_sub(k, n, pairs, factorials, invs)) % MOD
buf.append(ans)
return buf
MOD = 998244353
k, n = list(map(int, input().split()))
ans = solve(k, n)
print(('\n'.join(map(str, ans))))
print(('\n'.join(map(str, ans[-2::-1]))))
| 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, 1, -1):
inv *= m
inv %= MOD
invs[m - 1] = inv
return factorials, invs
def solve(p):
"""Number of patterns where no pair of p appears when n dices are rolled"""
if cache[p] > -1:
return cache[p]
ret = 0
fp = factorials[p]
for q in range(1, min(p, n // 2) + 1):
tmp1 = (fp * invs[q] % MOD) * invs[p - q] % MOD
tmp2 = (factorials[k + n - 2 * q - 1] * invs[n - 2 * q] % MOD) * ik % MOD
if q % 2 == 1:
ret += tmp1 * tmp2
else:
ret -= tmp1 * tmp2
ret %= MOD
cache[p] = ret = (all_patterns - ret) % MOD
return ret
factorials, invs = get_factorials(k + n)
ik = invs[k - 1]
all_patterns = factorials[k + n - 1] * invs[n] * ik % MOD
cache = [-1] * (k // 2 + 2)
return solve
MOD = 998244353
k, n = list(map(int, input().split()))
if k == 1:
print((0))
else:
solve = prepare(k, n, MOD)
ans = [solve(i // 2 - max(0, i - k - 1)) for i in range(2, k + 2)]
print(('\n'.join(map(str, ans))))
print(('\n'.join(map(str, ans[-2::-1]))))
| 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
fact = [1] * MAXN
for i in range(1, MAXN): fact[i] = (fact[i-1] * i) % MOD
invfact = [0] * MAXN; invfact[-1] = pow(fact[-1], MOD-2, MOD)
for i in range(MAXN-2, -1, -1): invfact[i] = invfact[i+1] * (i+1) % MOD
def comb(n, k):
return fact[n] * invfact[n-k] * invfact[k] % MOD if 0 <= k <= n else 0
def h(n, k):
return comb(n+k-1, n) if k >= 1 else 0
def solve(n, k, u):
ans = 0
for q in range(u+1):
s = 2**(u-q) * h(n-u+q, k-q-u)
# print(n, k, u, q, s)
ans = (ans + comb(u, q) * pow(2, u-q, MOD) % MOD * h(n-u+q, k-q-u)) % MOD
return ans
for i in range(2, 2*K+1):
u = sum(j < i-j <= K for j in range(1, K+1))
if i % 2 == 1:
ans = solve(N, K, u)
else:
ans = (solve(N, K-1, u) + solve(N-1, K-1, u)) % MOD
print(ans) | 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
fact = [1] * MAXN
for i in range(1, MAXN): fact[i] = (fact[i-1] * i) % MOD
invfact = [0] * MAXN; invfact[-1] = pow(fact[-1], MOD-2, MOD)
for i in range(MAXN-2, -1, -1): invfact[i] = invfact[i+1] * (i+1) % MOD
def comb(n, k):
return fact[n] * invfact[n-k] * invfact[k] % MOD if 0 <= k <= n else 0
def h(n, k):
return comb(n+k-1, n)
def solve(n, k, u):
ans = 0
for q in range(u+1):
ans = (ans + comb(u, q) * pow(2, u-q, MOD) % MOD * h(n-u+q, k-q-u)) % MOD
return ans
anss = [0] * (2*K+1)
for i in range(2, K+2):
u = sum(j < i-j <= K for j in range(1, K+1))
if i % 2 == 1:
ans = solve(N, K, u)
else:
ans = (solve(N, K-1, u) + solve(N-1, K-1, u)) % MOD
anss[i] = ans
print(ans)
for j in range(K+2, 2*K+1):
print((anss[2*K - j + 2]))
| 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-2,p)*power_func(c,p-2,p))%p
com[n][k] = yey
return yey
def power_func(a,b,p):
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
return d*d %p
if b%2==1:
return (a*power_func(a,b-1,p ))%p
com = [[-1] *4050 for i in range(4050)]
for i in range(2,2*k+1):
ans = 0
if i %2 == 1:
pp = (i+1)//2
pm = i - pp
p = min(k-pp+1,pm)
for q in range(p+1):
sen = comb(p,q,mod)*power_func(2,q,mod)%mod
if n - q<0:
continue
r = k-p*2
if r <0:
r = 0
ans += sen* comb(n+r-1,n-q,mod)%mod
print((ans%mod))
else:
pp = i//2 +1
pm = i//2 -1
p = min(k-pp+1,pm)
for q in range(p+1):
sen = comb(p,q,mod)*power_func(2,q,mod)%mod
if n - q<0:
continue
r = k-p*2-1
if r <0:
r = 0
ans += sen* comb(n+r-1,n-q,mod)%mod
for q in range(p+1):
sen = comb(p,q,mod)*power_func(2,q,mod)%mod
if n - q-1<0:
continue
r = k-p*2-1
if r <0:
r = 0
ans += sen* comb(n+r-2,n-q-1,mod)%mod
print((ans%mod)) | 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
if i %2 == 1:
pp = (i+1)//2
pm = i - pp
p = min(k-pp+1,pm)
for q in range(p+1):
sen = comb(p,q,mod)*pow(2,q,mod)%mod
if n - q<0:
break
r = k-p*2
if r <0:
r = 0
if n+r-1 < n-q:
continue
ans += sen* comb(n+r-1,n-q,mod)%mod
kota.append(ans%mod)
else:
pp = i//2 +1
pm = i//2 -1
p = min(k-pp+1,pm)
for q in range(p+1):
sen = comb(p,q,mod)*pow(2,q,mod)%mod
if n - q<0:
break
r = k-p*2-1
if r <0:
r = 0
if n+r-1 < n-q:
continue
ans += sen* comb(n+r-1,n-q,mod)%mod
for q in range(p+1):
sen = comb(p,q,mod)*pow(2,q,mod)%mod
if n - q-1<0:
break
r = k-p*2-1
if r <0:
r = 0
if n+r-2 < n-q-1:
continue
ans += sen* comb(n+r-2,n-q-1,mod)%mod
kota.append(ans%mod)
for i in kota:
print(i)
for i in range(len(kota)-2,-1,-1):
print((kota[i])) | 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)]
frac = [1]
for i in range(N + K):
frac.append(((i+1)*frac[i])%mod)
invf = []
for i in range(N + K + 1):
invf.append(inved(frac[i]))
for k in range(2, K+2):
S = 0
sign = 1
l = k // 2
for m in range(min(l+1, N//2+1)):
prod = (sign * (frac[l]*frac[N+K-2*m-1])) % mod
prod *= (invf[m]*invf[l-m]) % mod
prod %= mod
prod *= (invf[N-2*m] * invf[K-1]) % mod
prod %= mod
S += prod
S %= mod
sign *= -1
X[k-2], X[2*K-k] = S, S
for i in range(2*K-1):
print((X[i])) | 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)*frac[i])%mod)
invf = []
for i in range(N + K + 1):
invf.append(inved(frac[i]))
for k in range(2, K+2):
S = 0
sign = 1
l = k // 2
for m in range(min(l+1, N//2+1)):
prod = (sign * (frac[l]*frac[N+K-2*m-1])) % mod
prod *= (invf[m]*invf[l-m]) % mod
prod %= mod
prod *= (invf[N-2*m] * invf[K-1]) % mod
prod %= mod
S += prod
S %= mod
sign *= -1
X[k-2], X[2*K-k] = S, S
for i in range(2*K-1):
print((X[i])) | 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)
while all(map(fail, combinations(r, n))):
n -= 1
print(n)
| 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 all(map(fail, list(map(set, combinations(r, n))))):
n -= 1
print(n)
| 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)
while all(map(fail, list(map(set, combinations(r, n))))):
n -= 1
print(n)
| 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 all(map(fail, list(map(set, combinations(r, n))))):
n -= 1
print(n)
| 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, l + 1):
if all(a[i][0] & x == a[i][1] & l - x == 0 for i in r if x >> i & 1):
m = max(m, popcount(x))
print(m)
| 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(popcount, list(range(1, l + 1))))
ans = next((i for i, x in reversed(b)
if all(a[j][0] & x == a[j][1] & l - x == 0 for j in r if x >> j & 1)), 0)
print(ans)
| 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(popcount, list(range(1, l + 1))))
ans = next((i for i, x in reversed(b)
if all(a[j][0] & x == a[j][1] & l - x == 0 for j in r if x >> j & 1)), 0)
print(ans)
| 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))
if all(a[j][0].isdisjoint(x) and a[j][1] < x for j in x))
print(r)
| 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))
if all(a[j][0].isdisjoint(x) and a[j][1].issubset(x) for j in x))
print(r)
| 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))
if all(a[j][0].isdisjoint(x) and a[j][1] < x for j in x))
print(r)
| 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:
true_info[x-1] = info[x-1]
# pprint(info[j])
p_info[j] = 1
# print("p_info")
# pprint(p_info)
# print("true_info")
# pprint(true_info)
flag = True
for _, info_list in list(true_info.items()):
for x, y in info_list:
if p_info[x-1] != y:
flag = False
break
if not flag:
break
if flag:
# pprint(true_info)
ans = max(ans, sum(p_info))
print(ans)
if __name__ == '__main__':
n = int(sys.stdin.readline().strip())
info = []
for i in range(n):
a = int(sys.stdin.readline().strip())
info.append([])
for _ in range(a):
x, y = list(map(int, sys.stdin.readline().strip().split(" ")))
info[i].append((x, y))
# pprint(info)
solve(n, info) | 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
# print("p_info")
# pprint(p_info)
# print("true_info")
# pprint(true_info)
flag = True
for _, info_list in list(true_info.items()):
for x, y in info_list:
if p_info[x-1] != y:
flag = False
break
if not flag:
break
if flag:
# pprint(true_info)
ans = max(ans, sum(p_info))
print(ans)
if __name__ == '__main__':
n = int(sys.stdin.readline().strip())
info = []
for i in range(n):
a = int(sys.stdin.readline().strip())
info.append([])
for _ in range(a):
x, y = list(map(int, sys.stdin.readline().strip().split(" ")))
info[i].append((x, y))
# pprint(info)
solve(n, info) | 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
break
if cnt==0:
ans = max(ans,bin(i).count("1"))
print(ans) | 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:
ans = max(ans,bin(i).count("1"))
print(ans) | 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 = (N - len(str(bin(i))[2:]))*["0"] + list(bin(i))[2:]
for j, man in enumerate(bin_i):
if man == "0":
continue
for x, y in claim[j]:
if bin_i[int(x)-1] != y:
flag = False
if flag:
count = 0
for b in bin_i:
if b=="1":
count+=1
maximam = max(maximam,count)
print(count) | 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 = True
count = 0
for i in range(N):
if bit & (1<<i):
count+=1
for x, y in claim[i]:
if (bit & (1<<(x-1)) and y==0) or (not (bit & (1<<(x-1))) and y==1):
flag = False
if flag:
maximam = max(maximam,count)
print(maximam) | 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 in list(itertools.product([0, 1], repeat=n)):
bl = True
for i,a in enumerate(l):
if a == 1:
for b in xy[i]:
if l[b[0] - 1] != b[1]:
bl = False
if bl:
ans = max(ans, sum(l))
print(ans) | 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 in sorted(itertools.product([0, 1], repeat=n),reverse=True):
bl = True
for i, a in enumerate(l):
if a == 1:
for b in xy[i]:
if l[b[0] - 1] != b[1]:
bl = False
break
if bl:
print((sum(l)))
exit()
print('0') | 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
for j in range(N):
if (i >> j) & 1:
pt[N - j - 1] = 1
for k in range(N): # k人目が正直者の場合チェック
if pt[k] == 1:
for l in range(A[k]):
if XY[k][l][1] != pt[XY[k][l][0] - 1]:
ck = 0
if ck == 1:
honest_count.append(sum(pt))
print((max(honest_count))) | 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]] != ll[2]:
break
else:
ans = max(ans, sum(p))
print(ans)
| 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(chk)
answer = 0
for i in range(2**n):
b = format(i,'b')
b = b.zfill(n)[::-1]
chk_0 = set()
chk_1 = set()
p = []
for j in range(n):
if b[j] == '1':
p.append(j)
chk_1.add(j)
if b[j] == '0':
chk_0.add(j)
for i in p:
if not chk[i][0] <= chk_0:
break
if not chk[i][1] <= chk_1:
break
if i == p[len(p)-1]:
answer = max(answer,len(p))
print(answer) | 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]:
if (i >> (person_state[0]-1) & 1) != person_state[1]:
flag = 1 #矛盾が生じるとflagを立てる
break
if flag == 0:
honest += [bin(i)[2:].count("1")]
print((max(honest))) | 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 range(1 << N):
h = set()
u = set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
else:
u.add(j+1)
b = True
for k in list(h):
k -= 1
h |= A[k][1]
u |= A[k][0]
if h & u:
b = False
if b:
ans = max(ans, bin(i).count("1"))
print(ans)
if __name__ == '__main__':
main()
| 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 range(1 << N):
h = set()
u = set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
else:
u.add(j+1)
b = True
for k in list(h):
k -= 1
h |= A[k][1]
u |= A[k][0]
if h & u:
b = False
break
if b:
ans = max(ans, bin(i).count("1"))
print(ans)
if __name__ == '__main__':
main()
| 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 range(1 << N):
h, u = set(), set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
else:
u.add(j+1)
for k in list(h):
h |= A[k-1][1]
u |= A[k-1][0]
if not (h & u):
ans = max(ans, bin(i).count("1"))
print(ans)
if __name__ == '__main__':
main()
| 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 range(1 << N):
h, u = set(), set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
h |= A[j][1]
u |= A[j][0]
else:
u.add(j+1)
if not (h & u):
ans = max(ans, bin(i).count("1"))
print(ans)
if __name__ == '__main__':
main()
| 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 range(1 << N):
h, u = set(), set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
h |= A[j][1]
u |= A[j][0]
else:
u.add(j+1)
if not (h & u):
ans = max(ans, bin(i).count("1"))
print(ans)
if __name__ == '__main__':
main()
| 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 range(1 << N):
h, u = set(), set()
for j in range(N):
if (i >> j) & 1:
h.add(j+1)
h |= A[j][1]
u |= A[j][0]
else:
u.add(j+1)
if not (h & u):
ans = max(ans, len(h))
print(ans)
if __name__ == '__main__':
main()
| 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()))
testimonies[i][x] = y
for cnt_honest in range(N, 0, -1):
for honest_people in combinations(list(range(1, N + 1)), cnt_honest):
honest_people = set(honest_people)
is_consistent = True
for i in honest_people:
for x, y in list(testimonies[i].items()):
if (x in honest_people and not y) or (x not in honest_people and y):
is_consistent = False
break
if not is_consistent:
break
if is_consistent:
print(cnt_honest)
return
print((0))
if __name__ == "__main__":
main()
| # 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()))
testimonies[i].append((x, y))
for cnt_honest in range(N, 0, -1):
for honest_people in combinations(list(range(1, N + 1)), cnt_honest):
honest_people = set(honest_people)
is_consistent = True
for i in honest_people:
for x, y in testimonies[i]:
if (x in honest_people and not y) or (x not in honest_people and y):
is_consistent = False
break
if not is_consistent:
break
if is_consistent:
print(cnt_honest)
return
print((0))
if __name__ == "__main__":
main() | 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 in range(N):
if pattern[i]: # iさんが正直と仮定
# 発言と一致するか？
for a in range(A[i]):
if pattern[XY[i][a][0]-1] != XY[i][a][1]:
flag = False
break
if flag:
ans = max(ans, sum(pattern))
print(ans) | 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 XY[i]:
if (bit >> (x-1)) & 1 != y:
flag = False
break
if flag:
ans = max(ans, honest_cnt)
print(ans) | 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
#bit全探索
for i in range(1<<N):
honest_kamo=[]
for j in range(N):
if(i>>j)&1:
honest_kamo.append(j)
liar_kamo=[c for c in range(N)]
liar_kamo=list(set(liar_kamo)-set(honest_kamo))
#print("honest_kamo:",honest_kamo)
#print("liar_kamo:",liar_kamo)
flag=True
for i in honest_kamo:
for j in range(A[i]):
if Y[i][j]==1:
if X[i][j]-1 in liar_kamo:
flag=False
elif Y[i][j]==0:
if X[i][j]-1 in honest_kamo:
flag=False
#print(flag)
if flag:
max_nin=max(max_nin,len(honest_kamo))
print(max_nin) | 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(xy)
res=0
for i in range(1<<n):
output=[]
for j in range(n):
if(i>>j)&1:
output.append(j)
flag=True
for p in output:
num_p=nums[p]
shogen_p=shogen[p]
for j in range(num_p):
if shogen_p[j][1]==1:
if shogen_p[j][0]-1 in output:
pass
else:
flag=False
break
else:
if shogen_p[j][0]-1 in output:
flag=False
break
else:
pass
if flag==False:
break
else:
res=max(res,len(output))
print(res)
if __name__=="__main__":
main() | 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):
if (1<<j) & i:
for k in range(len(path[j])):
if path[j][k][1] != int(bin(i)[-path[j][k][0] - 1]):
judge = False
if judge:
if ans < bin(i).count("1") - 1:
ans = bin(i).count("1") - 1
print(ans) | 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):
if not judge:
break
if (1<<j) & i:
for k in range(len(path[j])):
if path[j][k][1] != int(bin(i)[-path[j][k][0] - 1]):
judge = False
break
if judge:
if ans < bin(i).count("1") - 1:
ans = bin(i).count("1") - 1
print(ans) | 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, lb = list(zip(*sorted(zip(lc, lb), reverse=True)))
lb = [[int(j) for j in i] for i in lb]
for l in lb:
ok = 1
for i in range(n):
a = la[i]
for j in range(a):
x, y = lxy[i][j]
if l[i] == 1 and l[x-1] != y:
ok = 0
break
if ok:
print((sum(int(k) for k in l)))
break
else:
print((0)) | 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 = [sum(int(j) for j in i) for i in lb]
lc, lb = list(zip(*sorted(zip(lc, lb), reverse=True)))
lb = [[int(j) for j in i] for i in lb]
for l in lb:
ok = 1
for i in range(n):
a = la[i]
for j in range(a):
x, y = lxy[i][j]
if l[i] == 1 and l[x-1] != y:
ok = 0
break
if ok:
print((sum(int(k) for k in l)))
break
else:
print((0)) | 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
else: a=max(a,t)
print(a) | 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
while temp != 0:
if 1 & temp:
check[cnt2] = 1
temp >>= 1
cnt2 += 1
for i in range(N):
if check[i] == 1:
for x, y in XY[i]:
if check[x - 1] != y:
contradict = True
break
if contradict:
break
if not contradict:
cnt1 = 0
for i in range(N):
if check[i] is not None and check[i] == 1:
cnt1 += 1
max_honest = max(max_honest, cnt1)
print(max_honest)
| 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 != 0:
if 1 & c:
check[cnt1] = 1
c >>= 1
cnt1 += 1
for i in range(N):
if check[i] == 1:
for x, y in XY[i]:
if check[x - 1] != y:
contradict = True
break
if contradict:
break
if not contradict:
max_honest = max(max_honest, sum(check))
print(max_honest)
| 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):
if(i>>j)&1 == 1:
for x,y in testimony[j]:#3次元リストからx,yを取り出す書きかた 覚える
if (i>>x)&1 != y: #正直といっているがそうではない と 嘘つきといっているがそうではない の二つ同時
flag =1
break
if flag == 0:
honest = max(honest, bin(i)[2:].count('1'))# bin()で二進数に変換 最初の二文字は0bで取り除く count('1')で数える
print(honest)
| 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,y in testimony[j]:
if (i>>(x-1))&1 != y:
flag = False
break
if flag:
honest = max(honest, bin(i)[2:].count('1'))
print(honest)
| 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) == (0, 1):
return False
elif (a, b) == (-1, 0):
new_list.append(0)
else:
new_list.append(max(a, b))
return new_list
remarks = []
for i in range(n):
a = int(eval(input()))
r = [tuple(map(int, input().split())) for _ in range(a)]
remarks.append(make_remark_list(i, r))
def max_count(r, cnt, i = 0):
tmp = r
for j, r_j in enumerate(remarks):
if j < i: continue
if tmp[j] == 0:
continue
elif tmp[j] == 1:
if check(tmp, r_j):
tmp = check(tmp, r_j)
cnt += 1
else:
cnt = 0
break
else:
tmp[j] = 1
if check(tmp, r_j):
cnt_1, tmp_1 = max_count(tmp, cnt, j)
tmp[j] = 0
cnt_0, tmp_0 = max_count(tmp, cnt, j)
if cnt_0 > cnt_1:
return cnt_0, tmp_0
else:
return cnt_1, tmp_1
else:
tmp[j] = 0
return cnt, tmp
r = [-1] * n
cnt, r = max_count(r, 0)
print(cnt) | 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
for i, j in x:
r[i - 1] = j
remarks.append(r)
for r in range(2 ** n):
r = list(bin(r)[2:].zfill(n))
r = [int(i) for i in r[:]]
cnt = 0
for i in range(n):
if r[i] == 1:
flag = check(r, remarks[i])
cnt += 1
if not flag:
cnt = 0
break
cnt_max = max(cnt, cnt_max)
print(cnt_max) | 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().rstrip().split()))
tes[i][x-1] = y #ここまでが入力
cnt = 0
for i in range(2**N):
hon = [0]*N
for j in range(N):
if (i>>j)&1:
hon[j] = 1 #全状態2**N通りを作っておく
flag = True
for j in range(N):
if hon[j]: #hon=1ならtesとの整合性を比較
for k in range(N):
if tes[j][k] == -1:
continue #証言されていない部分は飛ばす
if tes[j][k] != hon[k]:
flag = False
if flag:
cnt = max(cnt,hon.count(1))
print(cnt) | #!/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().rstrip().split()))
tes[i][x-1] = y
cnt = 0
for i in range(2**N):
hon = [0]*N
for j in range(N):
if (i>>j)&1:
hon[j] = 1
flag = True
for j in range(N):
if hon[j]:
for k in range(N):
if tes[j][k] == -1:
continue
if tes[j][k] != hon[k]:
flag = False
break
if not flag:
break
if flag:
cnt = max(cnt,hon.count(1))
print(cnt) | 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().rstrip().split()))
tes[i][x-1] = y
cnt = 0
for i in range(2**N):
hon = [0]*N
for j in range(N):
if (i>>j)&1:
hon[j] = 1
flag = True
for j in range(N):
if hon[j]:
for k in range(N):
if tes[j][k] == -1:
continue
if tes[j][k] != hon[k]:
flag = False
break
if not flag:
break
if flag:
cnt = max(cnt,hon.count(1))
print(cnt) | #!/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().rstrip().split()))
tes[i][x-1] = y
cnt = 0
for i in range(2**N):
hon = [0]*N
for j in range(N):
if (i>>j)&1:
hon[j] = 1
flag = True
for j in range(N):
if not flag:
break
if hon[j]:
for k in range(N):
if tes[j][k] == -1:
continue
if tes[j][k] != hon[k]:
flag = False
break
if flag:
cnt = max(cnt,hon.count(1))
print(cnt) | 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().rstrip().split()))
tes[i][x-1] = y
cnt = 0
for i in range(2**N):
hon = [0]*N
for j in range(N):
if (i>>j)&1:
hon[j] = 1
flag = True
for j in range(N):
if not flag:
break
if hon[j]:
for k in range(N):
if tes[j][k] == -1:
continue
if tes[j][k] != hon[k]:
flag = False
break
if flag:
cnt = max(cnt,hon.count(1))
print(cnt) | #!/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().rstrip().split()))
tes[i].append((x-1,y))
cnt = 0
for i in range(2**N):
flag = True
for j in range(N):
if (i>>j)&1 == 1:
for x,y in tes[j]:
if (i>>x)&1 != y:
flag = False
break
if flag:
cnt = max(cnt,bin(i)[2:].count("1"))
print(cnt) | 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):
ONT = 0
for j in range(N):
if not (i & 1<<j):
continue
ONT += 1
for x, y in STATE[j]:
if (y==0) ^ (i>>(x-1) & 1) == 0:
return 0
return ONT
if __name__ == '__main__':
main() | 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):
if not (i>>j & 1):
continue
CNT += 1
for x, y in R[j]:
if y == 1 and (i>>(x-1) & 1):
continue
elif y == 0 and (not (i>>(x-1) & 1)):
continue
else:
CNT = 0
break
else:
continue
break
ans = max(ans, CNT)
print(ans)
if __name__ == '__main__':
main() | 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
ok = True
for i in range(n):
if x[i] == 1 and i + 1 in d:
for y in d[i + 1]:
if tmp[y[0] - 1] == -1:
tmp[y[0] - 1] = y[1]
elif tmp[y[0] - 1] != y[1]:
ok = False
break
if not ok:
break
if ok and all(a == b or b == -1 for a, b in zip(x, tmp)):
ret = max(ret, sum(x))
print(ret) | 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 i in range(n):
if x[i] == 0 or i + 1 not in d:
continue
for p, tf in d[i + 1]:
if x[p - 1] != tf:
ok = False
break
if not ok:
break
if ok:
ret = max(ret, sum(x))
print(ret) | 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): #bit全探索
for j in range(n):
if((i>>j)&1):
honest[j] = 1
else:
honest[j] = 0
f = True
for k in range(n):
for l in range(a[k]):
if(honest[k]==1 and y[k][l]!=honest[x[k][l]]):
f = False
break
if f:
ans = max(ans,honest.count(1))
print(ans) | 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 range(2**n): #bit全探索
for j in range(n):
if((i>>j)&1):
honest[j] = 1
cnt+=1
else:
honest[j] = 0
f = True
for k in range(n):
if honest[k]!=1:
continue
for l in range(a[k]):
if y[k][l]!=honest[x[k][l]]:
f = False
break
if f:
ans = max(ans,cnt)
cnt=0
print(ans) | 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 (i >> j) & 1:
cnt += 1
temp[j] = 1
else:
temp[j] = 0
flag = True
for j in range(n):
if (i >> j) & 1:
for x, y in X[j]:
if temp[x] != y:
flag = False
if flag:
ans = max(ans, cnt)
print(ans)
| 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) & 1:
temp[j] = 1
else:
temp[j] = 0
flag = True
for j in range(n):
if temp[j] == 1:
for x, y in g[j]:
if temp[x] != y:
flag = False
if flag:
ans = max(ans, sum(temp))
print(ans)
| 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 range(pow(2, n)):
judge = True
cnt = 0
for i in range(n):
if (k >> i) & 1 == 1:
for e in t[i]:
if (k >> e) & 1 == 0:
judge = False
for e in s[i]:
if (k >> e) & 1 == 1:
judge = False
cnt += 1
if judge:
res = max(res, cnt)
print(res) | 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 i in range(n):
if k[i] == 1:
for l, m in lis[i]:
if k[l] != m:
return False
return True
res = 0
for k in val:
if honesty(k, lis, n):
res = max(res, sum(k))
print(res)
| 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 Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
ans = 0
lst = [[] for _ in range(n)]
for i in range(n):
a = I()
for j in range(a):
x,y = LI()
lst[i].append((x-1,y))
for i in range(2**n):
b = [0]*n
for j in range(n):
if (i >> j) & 1:
b[j] = 1
flg = True
for j in range(n):
if b[j] == 0:
continue
for k,l in lst[j]:
if l == 0:
if b[k] == 1:
flg = False
break
else:
if b[k] == 0:
flg = False
break
if not flg:
break
else:
ans = max(ans,sum(b))
print(ans)
| #!/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 collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
ans = 0
info = [[] for _ in range(n)]
for i in range(n):
a = I()
for _ in range(a):
x, y = LI()
info[i].append((x-1, y))
for i in range(1, 1 << n):
ret = 0
for j in range(n):
if i >> j & 1:
ret += 1
for x, y in info[j]:
if y == 0 and i >> x & 1:
break
elif y == 1 and not i >> x & 1:
break
else:
continue
break
else:
ans = max(ans, ret)
print(ans)
| 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] == y for x, y in xy[i]):
break
else:
ans = max(ans, sum(l))
print(ans) | 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] != y for x, y in xy[i]):
break
else:
ans = max(ans, sum(bit))
print(ans)
| 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
if f:ans=max(ans,s.count("1"))
print(ans) | 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 and syojiki[j]==1:flag=False
if flag:
ans=max(ans,syojiki.count(1))
print(ans) | 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').zfill(n)
if i_bin.count('1') <= max_v:
continue
is_true = True
for j in range(n):
if i_bin[j] == '1':
for k in remarks[j]:
if int(i_bin[k[0]-1]) != k[1]:
is_true = False
break
if is_true == False:
break
if is_true:
max_v = max(max_v, i_bin.count('1'))
print(max_v)
if __name__ == '__main__':
main()
| 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):
i_bin = format(i, n_bit)
i_bin_c = i_bin.count('1')
if i_bin_c <= ans:
continue
isTrue = True
for j in range(n):
if i_bin[j] == '0':
continue
for k in said[j]:
if int(i_bin[k[0]-1]) != k[1]:
isTrue = False
break
if not isTrue:
break
if isTrue:
ans = i_bin_c
print(ans)
if __name__ == '__main__':
main()
| 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(hypothesis, testimony_dict):
for witness_num, testimony in list(testimony_dict.items()):
# 仮説上の正直者の証言だけ検証する
if hypothesis[witness_num] == "1":
# 証言を検証
if is_testimony_correct(hypothesis, testimony):
continue
else:
# 証言に誤りがある場合、Falseで抜ける
return False
return True
def main():
N = int(eval(input()))
testimony_dict = defaultdict(dict)
# 証人ごとに証言をdictで保存
for witness_num in range(N):
for j in range(int(eval(input()))):
target, is_honest = list(map(int, input().split()))
testimony_dict[witness_num][target - 1] = is_honest
# 仮説を検証 e.g.'010010' 正直者が2人 (witness_num =1, 4)
max_count = 0
for i in range(1, 2**N):
# 仮説を01で表現
hypothesis = format(i, 'b').zfill(N)
# 仮説が正しい場合のみ、正直者の数でmax_countを更新
if is_hypothesis_correct(hypothesis, testimony_dict):
max_count = max(max_count, hypothesis.count(str("1")))
print(max_count)
if __name__ == '__main__':
main()
| 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(hypothesis, testimony_dict):
for witness_num, testimony in list(testimony_dict.items()):
# 仮説上の正直者の証言だけ検証する
if hypothesis[witness_num] == "1":
# 証言を検証
if is_testimony_correct(hypothesis, testimony):
continue
else:
# 証言に誤りがある場合、Falseで抜ける
return False
return True
def main():
N = int(eval(input()))
testimony_dict = defaultdict(dict)
# 証人ごとに証言をdictで保存
for witness_num in range(N):
for _ in range(int(eval(input()))):
target, is_honest = list(map(int, input().split()))
testimony_dict[witness_num][target - 1] = is_honest
# 仮説を検証 e.g.'010010' 正直者が2人 (witness_num =1, 4)
max_count = 0
for i in range(1, 2**N):
# 仮説を01で表現
hypothesis = format(i, 'b').zfill(N)
# 仮説が正しい場合のみ、正直者の数でmax_countを更新
if is_hypothesis_correct(hypothesis, testimony_dict):
max_count = max(max_count, hypothesis.count(str("1")))
print(max_count)
if __name__ == '__main__':
main() | 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
for j in range(N):
if (i >> j) & 1: #正直者のとき
if check[j] == 0: #矛盾しているとき
flag = False
break
else:
check[j] = 1
# count += 1
for x, y in lst[j]:
if y == 1: #行き先が正直者
if check[x] != 0:
check[x] = 1
else: #矛盾しているとき
flag = False
break
else: #y == 0
if check[x] != 1:
check[x] = 0
else:
flag = False
break
else: #正直者でないとき
if check[j] == 1:
flag = False
break
else:
check[j] = 0
if flag == False:
break
if flag:
tmp = 0
for j in range(N):
if (i >> j) & 1:
tmp += 1
# print (i)
# print (check, flag)
ans = max(ans, tmp)
print (ans)
# print (lst) | 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 range(2 ** N):
count = 0
flag = True
for j in range(N):
if (i >> j) & 1: #正直者の時、証言を確認する
for x, y in lst[j]:
if y == 1:
if (i >> (x - 1)) & 1:
continue
else:
pass
if y == 0:
if (i >> (x - 1)) & 1:
pass
else:
continue
flag = False
break
count += 1
if not flag:
break
if flag:
ans = max(ans, count)
print (ans)
| 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.append(d)
# print(x)
ans = 0
for case in list(product([0,1], repeat=N)):
# print(case)
flg = [-1] * N
cond = True
for i in range(N):
if not cond:
continue
if case[i] == 0:
continue
for a in range(A[i]):
c, d = x[i][a]
c = c-1
# print(c, d)
if case[c] != d:
cond = False
# print('矛盾')
if cond:
ans = max(ans, sum(case))
print(ans)
| # -*- 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.append(d)
ans = 0
# for case in list(product([0,1], repeat=N)):
for m in range(2**N):
# print(case)
flg = [-1] * N
cond = True
for i in range(N):
if not cond:
continue
if m >> i & 1 == 0:
continue
for a in range(A[i]):
c, d = x[i][a]
c = c-1
# print(c, d)
if m >> c & 1 != d:
cond = False
# print('矛盾')
if cond:
# ans = max(ans, sum(case))
ans = max(ans, bin(m).count('1'))
print(ans)
| 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) & 1):
if j + 1 in liar:
break
elif j + 1 not in honest:
honest += [j + 1]
sugg = l[j]
for k in sugg:
if k[1] == 1:
if k[0] in liar:
break
elif k[0] not in honest:
honest += [k[0]]
else:
if k[0] in honest:
break
elif k[0] not in liar:
liar += [k[0]]
else:
continue
break
else:
if j + 1 in honest:
break
elif j + 1 not in liar:
liar += [j + 1]
else:
if ans < len(honest):
ans = len(honest)
print(ans)
| 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):
if j + 1 in liar:
break
elif j + 1 not in honest:
honest += [j + 1]
sug_tmp = sug[j]
for sug_ in sug_tmp:
if sug_[1] == 1:
if sug_[0] in liar:
break
elif sug_[0] not in honest:
honest += [sug_[0]]
else:
if sug_[0] in honest:
break
elif sug_[0] not in liar:
liar += [sug_[0]]
else:
continue
break
else:
if j + 1 in honest:
break
elif j + 1 not in liar:
liar += [j + 1]
else:
if ans < len(honest):
ans = len(honest)
print(ans)
| 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}'
bin_str = pattern.format(i)
# print(bin_str)
all_ok = True # すべての人の証言に矛盾がない
total_honesty = 0
for j in range(n):
shogen = s[j]
if bin_str[j] == '1':
total_honesty += 1
# 正直者とした場合
for k in range(len(shogen)):
x, y = shogen[k]
x -= 1
if int(bin_str[x]) != y:
all_ok = False
break
if all_ok:
if ans < total_honesty:
ans = total_honesty
print(ans)
| 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 = True
for j in range(n):
# 人j が正直者かどうか
#print('j : {}'.format(j))
if i & (1 << j):
# print(j)
# 正直者であれば証言に矛盾があってはいけない
s = sl[j]
for k in range(len(s)):
target = s[k][0]
kind = s[k][1]
# print('target {} : kind {}'.format(target, kind))
#print(target, kind, i & (1 << (target-1)), bool(i & (1 << (target-1))), bool(kind))
rk = 1 if (i & (1 << (target-1))) > 0 else 0
if rk != kind :
#print('証言NG')
# 証言がNG
all_ok = False
break
if not all_ok:
break
else:
# すべての正直者に矛盾がないパターン
#print('ok', bin(i))
ans = max(ans, bin(i).count('1'))
#print(sl)
print(ans) | 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):
if i[x] == 1:
for g in data[x]:
if i[g[0]] != g[1]:
h = False
if h == False:
break
if h == True:
ans = max(ans, sum(list(i)))
print(ans) | 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 and i[g[1]] != g[2]:
s = 0
break
ans = max(ans, s)
print(ans) | 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 in data:
if i[g[0]] == 1 and i[g[1]] != g[2]:
s = 0
break
ans = max(ans, s)
print(ans) | 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))
for g in data:
if i[g[0]] == 1 and i[g[1]] != g[2]:
s = 0
break
ans = max(ans, s)
print(ans) | 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 = ', truth)
if truth == 1 and y == 0:
return False
elif truth == 0 and y == 1:
return False
return True
n = int(eval(input()))
xy = []
for i1 in range(n):
ai = int(eval(input()))
xy.append([])
for i2 in range(ai):
xi,yi = list(map(int, input().split()))
xy[i1].append((xi, yi))
#print(xy)
result = 0
for k in reversed(list(range(1 << n))):
#print(bin(k))
if dudge(k):
#print(' True')
#l = [i for i in range(n) if (k >> i) % 2 == 1]
cnt = 0
for i in range(n):
if (k >> i) % 2 == 1: cnt += 1
#print(' ', l, len(l))
#result = max(result, len(l))
result = max(result, cnt)
print(result)
| 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 = ', truth)
if truth == 1 and y == 0:
return False
elif truth == 0 and y == 1:
return False
return True
n = int(eval(input()))
xy = []
for i1 in range(n):
ai = int(eval(input()))
xy.append([])
for i2 in range(ai):
xi,yi = list(map(int, input().split()))
xy[i1].append((xi, yi))
#print(xy)
result = 0
for k in reversed(list(range(1 << n))):
#print(bin(k))
if dudge(k):
#print(' True')
l = [i for i in range(n) if (k >> i) % 2 == 1]
cnt = 0
#for i in range(n):
# if (k >> i) % 2 == 1: cnt += 1
#print(' ', l, len(l))
result = max(result, len(l))
#result = max(result, cnt)
print(result)
| 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 = ', truth)
if truth == 1 and y == 0:
return False
elif truth == 0 and y == 1:
return False
return True
n = int(eval(input()))
xy = []
for i1 in range(n):
ai = int(eval(input()))
xy.append([])
for i2 in range(ai):
xi,yi = list(map(int, input().split()))
xy[i1].append((xi, yi))
#print(xy)
result = 0
for k in reversed(list(range(1 << n))):
#print(bin(k))
if dudge(k):
#print(' True')
l = [i for i in range(n) if (k >> i) % 2 == 1]
cnt = 0
#for i in range(n):
# if (k >> i) % 2 == 1: cnt += 1
#print(' ', l, len(l))
result = max(result, len(l))
#result = max(result, cnt)
print(result)
| 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 == 1:
return False
return True
n = int(eval(input()))
xy = []
for i1 in range(n):
ai = int(eval(input()))
xy.append([])
for i2 in range(ai):
xi,yi = list(map(int, input().split()))
xy[i1].append((xi, yi))
result = 0
for k in range(1 << n):
if dudge(k):
l = [i for i in range(n) if (k >> i) % 2 == 1]
cnt = 0
result = max(result, len(l))
print(result)
| 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
for i in range(n): # 証言者i
if not (honest >> i) & 1: # iが不親切な人なら証言を聞かない
continue
tmp += 1
for j, t in testimony[i]: # iによるjに対する証言t
if (honest >> j) & 1 ^ t: # jに対する仮定とtが食い違えば破綻
break
else:
continue
break
else: # 全ての正直者に話を聞いて破綻が無ければ更新
best = max(best, tmp)
print(best)
| 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(n): # 証言者i
if not (honest >> i) & 1: # iが不親切な人なら証言を聞かない
continue
for j, t in testimony[i]: # iによるjに対する証言t
if (honest >> j) & 1 != t: # jに対する仮定とtが食い違えば破綻
break
else:
continue
break
else: # 全ての正直者に話を聞いて破綻が無ければ更新
best = max(best, bin(honest).count('1'))
print(best)
| 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 int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def roundUp(a, b):
return -(-a // b)
@staticmethod
def toUpperMultiple(a, x):
return Math.roundUp(a, x) * x
@staticmethod
def toLowerMultiple(a, x):
return (a // x) * x
@staticmethod
def nearPow2(n):
if n <= 0:
return 0
if n & (n - 1) == 0:
return n
ret = 1
while(n > 0):
ret <<= 1
n >>= 1
return ret
@staticmethod
def sign(n):
if n == 0:
return 0
if n < 0:
return -1
return 1
@staticmethod
def isPrime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
class PriorityQueue:
def __init__(self, l=[]):
self.__q = l
heapq.heapify(self.__q)
return
def push(self, n):
heapq.heappush(self.__q, n)
return
def pop(self):
return heapq.heappop(self.__q)
MOD = int(1e09) + 7
INF = int(1e15)
def calc(N):
return sum(int(x) for x in str(N))
def main():
# sys.stdin = open("sample.txt")
N = Scanner.int()
G = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
a = Scanner.int()
for _ in range(a):
x, y = Scanner.map_int()
x -= 1
G[i][x] = y
ans = 0
for i in range(1 << N):
V = [0 for _ in range(N)]
for j in range(N):
if (i >> j) & 1:
V[j] = 1
isOk = True
for j in range(N):
for k in range(N):
if V[k] == 0:
continue
if G[k][j] == -1:
continue
if G[k][j] != V[j]:
isOk = False
if isOk:
ans = max(ans, V.count(1))
print(ans)
return
if __name__ == "__main__":
main()
| # -*- 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 int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def roundUp(a, b):
return -(-a // b)
@staticmethod
def toUpperMultiple(a, x):
return Math.roundUp(a, x) * x
@staticmethod
def toLowerMultiple(a, x):
return (a // x) * x
@staticmethod
def nearPow2(n):
if n <= 0:
return 0
if n & (n - 1) == 0:
return n
ret = 1
while(n > 0):
ret <<= 1
n >>= 1
return ret
@staticmethod
def sign(n):
if n == 0:
return 0
if n < 0:
return -1
return 1
@staticmethod
def isPrime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
class PriorityQueue:
def __init__(self, l=[]):
self.__q = l
heapq.heapify(self.__q)
return
def push(self, n):
heapq.heappush(self.__q, n)
return
def pop(self):
return heapq.heappop(self.__q)
sys.setrecursionlimit(1000000)
MOD = int(1e09) + 7
INF = int(1e30)
def main():
# sys.stdin = open("Sample.txt")
N = Scanner.int()
A = [[-1 for _ in range(N)]for _ in range(N)]
for i in range(N):
a = Scanner.int()
for _ in range(a):
x, y = Scanner.map_int()
x -= 1
A[i][x] = y
ans = 0
for i in range(1 << N):
v = [0] * N
for j in range(N):
v[j] = (i >> j) & 1
isOK = True
for j in range(N):
for k in range(N):
if v[k] == 0:
continue
if A[k][j] == -1:
continue
if A[k][j] != v[j]:
isOK = False
if isOK:
ans = max(ans, v.count(1))
print(ans)
return
if __name__ == "__main__":
main()
| 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):
cur = 0
good = True # 矛盾がない
for i in range(N):
if bit & (1 << i):
# 人iは正直者
cur += 1
for j, y in G[i]:
if (bit & (1 << j)) and y == 1:
continue
elif not(bit & (1 << j)) and y == 0:
continue
elif (bit & (1 << j)) and y == 0:
good = False
break
elif not(bit & (1 << j)) and y == 1:
good = False
break
else:
# 人iはうそつき
for j, y in G[i]:
if (bit & (1 << j)) and y == 0:
continue
elif not(bit & (1 << j)) and y == 1:
continue
elif (bit & (1 << j)) and y == 0:
good = False
break
elif not(bit & (1 << j)) and y == 1:
good = False
break
# print(bit, ":", good)
if good:
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| 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):
cur = 0
good = True # 矛盾がない
for i in range(N):
if bit & (1 << i):
# 人iは正直者
cur += 1
for j, y in G[i]:
if (bit & (1 << j)) and y == 0:
good = False
elif not(bit & (1 << j)) and y == 1:
good = False
# print(bit, ":", good)
if good:
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| 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 = True
for j in range(n):
if i & (1 << j) != 0:
for k in l[j]:
if (k[1] == 1) != h[k[0]]:
b = False
break
if not b:
break
if b:
x = 0
for j in range(n):
if i & 1 << j:
x += 1
ans = max(ans,x)
print(ans)
| 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 = True
for j in range(n):
if i & 1 << j:
for k in l[j]:
if (k[1] == 1) != h[k[0]]:
b = False
break
if not b:
break
if b:
ans = max(ans,h.count(True))
print(ans)
| 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().split()))
X_temp.append(x)
Y_temp.append(y)
X.append(X_temp)
Y.append(Y_temp)
for bit in range(1 << N):
for i in range(1 << N):
judge = True
for j in range(N):
if (i >> j) & 1:#もしAjが正直者だったら
for k in range(A[j]):
if (i >> X[j][k]-1) & 1 != Y[j][k]:
judge = False
else:
for k in range(A[j]):
if (i >> X[j][k]-1) & 1 == Y[j][k]:
judge = False
if judge:
res = max(res,digitSum(i))
print(res) | 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().split()))
X_temp.append(x)
Y_temp.append(y)
X.append(X_temp)
Y.append(Y_temp)
for i in range(1 << N):
judge = True
for j in range(N):
if (i >> j) & 1:#もしAjが正直者だったら
for k in range(A[j]):
if (i >> X[j][k]-1) & 1 != Y[j][k]:
judge = False
"""else:#もしAjが不親切ものだったら。不親切者も正しいことをいうこともある。
for k in range(A[j]):#
if (i >> X[j][k]-1) & 1 == Y[j][k]:
judge = False"""
if judge:
res = max(res,digitSum(i))
print(res) | 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 == 0:
continue
for x, y in s[j]:
if (i >> x) & 1 != y:
consistent = False
break
if consistent:
result = max(result, bin(i)[2:].count('1'))
print(result)
| 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):
if (i >> j) & 1 == 0:
continue
for x, y in evidences[j]:
if (i >> x) & 1 != y:
consistent = False
break
if not consistent:
break
if consistent:
result = max(result, bin(i)[2:].count('1'))
print(result)
| 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.append(v)
#print(person_list)
#print(syogen_list)
for bit in range(1 << n):
break_flag = 0
bit_1_cnt = 0
for i in range(n):
if break_flag:
break
if (bit >> i) & 1: #人iが正直
for j in range(len(syogen_list[i])):
if syogen_list[i][j] != ((bit>>(person_list[i][j]-1))&1): #矛盾 ： 正直としているのに証言が食い違えばbreak
break_flag = 1
break
bit_1_cnt += 1
# if j == len(syogen_list[i])-1:
# bit_1_cnt += 1
if break_flag==0 and i==n-1:
ans = max(ans, bit_1_cnt)
#ans = max(ans, bin(bit).count("1"))
print(ans)
| 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.append(v)
#print(person_list)
#print(syogen_list)
for bit in range(1 << n):
break_flag = 0
bit_1_cnt = 0
for i in range(n):
if break_flag:
break
if (bit >> i) & 1: #人iが正直
for j in range(len(syogen_list[i])):
if syogen_list[i][j] != ((bit>>(person_list[i][j]-1))&1): #矛盾 ： 正直としているのに証言が食い違えばbreak
break_flag = 1
break
bit_1_cnt += 1
if break_flag==0 and i==n-1:
ans = max(ans, bit_1_cnt)
print(ans)
| 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:
for x, y in xy[i]:
if bit[x - 1] != y:
f = 1
break
if f == 0:
ans = max(ans, sum(bit))
print(ans)
| 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 range(int(eval(input()))):
xy[i].append(list(map(int, input().split())))
ans = 0
for bit in product([0, 1], repeat=n):
ans = max(ans, solve(bit))
print(ans) | 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
return(ret)
ans = 0
for i in range(1<<n):
ok = True
for j in range(i):
# if jth person may be honest, verify testimony of him.
if (i>>j) & 1 == 1:
for xy in xys[j]:
x, y = xy
if (i>>x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
ans = max(ans, digitsum(i))
print(ans) | 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
return ret
ans = 0
for i in range(1<<n):
ok = True
for j in range(n):
# if jth person may be honest, verify testimony of him.
if (i>>j) & 1 == 1:
for xy in xys[j]:
x, y = xy
if (i>>x) & 1 != y:
ok = False
break
if not ok:
break
if ok:
ans = max(ans, digitsum(i))
print(ans) | 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 j in range(A[i]):
if(int(bin(Truth)[X[i][j][0] + 2]) != X[i][j][1]):
break
else:
continue
Truth += 1
break
else:
ans = sum(list(map(int,list(bin(Truth)[3:]))))
Truth += 1
print(ans) | 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 range(N):
if(int(bin(n)[i + 3]) == 1):
for j in range(A[i]):
if(y[i][j] != int(bin(n)[x[i][j] + 2])):
Flag = 1
break
if(Flag == 1):
break
else:
ans = max(ans, sum(list(map(int,bin(n)[3:]))))
n += 1
print(ans) | 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):
if (mask & (1 << i)) != 0:
for x, y in s:
v = 1 if (mask & (1 << x)) != 0 else 0
if v != y:
can = False
break
if can:
cnt = 0
for i in range(N):
if (mask & (1 << i)) != 0:
cnt += 1
ans = max(ans, cnt)
print(ans) | 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))) != 0) != (s != 0):
return 0
return sum(map(int, bin(state)[2:]))
ans = 0
for state in range(1 << N):
ans = max(ans, sol(state))
print(ans)
| p02837 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.