input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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)
| N = int(eval(input()))
A = []
for _ in range(N):
A.append([tuple(map(int, input().split())) for _ in range(int(eval(input())))])
def exists(state):
ret = 0
for i in range(N):
if ((1 << i) & state) == 0:
continue
ret += 1
for x, y in A[i]:
if ((state & (1 << (x - 1))) > 0) != (y > 0):
return 0
return ret
ans = 0
for state in range(1 << N):
ans = max(ans, exists(state))
print(ans)
| p02837 |
N = int(eval(input()))
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split(' ')))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_ls.append(j)
is_ok = True
for s in honest_ls:
for t in testimo_ls[s]:
if t[0] in honest_ls and t[1] == 0:
is_ok = False
if t[0] not in honest_ls and t[1] == 1:
is_ok = False
if is_ok:
rst = max(rst, len(honest_ls))
print(rst) | N = int(eval(input()))
testimo_ls = [ [] for i in range(N) ]
rst = 0
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split(' ')))
testimo_ls[i].append([x - 1, y])
for i in range(1 << N):
honest_ls = []
for j in range(N):
if i >> j & 1:
honest_ls.append(j)
is_ok = True
for s in honest_ls:
for t in testimo_ls[s]:
if t[0] not in honest_ls and t[1] == 1:
is_ok = False
break
if t[0] in honest_ls and t[1] == 0:
is_ok = False
break
if is_ok:
rst = max(rst, len(honest_ls))
print(rst) | p02837 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
E=[None]*n
for i in range(n):
a=int(eval(input()))
XY=[tuple(map(int,input().split())) for _ in range(a)]
E[i]=XY
N=2**n
ans=0
for S in range(N):
flag=True
for i in range(n):
if((S>>i)&1)==0: continue # 正直者のみを見る
for x,y in E[i]:
x-=1
if((S>>x)&1)!=y:
flag=False
if(flag):
ans=max(ans,bin(S).count('1'))
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
XY=[None]*n
for i in range(n):
a=int(eval(input()))
S=[None]*a
for j in range(a):
S[j]=tuple(map(int,input().split()))
XY[i]=S
ans=0
for U in range(1<<n):
flag=True
for i in range(n):
if((U>>i)&1==0): continue
for x,y in XY[i]:
x-=1
if((U>>x)&1)!=y:
flag=False
if(flag):
ans=max(ans,bin(U).count('1'))
print(ans)
resolve() | p02837 |
n = int(eval(input()))
ip = []
for i in range(n):
a = int(eval(input()))
ip.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
ip.append([x,y])
max = 0
for i in range(n) :
max += 2**i
ans = 0
for i in range(0,max+1) :
s = [2 for _ in range(n)]
bit = i
count = 0
index = 0
check = 0
for j in range(n) :
if bit%2 == 1 :
if s[j] == 0 :
check = 1
break
s[j] = 1
else :
if s[j] == 1 :
check = 1
break
s[j] = 0
bit = bit//2
for k in range(ip[index]) :
if s[j] == 1 :
if ip[index+1+k][1] == 1 :
if s[ip[index+1+k][0]-1] == 0 :
check = 1
break
s[ip[index+1+k][0]-1] = 1
elif ip[index+1+k][1] == 0 :
if s[ip[index+1+k][0]-1] == 1 :
check = 1
break
s[ip[index+1+k][0]-1] = 0
if check == 1 :
break
index += ip[index] + 1
if ans < s.count(1) and check ==0 :
ans = s.count(1)
print(ans) | n = int(eval(input()))
ip = []
for i in range(n):
a = int(eval(input()))
ip.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
ip.append([x,y])
max = 0
for i in range(n) :
max += 2**i
ans = 0
for i in range(0,max+1) :
s = [2 for _ in range(n)]
bit = i
count = 0
index = 0
check = 0
for j in range(n) :
if bit%2 == 1 :
if s[j] == 0 :
check = 1
s[j] = 1
else :
if s[j] == 1 :
check = 1
s[j] = 0
bit = bit//2
for k in range(ip[index]) :
if s[j] == 1 :
if ip[index+1+k][1] == 1 :
if s[ip[index+1+k][0]-1] == 0 :
check = 1
s[ip[index+1+k][0]-1] = 1
elif ip[index+1+k][1] == 0 :
if s[ip[index+1+k][0]-1] == 1 :
check = 1
s[ip[index+1+k][0]-1] = 0
index += ip[index] + 1
if ans < s.count(1) and check ==0 :
ans = s.count(1)
print(ans) | p02837 |
def counter(x):
if x == 0:
return 0
return counter(x >> 1) + (x & 1)
N = int(eval(input()))
A = [0 for i in range(20)]
x = [[0 for i in range(20)] for j in range(20)]
y = [[0 for i in range(20)] for j in range(20)]
for i in range(1, N + 1):
A[i] = int(eval(input()))
for j in range(1, A[i] + 1):
x[i][j], y[i][j] = list(map(int, input().split()))
# 2^N 通りをbit全探索
# kが正直者 = 2進数表記のk-1桁目が1 (1 <= k <= N)
ans = 0
for bits in range(1, 1 << N):
ok = True
for i in range(1, N + 1):
# 不親切な人の意見は無視
if not (bits & (1 << (i - 1))):
continue
for j in range(1, A[i] + 1):
# x_ij が正直者であることが偽であれば False
if ((bits >> (x[i][j] - 1)) & 1) ^ y[i][j]:
ok = False
if ok:
ans = max(ans, counter(bits))
print(ans)
| def counter(x):
if x == 0:
return 0
return counter(x >> 1) + (x & 1)
N = int(eval(input()))
A = [0 for i in range(20)]
x = [[0 for i in range(20)] for j in range(20)]
y = [[0 for i in range(20)] for j in range(20)]
for i in range(1, N + 1):
A[i] = int(eval(input()))
for j in range(1, A[i] + 1):
x[i][j], y[i][j] = list(map(int, input().split()))
# 2^N 通りをbit全探索
# kが正直者 = 2進数表記のk-1桁目が1 (1 <= k <= N)
ans = 0
for bits in range(1, 1 << N):
ok = True
for i in range(1, N + 1):
# 不親切な人の意見は無視
if not ((bits >> (i - 1)) & 1):
continue
for j in range(1, A[i] + 1):
# x_ij が正直者であることが偽であれば False
if ((bits >> (x[i][j] - 1)) & 1) ^ y[i][j]:
ok = False
if ok:
ans = max(ans, counter(bits))
print(ans)
| p02837 |
def counter(x):
if x == 0:
return 0
return counter(x >> 1) + (x & 1)
N = int(eval(input()))
A = [0 for i in range(20)]
x = [[0 for i in range(20)] for j in range(20)]
y = [[0 for i in range(20)] for j in range(20)]
for i in range(1, N + 1):
A[i] = int(eval(input()))
for j in range(1, A[i] + 1):
x[i][j], y[i][j] = list(map(int, input().split()))
# 2^N 通りをbit全探索
# kが正直者 = 2進数表記のk-1桁目が1 (1 <= k <= N)
ans = 0
for bits in range(1, 1 << N):
ok = True
for i in range(1, N + 1):
# 不親切な人の意見は無視
if not ((bits >> (i - 1)) & 1):
continue
for j in range(1, A[i] + 1):
# x_ij が正直者であることが偽であれば False
if ((bits >> (x[i][j] - 1)) & 1) ^ y[i][j]:
ok = False
if ok:
ans = max(ans, counter(bits))
print(ans)
| def counter(x):
if x == 0:
return 0
return counter(x >> 1) + (x & 1)
N = int(eval(input()))
A = [0 for i in range(20)]
x = [[0 for i in range(20)] for j in range(20)]
y = [[0 for i in range(20)] for j in range(20)]
for i in range(1, N + 1):
A[i] = int(eval(input()))
for j in range(1, A[i] + 1):
x[i][j], y[i][j] = list(map(int, input().split()))
# 2^N 通りをbit全探索
# kが正直者 = 2進数表記のk-1桁目が1 (1 <= k <= N)
ans = 0
for bits in range(1, 1 << N):
ok = True
for i in range(1, N + 1):
# 不親切な人の証言は無視
if ((bits >> (i - 1)) & 1) == 0:
continue
for j in range(1, A[i] + 1):
# x_ij が正直者であることが偽であれば False
if ((bits >> (x[i][j] - 1)) & 1) != y[i][j]:
ok = False
if ok:
ans = max(ans, counter(bits))
print(ans)
| p02837 |
n=int(eval(input()))
a=[]
l=[0]*n
ans=0
for i in range(n):
a.append(int(eval(input())))
l[i]=[list(map(int,input().split())) for i in range(a[-1])]
#print(a,l)
for i in range(2**n):
i=format(i,'b').zfill(n)
c=[]
for j in range(n):
if i[j]=='1':
c.append(j)
#print(c,l)
for j in c:
for k in l[j]:
#print(k)
if k[1]==1 and (k[0]-1 not in c):
break
elif k[1]==0 and (k[0]-1 in c):
break
else:
continue
break
else:
#print(ans)
ans=max(ans,len(c))
print(ans)
| n=int(eval(input()))
a=[]
l=[0]*n
ans=0
for i in range(n):
a.append(int(eval(input())))
l[i]=[list(map(int,input().split())) for i in range(a[-1])]
for i in range(2**n):
i=format(i,'b').zfill(n)
c=[]
for j in range(n):
if i[j]=='1':
c.append(j)
for j in c:
for k in l[j]:
#print(k)
if k[1]==1 and (k[0]-1 not in c):
break
elif k[1]==0 and (k[0]-1 in c):
break
else:
continue
break
else:
ans=max(ans,len(c))
print(ans) | p02837 |
from queue import Queue
n = int(eval(input()))
shogens = []
for people_index in range(n):
this_shogens = []
shogen_num = int(eval(input()))
for _ in range(shogen_num):
this_shogens.append(tuple(map(int, input().split())))
shogens.append(this_shogens)
def make_pattern(number):
pattern = [0 for _ in range(n)]
index = 0
while True:
if number == 0:
break
else:
pattern[index] = number % 2
number //= 2
index += 1
return pattern
def ok(pattern):
hantei = [None for _ in range(n)]
seen_list = []
q = Queue()
ret = True
for people_index in range(len(pattern)):
if pattern[people_index] == 1:
q.put(people_index)
hantei[people_index] = 1
while True:
if q.empty():
break
else:
people_index = q.get()
if people_index in seen_list:
continue
else:
seen_list.append(people_index)
this_shogens = shogens[people_index]
for this_shogen in this_shogens:
people_sareta_index = this_shogen[0]-1
shogen = this_shogen[1]
if shogen == 1 and (people_sareta_index not in seen_list):
q.put(people_sareta_index)
if hantei[people_sareta_index] == None:
hantei[people_sareta_index] = shogen
if shogen != hantei[people_sareta_index]:
ret = False
break
return ret
def main():
max_num = 0
for value in range(pow(2, n)-1, -1, -1):
pattern = make_pattern(value)
if ok(pattern):
shojiki_count = 0
for p in pattern:
if p == 1:
shojiki_count += 1
max_num = max(max_num, shojiki_count)
print(max_num)
main() | from queue import Queue
n = int(eval(input()))
shogens = []
for people_index in range(n):
this_shogens = []
shogen_num = int(eval(input()))
for _ in range(shogen_num):
this_shogens.append(tuple(map(int, input().split())))
shogens.append(this_shogens)
def make_pattern(number):
pattern = [0 for _ in range(n)]
index = 0
while True:
if number == 0:
break
else:
pattern[index] = number % 2
number //= 2
index += 1
return pattern
def ok(pattern):
hantei = [None for _ in range(n)]
seen_list = []
q = Queue()
ret = True
for people_index in range(len(pattern)):
if pattern[people_index] == 1:
q.put(people_index)
hantei[people_index] = 1
while True:
if q.empty():
break
else:
people_index = q.get()
if people_index in seen_list:
continue
else:
seen_list.append(people_index)
this_shogens = shogens[people_index]
for this_shogen in this_shogens:
people_sareta_index = this_shogen[0]-1
shogen = this_shogen[1]
if shogen == 1 and (people_sareta_index not in seen_list):
q.put(people_sareta_index)
if hantei[people_sareta_index] == None:
hantei[people_sareta_index] = shogen
if shogen != hantei[people_sareta_index]:
ret = False
break
return ret
def main():
max_num = 0
num_list = []
for value in range(pow(2, n)-1, -1, -1):
pattern = make_pattern(value)
shojiki_count = 0
for p in pattern:
if p == 1:
shojiki_count += 1
if not shojiki_count in num_list:
if ok(pattern):
max_num = max(max_num, shojiki_count)
num_list.append(shojiki_count)
print(max_num)
main() | p02837 |
#
# abc147 c
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3
1
2 1
1
1 1
1
2 0"""
output = """2"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """2
1
2 0
1
1 0"""
output = """1"""
self.assertIO(input, output)
def resolve():
N = int(eval(input()))
C = []
for i in range(N):
a = int(eval(input()))
C.append([list(map(int, input().split())) for j in range(a)])
ans = 0
for bit in range(1 << N):
t = 0
for i in range(N):
if bit & (1 << i):
for c in C[i]:
if bit & (1 << c[0]-1) != (1 << c[0]-1)*c[1]:
break
else:
t += 1
if t == bin(bit).count("1"):
ans = max(ans, t)
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| #
# abc147 c
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3
1
2 1
1
1 1
1
2 0"""
output = """2"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0"""
output = """0"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """2
1
2 0
1
1 0"""
output = """1"""
self.assertIO(input, output)
def resolve():
N = int(eval(input()))
C = []
for i in range(N):
a = int(eval(input()))
C.append([list(map(int, input().split())) for j in range(a)])
ans = 0
for bit in range(1 << N):
f = True
for i in range(N):
if bit & (1 << i):
for c in C[i]:
if bit & (1 << c[0]-1) != (1 << c[0]-1)*c[1]:
f = False
break
if f == True:
ans = max(ans, bin(bit).count("1"))
print(ans)
if __name__ == "__main__":
# unittest.main()
resolve()
| p02837 |
N=int(eval(input()))
A=[0]*N
shougen=[[] for i in range(0,N)]
for i in range(0,N):
A[i]=int(eval(input()))
for j in range(0,A[i]):
a,b=list(map(int,input().split()))
shougen[i].append([a,b])
m=0
for i in range(0,2**N):
flag=0
check=[]
for j in range(0,N):
if i>>j & 1==1:
check.extend(shougen[j])
for j in range(0,N):
if ([j+1,0] in check) or ([j+1,1] in check):
if [j+1,0] in check:
if j==0:
data=[0]
else:
data.append(0)
if [j+1,1] in check:
if j==0:
data=[1]
else:
data.append(1)
else:
if j==0:
data=[2]
else:
data.append(2)
for j in range(0,N):
if data[j]!=2:
if int(data[j])!=(i>>j)%2 :
flag=1
if len(data)!=N:
flag=1
if flag==0:
test=sum(i>>j &1 for j in range(0,N))
if test>m:
m=test
print(m)
| N=int(eval(input()))
shougen=[(0,0) for i in range(0,N)]
for i in range(0,N):
A=int(eval(input()))
honest=0
unkind=0
for j in range(0,A):
x,y=list(map(int,input().split()))
if y==0:
unkind+=2**(x-1)
else:
honest+=2**(x-1)
shougen[i]=(honest,unkind)
ans=0
for i in range(0,2**N):
honest=i
unkind=2**N-1-i
check=True
test=0
for j in range(0,N):
if (i>>j)&1 ==1:
test+=1
x,y=shougen[j]
if (honest-x)^x!=honest or (unkind-y)^y!=unkind:
check=False
if check:
if test>ans:
ans=test
print(ans) | p02837 |
import sys
def kensho(x,tlist):
for lis in tlist:
if((x>>(lis[1]-1)) & 1 == lis[2]):
pass
else:
return -1
return bin(x).count('1')
def main():
N = int(eval(input()))
xy=[]
ans=0
for i in range(1,N+1):
An= int(eval(input()))
for j in range(0,An):
x, y = list(map(int, input().split()))
xy.append([i,x,y])
cnt = N
tlist=[]
for x in range (2 ** cnt):
for y in range(cnt):
if((x>>y) & 1):
for z in xy:
if(z[0]==y+1):
tlist.append(z)
anstack = kensho(x,tlist)
if(ans<anstack):
ans=anstack
tlist.clear()
print(ans)
main() | import sys
def kensho(x,tlist):
for lis in tlist:
if((x>>(lis[1]-1)) & 1 == lis[2]):
pass
else:
return -1
return bin(x).count('1')
def main():
N = int(eval(input()))
xy=[]
ans=0
for i in range(1,N+1):
An= int(eval(input()))
for j in range(0,An):
x, y = list(map(int, input().split()))
xy.append([i,x,y])
cnt = N
tlist=[]
for x in range (2 ** cnt):
for y in range(cnt):
if((x>>y) & 1):
for z in xy:
if(z[0]==y+1):
tlist.append(z)
anstack = kensho(x,tlist)
if(ans<anstack):
ans=anstack
del tlist[:]
print(ans)
main() | p02837 |
N = int(eval(input()))
A = [None]*N
x = [[None]*N for _ in range(N)]
y = [[None]*N for _ in range(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()))
ans =0
for num in range(2**N):
#bit = bin(num)#正直者リスト
flag = 1 #これが1のままならOK
#N人を順に見る
for i in range(N):
#下からi桁目を取り出す
if (num>>i & 1)==1:#正直者なら検討
#各発言に対して，NGケースを調査
for j in range(N):
#xijの対応に注意，文章では1から
if x[i][j] != None and y[i][j]!=(num>>(x[i][j]-1) & 1):
flag = 0
if flag ==0:
break
if flag ==1:
ans = max(ans,bin(num).count("1"))
print(ans) | N = int(eval(input()))
A = [None]*N
x = [[None]*N for _ in range(N)]
y = [[None]*N for _ in range(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()))
ans =0
for num in range(2**N):
#bit = bin(num)#正直者リスト
flag = 1 #これが1のままならOK
#N人を順に見る
for i in range(N):
#下からi桁目を取り出す
if (num>>i & 1)==1:#正直者なら検討
#各発言に対して，NGケースを調査
for j in range(N):
#xijの対応に注意，文章では1から
if x[i][j] != None and y[i][j]!=(num>>(x[i][j]-1) & 1):
flag = 0
elif x[i][j] == None:
break
if flag ==0:
break
if flag ==1:
ans = max(ans,bin(num).count("1"))
print(ans) | p02837 |
'''
N人の「正直者」、「不親切な人」のすべての組み合わせを生成し、
正直者の証言が組み合わせに矛盾していないか確認する.
矛盾していない組み合わせの正直者の最大数が解答.
組み合わせは bit で表現している. Nビット用意し、
1が立っていると正直者、0だと不親切な人.
この組み合わせ状況と正直者の証言が矛盾しないか確認する.
'''
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) | import itertools
N = int(eval(input()))
evidence_dit = {}
for i in range(N):
A = int(eval(input()))
x_y = []
if A == 0:
evidence_dit[i] = []
for j in range(A):
x_y.append(list(map(int,input().split())))
evidence_dit[i] = x_y
ans = 0
attribute = [0,1]
for i in itertools.product(attribute,repeat=N):
flag = False
for j in range(N):
if i[j] == 1:
for k in evidence_dit[j]:
if i[k[0]-1] != k[1]:
flag = True
break
if flag:
break
if flag == False:
ans = max(ans,sum(i))
print(ans)
'''
入力:辞書型で置いておくことにした。
{0: [[2, 1], [3, 0]], 1: [[3, 1], [1, 0]], 2: [[1, 1], [2, 0]]}
証言が無い場合に [ ] を入れる。
attribute = [0,1]
for i in itertools.product(attribute,repeat=N):
正直、不正直のパターンを列挙するところ、itertoolsで0,1の重複順列
for i in range(2 ** N):
h = [0] * N
for j in range(N):
if (i >> j) & 1:
h[j] = 1
ビット演算子
i >> j i を右に j ビットシフト
5 >> 2 5 を右に 2 ビットシフト
101｜ ➡ 001｜01 ➡ 001
右へ２つずらして足りなくなった桁は0にする。
5 & 1 ➡ 101 AND 001 ➡ 001
両方１のところだけ１になる。
if 5 & 1: 5 & 1 の答えが１なら True、他は False
[0, 0, 0] [1, 0, 0] [0, 1, 0] [1, 1, 0] [0, 0, 1] [1, 0, 1]
[0, 1, 1] [1, 1, 1]、のような0,1の全パターンを出している。
''' | p02837 |
n=int(eval(input()))
a=[0]*n
x=[[0]*n for i in range(n)]
y=[[0]*n for i in range(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()))
x[i][j]-=1
def check(honest):
for i in range(n):
if not honest[i]:
continue
for j in range(a[i]):
if y[i][j]==1 and not honest[x[i][j]]:
return False
if y[i][j]==0 and honest[x[i][j]]:
return False
return True
def dfs(honest):
if len(honest)==n:
if check(honest):
return sum(honest)
else:
return 0
return max(dfs(honest + [1]),
dfs(honest + [0]))
print((dfs([]))) | n=int(eval(input()))
a=[0]*n
x=[[0]*n for i in range(n)]
y=[[0]*n for i in range(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()))
x[i][j]-=1
def check(honest):
for i in range(n):
if not honest[i]:
continue
for j in range(a[i]):
if y[i][j]==1 and not honest[x[i][j]]:
return 0
if y[i][j]==0 and honest[x[i][j]]:
return 0
return 1
def dfs(honest):
if len(honest)==n:
if check(honest):
return sum(honest)
else:
return 0
return max(dfs(honest + [1]),
dfs(honest + [0]))
print((dfs([]))) | p02837 |
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
N=II()
shogens=[]
for i in range(N):
a=II()
shogens.append([])
for j in range(a):
x,y=MI()
x-=1
shogens[-1].append((x,y))
def is_honest(i,j):
return (i>>j)%2==1
def honest_cnt(i):
ans=0
for j in range(N):
ans+=is_honest(i,j)
return ans
ans=0
for i in range(1<<N):
ok=True
for j in range(N):
if not is_honest(i,j):
continue
for (x,y) in shogens[j]:
if y==0 and is_honest(i,x):
ok=False
if y==1 and not is_honest(i,x):
ok=False
if ok:
ans=max(ans,honest_cnt(i))
print(ans) | def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
N=II()
a=[0]*N
x=[[0]*N for i in range(N)]
y=[[0]*N for i in range(N)]
for i in range(N):
a[i]=II()
for j in range(a[i]):
x[i][j],y[i][j]=MI()
x[i][j]-=1
def check(honest):
for i in range(N):
if not honest[i]:
continue
for j in range(a[i]):
if y[i][j]==0 and honest[x[i][j]]:
return False
if y[i][j]==1 and not honest[x[i][j]]:
return False
return True
def dfs(honest):
if len(honest)==N:
if check(honest):
return sum(honest)
else:
return 0
return max(dfs(honest+[True]),dfs(honest+[False]))
print((dfs([]))) | p02837 |
g = [[-1 for _ in range(15)] for _ in range(15)]
n = int(eval(input()))
ans=0
for i in range(n):
m = int(eval(input()))
for j in range(m):
x,y = list(map(int, input().split()))
g[i][x-1] = y
for i in range(1<<n):
honests = [0 for _ in range(n)]
for j in range(n):
if (i>>j) &1:
honests[j] = 1
ok = True
for j in range(n):
if honests[j]:
for k in range(n):
if g[j][k] == -1: continue
if g[j][k] != honests[k]: ok = False
if ok:
ans = max(ans, honests.count(1))
print(ans) | g = [[-1 for _ in range(15)] for _ in range(15)]
n = int(eval(input()))
ans=0
for i in range(n):
m = int(eval(input()))
for j in range(m):
x,y = list(map(int, input().split()))
g[i][x-1] = y
for i in range(1<<n):
honests = [0 for _ in range(n)]
for j in range(n):
if (i>>j) &1:
honests[j] = 1
ok = True
for j in range(n):
if honests[j]:
for k in range(n):
if g[j][k] == -1: continue
if g[j][k] != honests[k]: ok = False
if ok:
ans = max(ans, honests.count(1))
print(ans)
'''
・正直者の人の組を全ての組合せで仮定する。
・正直者と仮定した人の証言が仮定に矛盾するとき、
その正直者の選び方の組はあり得ない。
・正直者と仮定した人の証言同士の矛盾は調べる必要はない。
ある人に対して矛盾する二つの証言があるとき、
どちらか一方の証言は必ず仮定に矛盾する。したがって、
この仮定があり得ないことを調べるには仮定と証言の矛盾を調べるだけでよい。
・全ての証言が矛盾しない正直者の選び方の組のうち、
正直者が最も多い組の正直者の人数を求めれば良い。
人xの人yに対する証言のデータを二次元配列gへ次のような対応関係で
格納しておく。なお、ここでは人の番号は配列のオフセットに合わせるため
0から始めるものとする。
・人xが人yに対して正直者であると証言するとき、
二次元配列g[x][y]を1にする。
・人xが人yに対して不親切な人であると証言するとき
二次元配列g[x][y]を0とする。
・人xが人yに対して言及していないとき、
二次元配列g[x][y]を-1にする。
・入力よりNの最大が15なので、
15行15列の二次元配列gをデフォルト値-1用意しておく
・全員の人数を表す値を受け取る。
・用意した配列に人iが人jに対して述べる証言のデータを格納していく。
・人iの証言の数mを受け取る。
・人iの証言を受け取るためm回次のループを回す。
・証言を表す二つの値を受け取り二次元配列gに格納する。
人iが「人xはyである」と証言しているときg[i][x]=yである。
（入力で受け取る「人の番号」は1から始まるため、
コードでは受け取った値から1引いている。）
g = [[-1 for _ in range(15)] for _ in range(15)]
n = int(input())
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int, input().split())
g[i][x-1] = y
二次元配列gの作成と入力の受け取りは以上である。
次に問題を解く中心となるコードを実装していく。
まず、全ての正直者の組を表現するために二進数表記を用いることを考える。
二進数の右端の桁を0桁目とする。またkを0から14までの整数とする。
・「k桁目が1である」を「人kは正直者である」
・「k桁目が0である」を「人kは不親切な人である」
作り出した正直者の組それぞれに対して何らかの処理を行うため、
これは全bit探索である。
「正直者の組を作りだす」部分のコード。
・カウンタ変数iを1から2^15まで変化させ、次の処理を繰り返す。
・正直者の番号を格納する要素数nの配列honestsをデフォルト値0で作る。
・iを二進数で表現したときj桁目が1であればhonests[j]に1を追加する。
for i in range(1<<n):
honests = [0 for _ in range(n)]
for j in range(n):
if (i>>j) &1:
honests[j] = 1
honests[j]が1であることは,人jは正直者であると仮定することに対応する。
次はhonestsの仮定と証言gに矛盾がないか調べ、求める値「N人のうち
正直者であり得る最大人数」を出力するまでの実装をおこなう。
仮定と証言に矛盾があればそのhonestsで表現された組はあり得ない。
・求める値「N人のうち正直者であり得る最大人数」を格納するための
変数ansをデフォルト値0で用意しておく。
求める値は0以上の値であり以下のループ処理によって、
より大きな値で更新され得る。最終的に最大値が格納される。
・ある正直者の組に矛盾がなかったことを表す変数okをデフォルト値
Trueで用意しておく
・外側のループで配列honestsを作る。作ったhonestsの要素を順に調べる。
honests[j]が1ならば証言g[j]は正しいのでg [j]を以下のように調べる。
・g[j][k]が-1ならば何もしなくてよいので次の証言を調べるループへ移る。
・g[i][k]がhonests[k]の値と異なるならばこの正直者の組はあり得ないので
変数okをFalseにする。
・okがTureのときhonestsの要素の値が1であるものの数（つまり正直者の数）を
数えてansより大きいならばその値をansに代入する。
・最終的なansの値を出力する。
''' | p02837 |
g = [[-1 for _ in range(15)] for _ in range(15)]#証言格納用
n = int(eval(input()))#証言なし-1で初期化
ans=0
for i in range(n):#n人の人について、一人一人、入力
m = int(eval(input()))#証言の個数をもらう
for j in range(m):#m個の証言を入力
x,y = list(map(int, input().split()))
g[i][x-1] = y#i番目の人の証言を格納、人の番号xは0始まり
for i in range(1<<n):#Bit全探索開始
honests = [0 for _ in range(n)]#正直者フラグ、後で1で人数計算
for j in range(n):#n人を一人ずつ、チェックする
if (i>>j) &1:#Bitが立っているかを1で表す
honests[j] = 1#Bitが立っていれば、j番目は正直と仮定
ok = True#矛盾が無い仮定で、証言を検証する
for j in range(n):#n人を一人ずつ、チェック(j番目の人を見る)
if honests[j]:#j番目が、もし正直なら証言を検証(不正直の証言は無視)
for k in range(n):#j番目の人の、k番目の人に対する証言を検証
if g[j][k] == -1: continue#証言していなければ、飛ばす
if g[j][k] != honests[k]: ok = False#証言とフラグ仮定が不一致
if ok:#矛盾がないケースについて調べる
ans = max(ans, honests.count(1))#正直であるフラグ1が立っている数
print(ans)
'''
・正直者の人の組を全ての組合せで仮定する。
・正直者と仮定した人の証言が仮定に矛盾するとき、
その正直者の選び方の組はあり得ない。
・正直者と仮定した人の証言同士の矛盾は調べる必要はない。
ある人に対して矛盾する二つの証言があるとき、
どちらか一方の証言は必ず仮定に矛盾する。したがって、
この仮定があり得ないことを調べるには仮定と証言の矛盾を調べるだけでよい。
・全ての証言が矛盾しない正直者の選び方の組のうち、
正直者が最も多い組の正直者の人数を求めれば良い。
人xの人yに対する証言のデータを二次元配列gへ次のような対応関係で
格納しておく。なお、ここでは人の番号は配列のオフセットに合わせるため
0から始めるものとする。
・人xが人yに対して正直者であると証言するとき、
二次元配列g[x][y]を1にする。
・人xが人yに対して不親切な人であると証言するとき
二次元配列g[x][y]を0とする。
・人xが人yに対して言及していないとき、
二次元配列g[x][y]を-1にする。
・入力よりNの最大が15なので、
15行15列の二次元配列gをデフォルト値-1用意しておく
・全員の人数を表す値を受け取る。
・用意した配列に人iが人jに対して述べる証言のデータを格納していく。
・人iの証言の数mを受け取る。
・人iの証言を受け取るためm回次のループを回す。
・証言を表す二つの値を受け取り二次元配列gに格納する。
人iが「人xはyである」と証言しているときg[i][x]=yである。
（入力で受け取る「人の番号」は1から始まるため、
コードでは受け取った値から1引いている。）
g = [[-1 for _ in range(15)] for _ in range(15)]
n = int(input())
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int, input().split())
g[i][x-1] = y
二次元配列gの作成と入力の受け取りは以上である。
次に問題を解く中心となるコードを実装していく。
まず、全ての正直者の組を表現するために二進数表記を用いることを考える。
二進数の右端の桁を0桁目とする。またkを0から14までの整数とする。
・「k桁目が1である」を「人kは正直者である」
・「k桁目が0である」を「人kは不親切な人である」
作り出した正直者の組それぞれに対して何らかの処理を行うため、
これは全bit探索である。
「正直者の組を作りだす」部分のコード。
・カウンタ変数iを1から2^15まで変化させ、次の処理を繰り返す。
・正直者の番号を格納する要素数nの配列honestsをデフォルト値0で作る。
・iを二進数で表現したときj桁目が1であればhonests[j]に1を追加する。
for i in range(1<<n):
honests = [0 for _ in range(n)]
for j in range(n):
if (i>>j) &1:
honests[j] = 1
honests[j]が1であることは,人jは正直者であると仮定することに対応する。
次はhonestsの仮定と証言gに矛盾がないか調べ、求める値「N人のうち
正直者であり得る最大人数」を出力するまでの実装をおこなう。
仮定と証言に矛盾があればそのhonestsで表現された組はあり得ない。
・求める値「N人のうち正直者であり得る最大人数」を格納するための
変数ansをデフォルト値0で用意しておく。
求める値は0以上の値であり以下のループ処理によって、
より大きな値で更新され得る。最終的に最大値が格納される。
・ある正直者の組に矛盾がなかったことを表す変数okをデフォルト値
Trueで用意しておく
・外側のループで配列honestsを作る。作ったhonestsの要素を順に調べる。
honests[j]が1ならば証言g[j]は正しいのでg [j]を以下のように調べる。
・g[j][k]が-1ならば何もしなくてよいので次の証言を調べるループへ移る。
・g[i][k]がhonests[k]の値と異なるならばこの正直者の組はあり得ないので
変数okをFalseにする。
・okがTureのときhonestsの要素の値が1であるものの数（つまり正直者の数）を
数えてansより大きいならばその値をansに代入する。
・最終的なansの値を出力する。
''' | def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
N=II()
ans=0
List=[[-1 for _ in range(N)] for _ in range(N)]
for j in range(N):
A=II()
for i in range(A):
x,y=MI()
x-=1
List[j][x]=y
for i in range(1<<N):
honests=[0]*N
for j in range(N):
if 1&(i>>j):
honests[j]=1
ok=True
for j in range(N):
if honests[j]:
for k in range(N):
if List[j][k]==-1:
continue
if List[j][k]!=honests[k]:
ok=False
if ok:
ans=max(ans,honests.count(1))
print(ans) | p02837 |
def popcnt(n):
return bin(n).count("1")
n = int(eval(input()))
grid = []
for i in range(n):
p = int(eval(input()))
for j in range(p):
array = [i] +list(map(int, input().strip().split(' ')))
array[1] = array[1] - 1
grid.append(array)
truth = 0
count = 0
for i in range(2**n):
k = (bin(i)[2:]).zfill(n)
count = 0
for j in range(len(grid)):
if int(k[grid[j][0]]) == 1:
if (int(k[grid[j][1]]) == 1 and grid[j][2] == 0) or (int(k[grid[j][1]]) == 0 and grid[j][2] == 1):
count = 1
if count == 0:
if truth < popcnt(i):
truth = popcnt(i)
print(truth)
| def popcnt(n):
return bin(n).count("1")
n = int(eval(input()))
grid = []
for i in range(n):
p = int(eval(input()))
for j in range(p):
array = [i] +list(map(int, input().strip().split(' ')))
array[1] = array[1] - 1
grid.append(array)
truth = 0
count = 0
for i in range(2**n):
k = (bin(i)[2:]).zfill(n)
count = 0
for j in range(len(grid)):
if int(k[grid[j][0]]) == 1:
if (int(k[grid[j][1]]) == 1 and grid[j][2] == 0) or (int(k[grid[j][1]]) == 0 and grid[j][2] == 1):
count = 1
break
if count == 0:
if truth < popcnt(i):
truth = popcnt(i)
print(truth)
| p02837 |
def main():
n = int(eval(input()))
ttn = [[-1] * n for _ in range(n)] # Testimonies.
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = [int(z) for z in input().split()]
x -= 1
ttn[i][x] = y # i says that x is honest guy or not.
ans = set()
# for else で頑張ったが，フラグを作ったほうがずっと分かりやすいだろう。
for i in range(2 ** n):
tmp = [i >> j & 1 for j in range(n)] # Bit-shift.
for k, tm in enumerate(tmp):
if tm:
for l, tt in enumerate(ttn[k]):
if tt == -1:
continue
if tt != tmp[l]:
break
else:
continue
break
else:
ans.add(bin(i).count('1'))
return max(ans)
if __name__ == '__main__':
print((main()))
| def main():
n = int(eval(input()))
ttn = [[-1] * n for _ in range(n)] # Testimonies.
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = [int(z) for z in input().split()]
x -= 1
ttn[i][x] = y # i says that x is honest guy or not.
ans = set()
for i in range(2 ** n):
tmp = [i >> j & 1 for j in range(n)] # Bit-shift.
possible = True
for k, tm in enumerate(tmp):
if not possible:
break
if tm:
for l, tt in enumerate(ttn[k]):
if tt == -1:
continue
if tt != tmp[l]:
possible = False
break
if possible:
ans.add(bin(i).count('1'))
return max(ans)
if __name__ == '__main__':
print((main()))
| p02837 |
n = int(eval(input()))
tst = [[] for i in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,input().split()))
tst[i].append([x,y])
ans = 0
for bit in range(1<<n):
liars = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
liars[-1-i] = 1
for i in range(n):
if liars[i]:
for l in tst[i]:
if l[1]!=liars[l[0]-1]:
check = 0
break
temp = 0
if check:
temp = sum(liars)
ans = max(ans,temp)
print(ans) | n = int(eval(input()))
tst = [[] for i in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,input().split()))
tst[i].append([x,y])
ans = 0
for bit in range(1<<n):
liars = [0]*n
check = 1
for i in range(n):
if (bit>>i)&1:
liars[-1-i] = 1
for i in range(n):
if not liars[i]:
continue
for l in tst[i]:
if l[1]!=liars[l[0]-1]:
check = 0
break
if check:
ans = max(ans,sum(liars))
print(ans) | p02837 |
# import numpy as np
# import scipy as sp
n = int(eval(input()))
info = []
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
info.append([i, x-1, y])
ans = 0
for i in range(2 ** n):
bit = [0] * n
for j in range(n):
if ((i >> j) & 1):
bit[j] = 1
flag = True
# print(bit)
for idx, j in enumerate(bit):
if j == 1:
for k in [x for x in info if x[0] == idx]:
# print(' ', k)
if bit[k[1]] != k[2]:
flag = False
if flag:
ans = max(ans, sum(bit))
# print(ans)
print(ans)
| # import numpy as np
# import scipy as sp
n = int(eval(input()))
info = []
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
info.append([i, x-1, y])
ans = 0
for i in range(2 ** n):
bit = [0] * n
for j in range(n):
if ((i >> j) & 1):
bit[j] = 1
flag = True
# print(bit)
for idx, j in enumerate(bit):
if not flag:
break
if j == 1:
for k in [x for x in info if x[0] == idx]:
# print(' ', k)
if bit[k[1]] != k[2]:
flag = False
if flag:
ans = max(ans, sum(bit))
# print(ans)
print(ans)
| p02837 |
import sys
input = sys.stdin.readline
from operator import eq, ne
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x)-1, y
def main():
n = int(eval(input()))
graph = []
for _ in range(n):
a = int(eval(input()))
graph.append(list(readlines(a)))
def check(bits):
for pre_honest, asserts in zip(bits, graph):
if pre_honest == "0":
continue
for x, y in asserts:
if bits[x] != y:
return -1
return len([b for b in bits if b == "1"])
for i in range(2**n-1, -1, -1):
bit = format(i, "0{}b".format(n))
ans = check(bit)
if ans > -1:
print(ans)
return
print((0))
main()
| import sys
input = sys.stdin.readline
from itertools import combinations
from operator import contains
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x)-1, y=="1"
def main():
n = int(eval(input()))
asserts = []
for _ in range(n):
a = int(eval(input()))
asserts.append(list(readlines(a)))
def check(comb):
for i in comb:
for x, y in asserts[i]:
mujun = contains if not y else lambda a, b: b not in a
if mujun(comb, x):
return -1
return len(comb)
for i in range(n+1):
for comb in combinations(list(range(n)), i):
yield check(set(comb))
yield 0
print((max(main()))) | p02837 |
n = int(eval(input()))
e = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
x -= 1
e[i].append((x, y))
ret = 0
for mask in range(1 << n):
t = [(mask >> i) & 1 for i in range(n)]
flg = True
for i in range(n):
if t[i]:
for x, y in e[i]:
if t[x] != y:
flg = False
break
if not flg:
break
if flg:
ret = max(ret, sum(t))
print(ret) | def main():
from itertools import product
N = int(eval(input()))
g = []
for _ in range(N):
a = int(eval(input()))
t = []
for _ in range(a):
x, y = list(map(int, input().split()))
x -= 1
t.append((x, y))
g.append(t)
def is_ok(prd):
for j, bl in enumerate(prd):
if bl:
for x, y in g[j]:
if prd[x] != y:
return False
return True
ans = 0
for prd in product([0, 1], repeat=N):
*prd, = prd # list化
if is_ok(prd):
ans = max(ans, prd.count(1))
print(ans)
if __name__ == '__main__':
main()
# bit演算しようとしてはまった
| p02837 |
n = int(eval(input()))
x = []
for i in range(n):
ai = int(eval(input()))
xi = []
for j in range(ai):
xi.append(list(map(int, input().split())))
x.append(xi)
m = 0
for h in range(2**n - 1, -1, -1):
is_break = False
h = bin(h)[2:].zfill(n)
for i, xi in enumerate(x):
if h[i] == '0':
continue
for xij, yij in xi:
if (int(h[xij - 1]) != yij):
is_break = True
break
if is_break:
break
else:
m = max(sum(map(int, list(h))), m)
print(m) | n = int(eval(input()))
v = []
for i in range(n):
ai = int(eval(input()))
vi = []
for j in range(ai):
vi.append(list(map(int, input().split())))
v.append(vi)
m = 0
for bit in range(2**n - 1, -1, -1):
is_break = False
for i in range(n):
if not (bit & (1 << i)):
continue
for xij, yij in v[i]:
if not (not (bit & (1 << xij - 1))) != yij:
is_break = True
break
if is_break:
break
else:
m = max(bin(bit).count('1'), m)
print(m) | p02837 |
n=int(eval(input()))
A=[]
L=[]
for i in range(n):
a=int(eval(input()))
A.append(a)
D=[]
for j in range(a):
x,y=list(map(int,input().split()))
D.append((x,y))
L.append(D)
ans=0
for i in range(2**n):
B=[0]*n
for j in range(n):
if i>>j&1:
B[j]=1
if 1 in B:
flag=True
for k in range(n):
if B[k]==1:
for m in range(A[k]):
if B[L[k][m][0]-1]!=L[k][m][1]:
flag=False
break
if flag:
ans=max(ans,sum(B))
print(ans)
| n=int(eval(input()))
A=[]
L=[]
for i in range(n):
a=int(eval(input()))
A.append(a)
D=[]
for i in range(a):
x,y=list(map(int,input().split()))
D.append((x,y))
L.append(D)
ans=0
for i in range(2**n):
B=[0]*n
for j in range(n):
if i>>j&1:
B[j]=1
if 1 in B:
flag=True
for k in range(n):
if B[k]==1:
for m in range(A[k]):
if B[L[k][m][0]-1]!=L[k][m][1]:
flag=False
break
if flag:
ans=max(ans,sum(B))
print(ans) | p02837 |
n=int(eval(input()))
a=[]
for i in range(n):
x=int(eval(input()))
aa=[[int(i) for i in input().split()] for i in range(x)]
a.append(aa)
#print(a)
ans=0
for i in range(2**n):
status=[True]*n
for j in range(n):
if ((i>>j)&1):
status[j]=False
check=[None]*n
flag=True
for i in range(n):
if status[i]==True:
for x,y in a[i]:
if y==1 and status[x-1]==True and (check[x-1]==None or check[x-1]==True):
check[x-1]=True
elif y==1 and (check[x-1]==False or status[x-1]==False):
flag=False
elif y==0 and status[x-1]==False and (check[x-1]==None or check[x-1]==False):
check[x-1]=False
elif y==0 and (check[x-1]==True or status[x-1]==True):
flag=False
if flag:
#print(status,check)
cnt=status.count(True)
ans=max(ans,cnt)
print(ans) | n=int(eval(input()))
a=[]
for i in range(n):
x=int(eval(input()))
b=[[int(i) for i in input().split()] for i in range(x)]
a.append(b)
ans=0
for i in range(2**n):
status=[True]*n
for j in range(n):
if ((i>>j)&1):
status[j]=False
judge=[None]*n
contradiction=False
for x,person in enumerate(a):
if status[x]==False:
continue
for testimony in person:
if testimony[1]==1:
if judge[testimony[0]-1]!=False and status[testimony[0]-1]==True:
judge[testimony[0]-1]=True
else:
contradiction=True
else:
if judge[testimony[0]-1]!=True and status[testimony[0]-1]==False:
judge[testimony[0]-1]=False
else:
contradiction=True
if contradiction==False:
ans=max(ans,status.count(True))
print(ans)
| p02837 |
# coding: utf-8
N = int(eval(input()))
A = {}
for i in range(N):
a = int(eval(input()))
l = []
for j in range(a):
tmp = list(map(int, input().split()))
l.append(tmp[:])
A[i+1] = l[:]
# print(A)
ans = -1
for bit in range(2**N):
l = []
# 正直者と嘘つきの配列
for i in range(N):
if (bit >> i) & 1 == 1:
l.append(1)
else:
l.append(0)
flag = True
for i in range(N):
if (bit >> i) & 1 == 1:
for j in range(len(A[i+1])):
if l[A[i+1][j][0]-1] != A[i+1][j][1]:
flag = False
# print(*l)
# print(flag)
if flag:
ans = max(ans, sum(l))
# if len(l) <= 2:
# ans = 1
print(ans) | # coding: utf-8
N = int(eval(input()))
A = {}
for i in range(N):
a = int(eval(input()))
l = []
for j in range(a):
tmp = list(map(int, input().split()))
l.append(tmp[:])
A[i+1] = l[:]
ans = -1
for bit in range(2**N):
l = []
# 正直者と嘘つきの配列
for i in range(N):
if (bit >> i) & 1 == 1:
l.append(1)
else:
l.append(0)
flag = True
for i in range(N):
# 正直者の場合、それぞれのいうことに整合性があるかを確認する
if (bit >> i) & 1 == 1:
for j in range(len(A[i+1])):
# 正直者を嘘つき(もしくは逆)を言った場合はその組み合わせで
# 整合性が取れないので成り立たない組み合わせ
if l[A[i+1][j][0]-1] != A[i+1][j][1]:
flag = False
if flag:
ans = max(ans, sum(l))
print(ans) | p02837 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
readlines = sys.stdin.buffer.readlines
N = int(eval(input()))
evid = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
evid[i].append((x-1,y))
ans = 0
for bit in range(1<<N):
cnt = 0
ok = True
for i in range(N):
if not bit>>i & 1:
continue
for x, y in evid[i]:
if y==1 and not bit>>x & 1:
ok = False
break
if y==0 and bit>>x & 1:
ok = False
break
if ok:
cnt += 1
else:
break
else:
ans = max(ans, cnt)
print(ans)
|
def resolve():
N = int(eval(input()))
evdi = [[] for _ in range(N)]
for i in range(N):
cnt = int(eval(input()))
for _ in range(cnt):
x, y = list(map(int, input().split()))
x -= 1
evdi[i].append((x, y))
ans = 0
for bit in range(1 << N):
ok = True
for i in range(N):
if bit >> i & 1:
for (x, y) in evdi[i]:
if y == 1 and not bit >> x & 1:
ok = False
break
if y == 0 and bit >> x & 1:
ok = False
break
cnt = bin(bit).count("1")
if ok:
ans = max(cnt, ans)
print(ans)
if __name__ == "__main__":
resolve()
| p02837 |
import sys
input = sys.stdin.buffer.readline
def main():
n = int(eval(input()))
#ビット全探索を行う
import itertools
li = list(itertools.product([0, 1], repeat=n)) # ０が不親切もの、１が親切もの
#dd[i]:人iが人xをy（０なら不親切,１なら親切)だと思っていることを収納
from collections import deque, defaultdict
dd = {}
for i in range(n):
dd[i] = deque()
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
dd[i].append((x-1, y))
from copy import deepcopy
max_sum = 0 #親切者の数の最大値
for i in li: # i には親切者のタプルが入っている
ppp = 0
for ggg in i:
ppp += ggg
if ppp <= max_sum:
continue
sum_ = 0
flag = True
co = deepcopy(dd)
for k in range(len(i)): #全員の証言が矛盾しないかを考える
if i[k] == 0: # 不親切ものの場合
continue
else: #以下k人目の証言を考える
sum_ += 1
length = len(co[k])
while co[k]:
x, y = co[k].popleft()
if i[x] != y: #証言と一致していない場合
flag = False
break
if flag:
max_sum = max(max_sum, sum_)
print(max_sum)
if __name__ == '__main__':
main() | import sys
input = sys.stdin.buffer.readline
def main():
n = int(eval(input()))
#ビット全探索を行う
import itertools
li = list(itertools.product([0, 1], repeat=n)) # ０が不親切もの、１が親切もの
#dd[i][x] = y:人iが人xをy（０なら不親切,１なら親切)だと思っていることを収納
NIL = -1
dd = [[NIL]*n 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
dd[i][x] = y
from copy import deepcopy
max_sum = 0 #親切者の数の最大値
for i in li: # i には親切者のタプルが入っている
ppp = 0
for ggg in i:
ppp += ggg
if ppp <= max_sum:
continue
sum_ = 0
flag = True
for k in range(len(i)): #全員の証言が矛盾しないかを考える
if i[k] == 0: # 不親切ものの場合
continue
else: #以下k人目の証言を考える
sum_ += 1
for l in range(n):
if dd[k][l] != NIL and dd[k][l] != i[l]: #証言と一致していない場合
flag = False
break
if flag:
max_sum = max(max_sum, sum_)
print(max_sum)
if __name__ == '__main__':
main() | p02837 |
N = int(eval(input()))
S = ['']
res = []
for _ in range(N):
A = int(eval(input()))
s = []
for _ in range(A):
s.append(list(map(int, input().split())))
S.append(s)
allp = 2**N - 1
for i in range(allp, -1, -1):
pat = bin(i).replace('0b', '')
pat = pat.zfill(N)
h_list = []
l_list = []
for (i, p) in enumerate(pat):
t = i + 1
if p == '1':
if t in l_list:
break
h_list.append(t)
for s in S[t]:
if s[1] == 1:
if s[0] in l_list:
break
h_list.append(s[0])
else:
if s[0] in h_list:
break
l_list.append(s[0])
else:
continue
break
else:
if t in h_list:
break
l_list.append(t)
# for s in S[t]:
# if s[1] == 1:
# if s[0] in h_list:
# break
# l_list.append(s[0])
# else:
# if s[0] in l_list:
# break
# h_list.append(s[0])
# else:
# continue
# break
else:
res.append(pat)
maxA = 0
for r in res:
maxA = max(maxA, r.count('1'))
print(maxA)
| N = int(eval(input()))
S = ['']
res = []
for _ in range(N):
A = int(eval(input()))
s = []
for _ in range(A):
s.append(list(map(int, input().split())))
S.append(s)
allp = 2**N - 1
for i in range(allp, -1, -1):
pat = bin(i).replace('0b', '')
pat = pat.zfill(N)
h_list = []
l_list = []
for (i, p) in enumerate(pat):
t = i + 1
if p == '1':
if t in l_list:
break
h_list.append(t)
for s in S[t]:
if s[1] == 1:
if s[0] in l_list:
break
h_list.append(s[0])
else:
if s[0] in h_list:
break
l_list.append(s[0])
else:
continue
break
else:
if t in h_list:
break
l_list.append(t)
else:
res.append(pat)
maxA = 0
for r in res:
maxA = max(maxA, r.count('1'))
print(maxA)
| p02837 |
N=int(eval(input()))
testimony=[[-1]*N for i in range(N)]
count=0
for i in range(N):
A=int(eval(input()))
for j in range(A):
x,y=list(map(int,input().split()))
testimony[i][x-1]=y
for i in range(1<<N):
honest=[0]*N
for j in range(N):
if (i>>j)&1:
honest[j]=1
flag=True
for j in range(N):
if honest[j]:
for k in range(N):
if testimony[j][k]==-1:
continue
if testimony[j][k]!=honest[k]:
flag=False
if flag:
count=max(count,honest.count(1))
print(count) | N=int(eval(input()))
xy=[[-1]*N for i in range(N)]
count=0
for i in range(N):
A=int(eval(input()))
for j in range(A):
x,y=list(map(int,input().split()))
xy[i][x-1]=y
for i in range(1<<N):
honest=[0]*N
for j in range(N):
if (i>>j)&1:
honest[j]=1
flag=True
for j in range(N):
if honest[j]:
for k in range(N):
if xy[j][k]==-1:
continue
if xy[j][k]!=honest[k]:
flag=False
if flag:
count=max(count,honest.count(1))
print(count) | p02837 |
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
num_list = []
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
if flag:
num_list.append(one_count)
else:
num_list.append(0)
print((max(num_list)))
| n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
num_list = []
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
break
if flag:
num_list.append(one_count)
else:
num_list.append(0)
print((max(num_list)))
| p02837 |
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
num_list = []
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
break
if flag:
num_list.append(one_count)
else:
num_list.append(0)
print((max(num_list)))
| n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
ans = 0
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
break
if flag:
ans = max(ans,one_count)
print(ans)
| p02837 |
import sys
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
N = ri()
A = [[] for _ in range(N)]
for i in range(N):
a = ri()
l = []
for j in range(a):
x, y = rl()
l.append((x, y))
A[i] = l
answer = 0
for i in range(2 ** N):
honest = [False] * (N+1)
bool = True
for j in range(N):
if ((i >> j) & 1):
honest[N - j] = True
for k in range(1, N+1):
if honest[k] == True:
#k番目の人は正直者
for x, y in A[k-1]:
if y == 1 and honest[x] == False:
bool = False
break
if y == 0 and honest[x] == True:
bool = False
break
if bool and sum(honest) > answer:
answer = max(answer, sum(honest))
print(answer)
| import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
answer = 0
N = ir()
honest = [[] for _ in range(N+1)]
liar = [[] for _ in range(N+1)]
# bit全探索
for i in range(N):
a = ir()
for _ in range(a):
x, y = lr()
if y == 1:
honest[i].append(x-1)
else:
liar[i].append(x-1)
for bit in range(1<<N):
bl = True
h = []
for i in range(N):
if (bit >> i) & 1:
h.append(i)
s = set(h)
for person in h:
for x in honest[person]:
if x not in s:
bl = False
break
for y in liar[person]:
if y in s:
bl = False
break
if not bl:
break
if bl:
answer = max(answer, len(s))
print(answer)
| p02837 |
n = int(eval(input()))
ls = []
for i in range(n):
a = int(eval(input()))
p = []
for i in range(a):
x,y = list(map(int,input().split()))
p.append([x-1,y])
ls.append(p)
ans = 0
for i in range(2**n):
flag = 0
for j in range(n):
if (i >> j) & 1:
for k in ls[j]:
if (i>>k[0])&1 != k[1]:
flag = 1
break
if flag == 0:
ans = max(ans, bin(i)[2:].count('1'))
print(ans) | n = int(eval(input()))
ls = []
for i in range(n):
a = int(eval(input()))
p = []
for i in range(a):
x,y = list(map(int,input().split()))
p.append([x-1,y])
ls.append(p)
ans = 0
for i in range(2**n):
flag = 0
for j in range(n):
if (i >> j) & 1:#もし正直者だったら
for k in ls[j]:#証言の確認
if (i >> k[0])&1 != k[1]:#もし証言がおかしかったら
flag = 1
break
if flag == 0:
ans = max(ans, bin(i)[2:].count('1'))
print(ans) | p02837 |
N = int(eval(input()))
A = []
x = [[] for i in range(N)]
y = [[] for i in range(N)]
for i in range(N):
A.append(int(eval(input())))
for j in range(A[i]):
tmpX, tmpY = list(map(int, input().split()))
x[i].append(tmpX-1)
y[i].append(tmpY)
ans = 0
for case in range(2**N):
flag = True
honest = 0
for i in range(N):
for j in range(A[i]):
if (case >> i)&1 and (case >> x[i][j])&1 != y[i][j]:
flag = False
honest += (case >> i)&1
if flag:
ans = max(ans, honest)
print(ans) | N = int(eval(input()))
A = []
x = [[] for i in range(N)]
y = [[] for i in range(N)]
for i in range(N):
A.append(int(eval(input())))
for j in range(A[i]):
tmpX, tmpY = list(map(int, input().split()))
x[i].append(tmpX-1)
y[i].append(tmpY)
ans = 0
for case in range(2**N):
flag = True
honest = 0
for i in range(N):
if (case >> i)&1 == False: continue
for j in range(A[i]):
if (case >> x[i][j])&1 != y[i][j]:
flag = False
honest += (case >> i)&1
if flag:
ans = max(ans, honest)
print(ans) | p02837 |
N = int(eval(input()))
honest = [[] for _ in range(N)]
unkind = [[] for _ in range(N)]
MAX = 0
for i in range(0,N):
A = int(eval(input()))
for _ in range(A):
x, y =list(map(int,input().split(' ')))
if y == 0:
unkind[i].append(x-1)
else:
honest[i].append(x-1)
for i in range(2**N):
flg = 1
for j in range(N):
if ((i>>j) & 1):
bool1 = all([(i>>k) & 1 for k in honest[j]])
bool2 = all([~(i>>k) & 1 for k in unkind[j]])
if not all([(i>>k) & 1 for k in honest[j]]) or not all([~(i>>k) & 1 for k in unkind[j]]):
flg =0
if flg:
cnt = 0
num = i
while num:
num &= num -1
cnt += 1
MAX = max(cnt,MAX)
print(MAX) |
def main():
N = int(eval(input()))
A = []
for i in range(N):
a = int(eval(input()))
XY = []
for _ in range(a):
x,y = list(map(int,input().split()))
XY.append((x-1,y))
A.append(XY)
# print(A)
MAX = 0
for i in range(2**N):
# print(i)
flg = 1
for j in range(N):
if (i >>j) & 1:
# print('b')
for ch in A[j]:
# print(i,ch[0],bin(i >> ch[0]),ch[1],(i >> ch[0])^ ch[1])
if ((i >> ch[0])^ ch[1])%2 == 1:
# print('a',ch[0])
flg = 0
if flg == 1:
t = bin(i).count('1')
MAX = max(t,MAX)
print(MAX)
main() | p02837 |
N = int(eval(input()))
T = [[] for k in range(N)]
for p in range(N):
A = int(eval(input()))
for k in range(A):
x, y = list(map(int,input().split()))
T[p].append([x-1,y])
ans = 0
for k in range(2**N):
t = []
f = []
for d in range(N):
if (k>>d)&1 == 1:
t.append(d)
else:
f.append(d)
flag = 1
for p in range(N):
if p in t:
for e in T[p]:
if e[1] == 1 and e[0] in f:
flag = 0
break
elif e[1] == 0 and e[0] in t:
flag = 0
break
if flag == 1:
ans = max(ans,len(t))
print(ans)
| N = int(eval(input()))
L = []
for k in range(N):
t = []
for l in range(int(eval(input()))):
x, y = list(map(int,input().split()))
t.append([x-1,y])
L.append(t)
ans = 0
for k in range(2**N):
t = []
for d in range(N):
if (k>>d)&1:
t.append(d)
flag = 1
for e in t:
for f in L[e]:
if f[0] in t and f[1] == 0:
flag = 0
break
if f[0] not in t and f[1] == 1:
flag = 0
break
ans = max(ans,flag*len(t))
print(ans)
| p02837 |
N=int(eval(input()))
X=[0]*N
for i in range(N):
X[i]=[list(map(int,input().split())) for _ in range(int(eval(input())))]
print((max(['{:03b}'.format(i).count('1')for i in range(2**N) if all([i>>j&1 and all([y[1]==i>>(y[0]-1)&1 for y in X[j]]) for j in range(N) if (i>>j&1)])]))) | N=int(eval(input()))
X=[0]*N
for i in range(N):
X[i]=[list(map(int,input().split())) for _ in [0]*int(eval(input()))]
print((max(['{:b}'.format(i).count('1')for i in range(2**N) if all([all([y[1]==i>>(y[0]-1)&1 for y in X[j]]) for j in range(N) if (i>>j&1)])]))) | p02837 |
N = int(eval(input()))
ls = []
for i in range(N):
a = int(eval(input()))
for _ in range(a):
x,y = list(map(int, input().split()))
ls.append((i,x-1,y==1))
max = 0
for i in range(2**N):
c = 0
hon = set()
unhon = set()
for x in range(N):
if (i>>x)&1 == 1:
c += 1
for x,y,z in ls:
if (i>>x)&1 == 1:
if z:
hon.add(y)
else:
unhon.add(y)
if len(hon & unhon) == 0:
flag = True
for n in range(N):
if (i>>n)&1 == 1:
if n in unhon:
flag = False
break
else:
if n in hon:
flag = False
break
if flag and c >= max:
max = c
print(max) | N = int(eval(input()))
h = []
for i in range(N):
m = int(eval(input()))
g = []
for j in range(m):
a, b = list(map(int, input().split()))
g.append((a-1, b))
h.append(g)
def judge(a, b):
for i in range(N):
if (b >> i) & 1:
for j in a[i]:
if ((b >> j[0]) & 1) != j[1]:
return False
return True
x = 0b0
ans = -1
for i in range(2**N):
if judge(h, x):
tmp = 0
for i in range(N):
if (x >> i) & 1:
tmp += 1
if tmp > ans:
ans = tmp
x += 1
print(ans) | p02837 |
from collections import defaultdict,deque
n = int(eval(input()))
d = defaultdict(list)
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,input().split()))
d[i].append((x-1,bool(y)))
maxi = 0
for i in range(2 ** n):
honest = [-1]*n
que = deque([])
for j in range(n):
if ((i >> j) & 1):
que.append(n-1-j)
honest[n-1-j] = True
flag = True
while que and flag:
v = que.popleft()
for x,y in d[v]:
if honest[x] == -1:
honest[x] = y
if y:
que.append(x)
elif honest[x] != y:
flag = False
break
if flag:
maxi = max(maxi,str(bin(i)).count('1'))
print(maxi) | def judge(bit):
global l
for i in range(n):
if (bit>>i)&1 == 0:
continue
for x,y in l[i]:
if y==1 and (bit>>x)&1==0:
return False
if y==0 and (bit>>x)&1==1:
return False
return True
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))
maxi = 0
for bit in range(2**n):
if judge(bit):
maxi = max(maxi,str(bin(bit)).count('1'))
print(maxi) | p02837 |
from itertools import product
def trueCheck(i,x):
for j in range(1,N+1):
if B[i][j]==1:
if x[j-1]==0:
return 1
elif B[i][j]==0:
if x[j-1]==1:
return 1
return 0
N = int(eval(input()))
A = [0]
B = {i:[-1 for _ in range(N+1)] for i in range(1,N+1)}
for i in range(1,N+1):
A.append(int(eval(input())))
for _ in range(A[-1]):
x,y = list(map(int,input().split()))
B[i][x] = y
cmax = 0
for z in product([0,1],repeat=N):
flag = 0
for i in range(1,N+1):
if z[i-1]==1:
flag = trueCheck(i,z)
if flag==1:break
if flag==0:
cmax = max(cmax,sum(z))
print(cmax) | from itertools import product
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
for i in range(1,N+1):
K = int(eval(input()))
for j in range(K):
G[i].append(list(map(int,input().split())))
cmax = 0
for z in product((0,1),repeat=N):
flag = 0
for i in range(N):
if z[i]==1:
ind = i+1
for [x,y] in G[ind]:
if z[x-1]==y:continue
else:
flag=1
break
if flag==1:
break
if flag==0:
cmax = max(cmax,sum(z))
print(cmax) | p02837 |
#入力
n=int(eval(input()))
xy=[[list(map(int,input().split())) for _ in range(int(eval(input())))] for _ in range(n)]
#bit全探索
ans=0
for i in range(2**n):
flag=True
for j in range(n):
if (i>>j)&1:
for x,y in xy[j]:#j人目の証言と仮定に矛盾がないか調べる
if (i>>(x-1))&1!=y:
flag=False
break
if flag==True:
ans=max(ans,bin(i)[2:].count('1'))
#出力
print(ans) | n,ans=int(eval(input())),0
xy=[[list(map(int,input().split())) for _ in range(int(eval(input())))] for _ in range(n)]
for i in range(2**n):
f=True
for j in range(n):
if (i>>j)&1:
for x,y in xy[j]:
if (i>>(x-1))&1!=y:
f=False
break
if f:
ans=max(ans,bin(i)[2:].count('1'))
print(ans) | p02837 |
N=int(eval(input()))
Ins=[[] for _ in range(N)]
ans=0
#bit演算用にx-1
for i in range(N):
A=int(eval(input()))
for _ in range(A):
x,y=list(map(int,input().split()))
Ins[i].append((x-1,y))
for i in range(2**N):
flag=1
honest=[]
unkind=[]
for j in range(N):
if (i>>j)&1:
honest.append(j)
else:
unkind.append(j)
for k in honest:
for l in Ins[k]:
if l[1]==1 and l[0] in unkind:
flag=0
break
elif l[1]==0 and l[0] in honest:
flag=0
break
if flag==1:
ans=max(ans,len(honest))
print(ans) | N=int(eval(input()))
I=[[] for _ in range(N)]
a=0
for i in range(N):
A=int(eval(input()))
for _ in range(A):
x,y=list(map(int,input().split()))
I[i].append((x-1,y))
for i in range(2**N):
f=1
h=[]
u=[]
for j in range(N):
if (i>>j)&1:
h.append(j)
else:
u.append(j)
for k in h:
for l in I[k]:
if l[1]==1 and l[0] in u:
f=0
break
elif l[1]==0 and l[0] in h:
f=0
break
if f==1:
a=max(a,len(h))
print(a) | p02837 |
def is_right(i):
trueA =bin(i)[2:].zfill(N)
for ii,flag in enumerate(trueA):
if flag == '1':
for x,y in A[ii]:
if trueA[x] != str(y):
return False
return True
N = int(eval(input()))
A = []
for _ in range(N):
a = int(eval(input()))
tmpA = []
for _ in range(a):
x,y = list(map(int,input().split()))
tmpA.append([x-1,y])
A.append(tmpA)
ans = 0
for i in range(2**N):
if is_right(i):
ans = max(ans,bin(i).count('1'))
print(ans) | def is_case_possible(case):
for i, flag in enumerate(case):
if flag == '1':
for x, y in XY[i]:
x -= 1
if case[x] != str(y):
return False
return True
N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(A)]
XY.append(xy)
ans = 0
for i in range(2**N):
case = bin(i)[2:].zfill(N)
if is_case_possible(case):
ans = max(ans, case.count('1'))
print(ans) | p02837 |
N = int(eval(input()))
data = []
for _ in range(N):
A = int(eval(input()))
items = []
for __ in range(A):
x, y = list(map(int, input().split()))
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in range(1 << 2**N):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best) | N = int(eval(input()))
data = []
for _ in range(N):
A = int(eval(input()))
items = []
for __ in range(A):
x, y = list(map(int, input().split()))
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in range(2**N):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best) | p02837 |
N = int(eval(input()))
data = []
for _ in range(N):
A = int(eval(input()))
items = []
for __ in range(A):
x, y = list(map(int, input().split()))
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in range(2**N):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best) | N = int(eval(input()))
data = []
for _ in range(N):
A = int(eval(input()))
items = []
for __ in range(A):
x, y = list(map(int, input().split()))
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
if y !=((i >> x) & 1):return False
return True
for i in reversed(list(range(0, 2**N))):
count=0
for j in range(N):count += ((i >> j) & 1)
if count>best:
if check(i):best = count
print(best) | p02837 |
import itertools
N = int(eval(input()))
all_list = list(itertools.product([0,1], repeat=N))
xy_list =[]
for i in range(N):
for j in range(int(eval(input()))):
x, y = list(map(int, input().split()))
xy_list.append((i+1,x,y))
#print(xy_list)
num_ok = 0
for i in all_list:
#どの人の証言なのか
flag = True
for j in xy_list:
if i[j[0]-1] == 1:
if i[j[1]-1] != j[2]:
flag = False
if flag == True:
if num_ok < i.count(1):
num_ok = i.count(1)
print(num_ok)
|
import itertools
N = int(eval(input()))
all_list = list(itertools.product([0,1], repeat=N))
xy_list =[]
for i in range(N):
for j in range(int(eval(input()))):
x, y = list(map(int, input().split()))
xy_list.append((i+1,x,y))
#print(xy_list)
num_ok = 0
for i in all_list:
#どの人の証言なのか
flag = True
for j in xy_list:
if i[j[0]-1] == 1:
if i[j[1]-1] != j[2]:
flag = False
break
if flag == True:
if num_ok < i.count(1):
num_ok = i.count(1)
print(num_ok)
| p02837 |
from itertools import product
n = int(eval(input()))
data = {}
for p in range(1, n+1):
a = int(eval(input()))
# 人p=1～の証言
data[p] = [list(map(int, input().split())) for _ in range(a)]
# パターン生成
ans = 0
for honest in product(list(range(2)), repeat=n):
for p,hk in enumerate(honest, 1):
if hk == 1:
# 証言の矛盾をチェック
if not all([honest[x-1] == y for x,y in data[p]]):
break
else:
ans = max(ans, sum(honest))
print(ans) | from itertools import product
n = int(eval(input()))
info = {}
for p in range(n):
a = int(eval(input()))
L = []
for _ in range(a):
x,y = list(map(int, input().split()))
x,y = x-1, y
L.append((x,y))
info[p] = L
ans = 0
for bit_pattern in product(list(range(2)), repeat=n):
for p,bit in enumerate(bit_pattern):
if bit:
if not all([bit_pattern[x] == y for x,y in info[p]]):
break
else:
ans = max(ans, sum(bit_pattern))
print(ans) | p02837 |
N = int(eval(input()))
# print("")
# 証言者ごとに整理する
testimony_list = []
for i in range(N):
array = [-1] * N
testimony_list.append(array)
for i in range(N):
A = int(eval(input()))
for j in range(A):
# iさんの、xさんへの証言
x, y = list(map(int, input().split()))
# print("test:{} {}".format(x, y))
# iさんの、xさんへの証言
# print("test:{} {} {}".format(x - 1, i, y))
# print(testimony_list)
testimony_list[i][x - 1] = y
# print(testimony_list)
max_count = 0
failed = False
for i in range(2 ** N):
results = [-1] * N
shoujiki = 0
for j in range(len(testimony_list)):
# check = (i >> j & 1)
# print("チェック: {} {}".format(i, j))
# print(i >> j & 1)
if i >> j & 1:
shoujiki += 1
# print("{}:{}".format(bin(i), j))
array = testimony_list[j]
for k in range(len(array)):
# print(
# "k={} result[k]:array[k] {}:{}".format(
# k, results[k], array[k]))
# print(i >> k & 1)
if not (i >> k & 1) and array[k] == 1:
# print("矛盾2")
failed = True
break
elif (i >> k & 1) and array[k] == 0:
# print("矛盾3")
failed = True
break
if array[k] == -1:
continue
if results[k] == -1:
results[k] = array[k]
elif results[k] != array[k]:
# print("矛盾1")
failed = True
break
if failed is True:
# print("failed")
# results = [-1] * N
break
if failed is True:
failed = False
continue
# print("計算: {}".format(i))
# print(results)
# count = 0
# for result in results:
# if result != -1:
# count += 1
# print(count)
if max_count < shoujiki:
max_count = shoujiki
print(max_count)
| N = int(eval(input()))
# 証言者ごとに整理する
testimony_list = []
for i in range(N):
array = [-1] * N
testimony_list.append(array)
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
# iさんの、xさんへの証言
testimony_list[i][x - 1] = y
max_count = 0
for i in range(2 ** N):
failed = False
for j in range(N):
if not (i >> j & 1):
continue
array = testimony_list[j]
for k in range(N):
if array[k] != -1 and (i >> k & 1) != array[k]:
failed = True
break
if failed is False:
max_count = max(max_count, bin(i)[2:].count("1"))
print(max_count)
| p02837 |
N = int(eval(input()))
# 証言者ごとに整理する
testimony_list = []
for i in range(N):
array = [-1] * N
testimony_list.append(array)
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
# iさんの、xさんへの証言
testimony_list[i][x - 1] = y
max_count = 0
for i in range(2 ** N):
failed = False
for j in range(N):
if not (i >> j & 1):
continue
array = testimony_list[j]
for k in range(N):
if array[k] != -1 and (i >> k & 1) != array[k]:
failed = True
break
if failed is False:
max_count = max(max_count, bin(i)[2:].count("1"))
print(max_count)
| N = int(eval(input()))
# 証言者ごとに整理する
testimony_list = []
for i in range(N):
array = [-1] * N
testimony_list.append(array)
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
# iさんの、xさんへの証言
testimony_list[i][x - 1] = y
max_count = 0
for i in range(2 ** N):
failed = False
for j in range(N):
if not (i >> j & 1):
continue
array = testimony_list[j]
for k in range(N):
if array[k] == -1:
continue
if (i >> k & 1) != array[k]: # 正直者に対して不親切 or 不親切に対して正直者と証言
failed = True
break
if not failed:
# 「0b010110」の「0b」を除外して1の数をカウント
max_count = max(max_count, bin(i)[2:].count("1"))
print(max_count)
| p02837 |
#入力はn人のx,yに分けないといけない
n = int(eval(input()))
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(eval(input())))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
testimony = [[2]*n for i in range(n)]
for i in range(n):
for j in range(a[i]):
if (y[i][j] == 1):
testimony[i][x[i][j] - 1] = 1#正直者ならtestimonyのxの位置に正直者である1を置く
elif(y[i][j] == 0):
testimony[i][x[i][j]-1] = 0#さっきの反対
ans = 0
for i in range(2**n):#2**n通りの「正直者」と「不親切な人」の全パターンを列挙
bit_list = []
for j in range(n):
if ((i >> j) & 1):
bit_list.append(1)#正直者なら
else:
bit_list.append(0)
flag = 1
#列挙した中からtestimony[k][l]と一致するのを探し、さらにその中からbit_listの最大値を求める
for k in range(n):
if(bit_list[k] == 1):
for l in range(n):
if(testimony[k][l] != 2):#２(デフォルト状態じゃないとき)
if(testimony[k][l] != bit_list[l]): #yの人の証言と食い違っていたらflagを0にする
flag = 0
break
if(flag == 1):
ans = max(sum(bit_list),ans)
print(ans) | n = int(eval(input()))
#2**n通りの正直者を全列挙してそれを矛盾が生じないか試していき最大値を求める 競合してる証言をピック True or False で判断する
jud = [[-1 for i in range(n)] for j in range(n)]
xy = []
ayasi = []
for i in range(n):
a = int(eval(input()))
for j in range(a):
x,y = list(map(int,input().split()))
jud[i][x-1] = y
Max = 0
for i in range(2**n):
li = []
flag = True
cnt = 0
for j in range(n):
if ((i >> j) & 1):
li.append(1)
else:
li.append(0)
for k in range(n):
if li[k] == 1:
for l in range(n):
if jud[k][l] != -1:
if jud[k][l] != li[l]:
flag = False
break
if flag:
Max = max(sum(li),Max)
print(Max)
| p02837 |
import itertools
N = int(eval(input()))
syougen_list = []
people = [-1] * N
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1,0], repeat=N):
legal = True
for index, j in enumerate(i):
if j == 1:
syougen = syougen_list[index]
for k in syougen:
if i[k[0] - 1] != k[1]:
legal = False
break
if not legal:
continue
match = True
honest_syougen_list = []
for index, j in enumerate(i):
if j == 1:
honest_syougen_list += syougen_list[index]
for j in honest_syougen_list:
if people[j[0] - 1] == -1:
people[j[0] - 1] = j[1]
elif people[j[0] - 1] != j[1]:
match = False
break
if match:
number = i.count(1)
if number >= output:
output = number
print(output) | import itertools
N = int(eval(input()))
syougen_list = []
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1,0], repeat=N):
legal = True
for index, j in enumerate(i):
if j == 1:
syougen = syougen_list[index]
for k in syougen:
if i[k[0] - 1] != k[1]:
legal = False
break
if not legal:
break
if legal:
number = i.count(1)
if number >= output:
output = number
print(output) | p02837 |
n=int(eval(input()))
a=[[list(map(int,input().split()))for _ in'_'*int(eval(input()))]for _ in'_'*n]
m=0
for i in range(2**n):
*s,=list(map(int,bin(i)[2:].zfill(n)))
f=1
for j,t in enumerate(a):
if s[~j]:
for x,y in t:f&=s[-x]==y
m=max(m,sum(s)*f)
print(m) | i=input
n=int(i())
a=eval('[list(map(int,i().split()))for _ in"_"*int(i())],'*n)
print((max(all(y==i>>x-1&1for j,t in enumerate(a)if i>>j&1for x,y in t)*bin(i).count('1')for i in range(2**n)))) | p02837 |
def main():
n = int(eval(input()))
xy = []
for i in range(n):
a = int(eval(input()))
xy.append([tuple(map(int, input().split())) for _ in range(a)])
c = 0
for i in range(1 << n):
all_honest = True
for j in range(n):
if (1 << j) & i != 0:
for x, y in xy[j]:
x -= 1 # 人の番号をひとつずらす
if ((1 << x) & i) >> x != y:
all_honest = False
break
if not all_honest:
break
if all_honest:
popcnt = bin(i).count('1')
if popcnt > c:
c = popcnt
print(c)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
xy = []
for i in range(n):
a = int(eval(input()))
xy.append([tuple(map(int, input().split())) for _ in range(a)])
c = 0
for i in range(1 << n):
popcnt = bin(i).count('1')
if popcnt <= c:
continue
all_honest = True
for j in range(n):
if (1 << j) & i != 0:
for x, y in xy[j]:
x -= 1 # 人の番号をひとつずらす
if ((1 << x) & i) >> x != y:
all_honest = False
break
if not all_honest:
break
if all_honest:
if popcnt > c:
c = popcnt
print(c)
if __name__ == '__main__':
main()
| p02837 |
def counter(x):
if x == 0:
return 0
return counter(int(bin(x >> 1), 2)) + int(bin(x & 1), 2)
N = int(eval(input()))
A = []
x = [0] * N
for i in range(N):
A.append(int(eval(input())))
x[i] = [list(map(int, input().split())) for j in range(A[i])]
ans = 0
for bits in range(1, int(bin(1 << N), 2)):
flag = 1
for i in range(N):
if not int(bin(bits & int(bin(1 << i), 2)), 2):
continue
for j in range(A[i]):
if int(bin(int(bin(bits >> (x[i][j][0] - 1)), 2) & 1), 2) ^ x[i][j][1]:
flag = 0
if flag:
ans = max(ans, counter(bits))
print(ans) | def counter(x):
if x == 0:
return 0
return counter(x >> 1) + int(bin(x & 1), 2)
N = int(eval(input()))
A = []
x = [0] * N
for i in range(N):
A.append(int(eval(input())))
x[i] = [list(map(int, input().split())) for j in range(A[i])]
ans = 0
for bits in range(1, 1 << N):
flag = 1
for i in range(N):
if not int(bin(bits & (1 << i)), 2):
continue
for j in range(A[i]):
if int(bin((bits >> (x[i][j][0] - 1) & 1) ^ x[i][j][1]), 2):
flag = 0
if flag:
ans = max(ans, counter(bits))
print(ans) | p02837 |
def counter(x):
if x == 0:
return 0
return counter(x >> 1) + int(bin(x & 1), 2)
N = int(eval(input()))
A = []
x = [0] * N
for i in range(N):
A.append(int(eval(input())))
x[i] = [list(map(int, input().split())) for j in range(A[i])]
ans = 0
for bits in range(1, 1 << N):
flag = 1
for i in range(N):
if not int(bin(bits & (1 << i)), 2):
continue
for j in range(A[i]):
if int(bin((bits >> (x[i][j][0] - 1) & 1) ^ x[i][j][1]), 2):
flag = 0
if flag:
ans = max(ans, counter(bits))
print(ans) | def counter(x):
if x == 0:
return 0
return counter(x >> 1) + (x & 1)
N = int(eval(input()))
A = []
x = [0] * N
for i in range(N):
A.append(int(eval(input())))
x[i] = [list(map(int, input().split())) for j in range(A[i])]
ans = 0
for bits in range(1, 1 << N):
flag = 1
for i in range(N):
if not bits & (1 << i):
continue
for j in range(A[i]):
if (bits >> (x[i][j][0] - 1) & 1) ^ x[i][j][1]:
flag = 0
if flag:
ans = max(ans, counter(bits))
print(ans) | p02837 |
from itertools import product
N=int(eval(input()))
data=[]
for i in range(N):
for j in range(int(eval(input()))):
x,y=list(map(int,input().split()))
data.append((i,x-1,y))
#print(data)
ans=0
for i in product([1,0],repeat=N):
#print(i)
s=True
for k in data:
if i[k[0]]==1 and i[k[1]]!=k[2]:
s=False
break
if s:
ans=max(ans,sum(i))
print(ans)
| from itertools import product
N=int(eval(input()))
data=[]
for i in range(N):
for j in range(int(eval(input()))):
x,y=list(map(int,input().split()))
data.append((i,x-1,y)) #iさんがx-1さんに嘘(0)or正直(1)
ans=0
for i in product([0,1],repeat=N):
ok=True
for j in data:
if i[j[0]]==1 and i[j[1]]!=j[2]:
ok = False
break
if ok:
ans=max(ans,sum(i))
print(ans) | p02837 |
n = int(eval(input()))
l = []
for i in range(n):
list = [" "] * n
a = int(eval(input()))
for j in range(a):
data = input().split(" ")
x = int(data[0])
y = data[1]
list[x-1] = y
l.append(list)
m = 0
for i in range(2**n):
s = bin(i)
s = s[2:]
s = s.zfill(n)
ll = []
th = [" "] * n
for j in range(n):
if int(s[j]) == 1:
ll.append(l[j])
th[j] = "1"
elif int(s[j]) == 0:
th[j] = "0"
te = 0
for j in range(n):
cu = "2"
for k in range(len(ll)):
if ll[k][j] == "1" and th[j] != "1":
te = 1
elif ll[k][j] == "0" and th[j] != "0":
te = 1
if ll[k][j] == "1" and cu == "2":
cu = "1"
elif ll[k][j] == "0" and cu == "2":
cu = "0"
elif ll[k][j] == "0" and cu == "1":
te = 1
elif ll[k][j] == "1" and cu == "0":
te = 1
if te == 0:
f = len(ll)
if f > m:
m = f
print(m) | n = int(eval(input()))
l = []
for i in range(n):
list = [" "] * n
a = int(eval(input()))
for j in range(a):
data = input().split(" ")
x = int(data[0])
y = data[1]
list[x-1] = y
l.append(list)
m = 0
for i in range(2**n):
s = bin(i)
s = s[2:]
s = s.zfill(n)
ll = []
th = [" "] * n
for j in range(n):
if int(s[j]) == 1:
ll.append(l[j])
th[j] = "1"
elif int(s[j]) == 0:
th[j] = "0"
te = 0
for j in range(n):
for k in range(len(ll)):
if ll[k][j] == "1" or ll[k][j] == "0":
if ll[k][j] != th[j]:
te = 1
if te == 0:
f = len(ll)
if f > m:
m = f
print(m) | p02837 |
#python3
graph = [[-1 for _ in range(15)] for _ in range(15)]
def main():
n = int(eval(input()))
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
graph[i][x-1] = y
ans = 0
for i in range(1<<15):
h = [0]*15
for k in range(n):
if (i >> k) & 1:
h[k] = 1
f = True
for i in range(15):
if h[i] == 1:
for j in range(n):
if graph[i][j] == -1:
continue
if graph[i][j] != h[j]:
f = False
if f:
ans = max(ans, sum(h))
print(ans)
main() | #python3
def main():
n = int(eval(input()))
g = [[-1 for _ in range(n)] 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()))
g[i][x-1] = y
ans = -1
for i in range(1<<n):
h = [0 for _ in range(n)]
for k in range(n):
if (i>>k) & 1:
h[k] = 1
flag = True
for j in range(n):
if h[j] == 1:
for k in range(n):
if g[j][k] == -1:
continue
if g[j][k] != h[k]:
flag = False
if flag:
ans = max(sum(h), ans)
print(ans)
main() | p02837 |
n = int(eval(input()))
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(eval(input())))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
hoge = [[2]*n for i in range(n)]
for i in range(n):
for j in range(a[i]):
if(y[i][j] == 1):
hoge[i][x[i][j]-1] = 1
elif(y[i][j] == 0):
hoge[i][x[i][j]-1] = 0
ans = 0
b_list = []
for i in range(2**n):
bit_list = []
for j in range(n):
if ((i >> j) & 1):
bit_list.append(1)
else:
bit_list.append(0)
b_list.append(bit_list)
flag = 1
for k in range(n):
if(bit_list[k] == 1):
tmp = 0
for l in range(n):
if(hoge[k][l] != 2):
if(hoge[k][l] != bit_list[l]):
flag = 0
break
if(flag == 1):
tmp = 0
for l in range(n):
if(bit_list[l] == 1):
tmp += 1
if(tmp > ans):
ans = tmp
print(ans)
| n = int(eval(input()))
a = []
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a.append(int(eval(input())))
for j in range(a[i]):
xx, yy = (int(i) for i in input().split())
x[i].append(xx)
y[i].append(yy)
hoge = [[2]*n for i in range(n)]
for i in range(n):
for j in range(a[i]):
if(y[i][j] == 1):
hoge[i][x[i][j]-1] = 1
elif(y[i][j] == 0):
hoge[i][x[i][j]-1] = 0
ans = 0
for i in range(2**n):
bit_list = []
for j in range(n):
if ((i >> j) & 1):
bit_list.append(1)
else:
bit_list.append(0)
flag = 1
for k in range(n):
if(bit_list[k] == 1):
tmp = 0
for l in range(n):
if(hoge[k][l] != 2):
if(hoge[k][l] != bit_list[l]):
flag = 0
break
if(flag == 1):
tmp = 0
for l in range(n):
if(bit_list[l] == 1):
tmp += 1
if(tmp > ans):
ans = tmp
print(ans)
| p02837 |
N=int(eval(input()))
S=[[-1]*N 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][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j]!=-1 and (s>>j&1)!=S[i][j]:
ok=False
if ok:
ans=max(ans, bin(s).count("1"))
print(ans)
| N=int(eval(input()))
A=[[-1]*N 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()))
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans) | p02837 |
N=int(eval(input()))
A=[[-1]*N 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()))
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=-1 and (i>>k&1)!=A[j][k]:
ok=False
if ok:
ans=max(ans, bin(i).count("1"))
print(ans) | N=int(eval(input()))
#正直者も発言に矛盾が生じない
L=[[-1]*N for _ in range(N)]
for i in range(N):
A=int(eval(input()))
for a in range(A):
x,y=list(map(int, input().split()))
L[i][x-1]=y
ans=0
for b in range(2**N):
ok=True
for i in range(N):
if b>>i&1==1:
l=L[i]
for j,x in enumerate(l):
if x!=-1 and b>>j&1!=x:
ok=False
if ok:
ans=max(ans, bin(b).count("1"))
print(ans)
| p02837 |
def honestcount(i):
return bin(i).count("1")
def is_honest(i,j):
return (i>>j)%2 == 1
N = int(eval(input()))
A = [0] * N
shogens=[]
for i in range(N):
a = int(eval(input()))
shogen=[]
for j in range(a):
x,y = list(map(int, input().split()))
shogen.append((x-1,y))
shogens.append(shogen)
# print(shogens)
count=0
for i in range(1<<N):
is_ok =True
for j in range(N):
if not is_honest(i,j):
continue
for x,y in shogens[j]:
if y!=is_honest(i,x): is_ok=False
if is_ok:
count=max(count,honestcount(i))
print(count)
| def honestcount(i):
return bin(i).count("1")
def is_honest(i,j):
return (i>>j)%2 == 1
N = int(eval(input()))
A = [0] * N
shogens=[]
for i in range(N):
a = int(eval(input()))
shogen=[]
for j in range(a):
x,y = list(map(int, input().split()))
shogen.append((x-1,y))
shogens.append(shogen)
# print(shogens)
count=0
for i in range(1<<N):
is_ok =True
for j in range(N):
if not is_honest(i,j):
continue
for x,y in shogens[j]:
if y!=is_honest(i,x):
is_ok=False
break
if is_ok:
count=max(count,honestcount(i))
print(count)
| p02837 |
def main():
N = int(eval(input()))
A = [int()] * 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]):
xij, yij = list(map(int, input().split()))
x[i].append(xij - 1)
y[i].append(yij)
ans = 0
for b in range(1 << N):
flg = True
for i in range(N):
if not b & 1 << i:
continue
for j in range(A[i]):
if 1 & b >> x[i][j] ^ y[i][j]:
flg = False
break
if not flg:
break
if flg:
ans = max(ans, bin(b)[2:].count("1"))
print(ans)
return
main()
| def main():
N = int(eval(input()))
A = [int()] * 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]):
xij, yij = list(map(int, input().split()))
x[i].append(xij - 1)
y[i].append(yij)
ans = 0
for b in range(1 << N):
flg = True
for i in range(N):
if not b & 1 << i:
continue
for j in range(A[i]):
if 1 & b >> x[i][j] ^ y[i][j]:
flg = False
break
if not flg:
break
if flg:
ans = max(ans, bin(b).count("1"))
print(ans)
return
main()
| p02837 |
def resolve():
N = int(eval(input()))
L = [[] for i 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, y))
ans = 0
for p in range(1, 2**N):
isOk = True
for i in range(N):
for x, y in L[i]:
if p & (1 << i):
if p & 1 << (x-1) and not y:
isOk = False
break
elif not(p & 1 << (x-1)) and y:
isOk = False
break
if not isOk:
break
if isOk:
ans = max(ans, bin(p).count('1'))
print(ans)
if __name__ == '__main__':
resolve()
| def resolve():
N = int(eval(input()))
L = [[] for i 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, y))
ans = 0
for p in range(2**N):
ok = True
for i in range(N):
for x, y in L[i]:
if p & (1 << i):
if p & (1 << (x-1)) > 0 and y == 0:
ok = False
break
elif p & (1 << (x-1)) == 0 and y == 1:
ok = False
break
if not ok:
break
if ok:
ans = max(ans, bin(p).count('1'))
print(ans)
if __name__ == '__main__':
resolve()
| p02837 |
n = int(eval(input()))
a = []
for _ in range(n):
m = int(eval(input()))
a.append([list(map(int, input().split())) for _ in range(m)])
ans = 0
for i in range(2**n):
for j in range(n):
if ((i >> j) & 1) == 1:
for k,l in a[j]:
if ((i >> (k-1)) & 1) != l:
break
else:
continue
break
else:
ans = max(ans,bin(i).count('1'))
print(ans) | n = int(eval(input()))
evi = []
for _ in range(n):
m = int(eval(input()))
evi.append([list(map(int, input().split())) for _ in range(m)])
ans = 0
for i in range(1 << n):
for j in range(n):
if ((i >> j) & 1) == 1:
for x,y in evi[j]:
if ((i >> (x-1))&1) != y:
break
else:
continue
break
else:
ans = max(ans,bin(i).count('1'))
print(ans) | p02837 |
n = int(eval(input()))
v = [[tuple(map(int, input().split()))for i in range(int(eval(input())))]
for i in range(n)]
ans = 0
for i in range(2**n):
f = [0] * n
xy = []
for j in range(n):
if (i >> j) & 1:
f[j] = 1
xy.append(v[j])
flag = True
for xyi in xy:
for x, y in xyi:
#print(f,x,y,bin(i))
if (i>>(x-1))&1 != y:
flag = False
break
if flag:
ans = max(ans, len(xy))
print(ans)
| n = int(eval(input()))
v = [[tuple(map(int, input().split()))for i in range(int(eval(input())))]
for i in range(n)]
ans = 0
for i in range(2**n):
f = True
a = 0
for j in range(n):
if (i >> j) & 1:
if all(i >> (x - 1) & 1 == y for x, y in v[j]):
a += 1
else:
f = False
break
if f:
ans = max(ans, a)
print(ans)
| p02837 |
n = int(eval(input()))
XY = []
ans = 0
for i in range(n):
z = []
for j in range(int(eval(input()))):
x,y = list(map(int,input().split()))
z.append([x,y])
XY.append(z)
for i in range(2**n):
honest = 0
mujunn = 0
for j in range(n):
if (i>>j) & 1:
honest += 1
for k in XY[j]:
x = k[0] - 1
y = k[1]
if (i>>x)&1 != y:
mujunn = 1
if mujunn == 0:
ans = max(ans,honest)
print(ans) | n = int(eval(input()))
XY = []
ans = 0
for i in range(n):
z = []
for j in range(int(eval(input()))):
x,y = list(map(int,input().split()))
z.append([x,y])
XY.append(z)
for i in range(2**n):
honest = 0
mujunn = 0
for j in range(n):
if (i>>j) & 1:
honest += 1
for k in XY[j]:
x = k[0] - 1
y = k[1]
if (i>>x)&1 != y:
mujunn = 1
break
if mujunn == 1:
break
if mujunn == 0:
ans = max(ans,honest)
print(ans) | p02837 |
N = int(eval(input()))
T = [[-1] * N for _ in range(N)]
for i in range(N):
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
T[i][x - 1] = y
ans = 0
for i in range(1 << N):
is_kind = [i >> j & 1 for j in range(N)]
found = True
for j in range(N):
if not is_kind[j]:
continue
for k in range(N):
if j == k or T[j][k] == -1 or T[j][k] == is_kind[k]:
continue
found = False
if found:
ans = max(ans, sum(is_kind))
print(ans)
| N = int(eval(input()))
T = [[-1] * N for _ in range(N)]
for i in range(N):
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
T[i][x - 1] = y
ans = 0
for i in range(1 << N):
is_kind = [i >> j & 1 for j in range(N)]
found = True
for j in range(N):
if not is_kind[j]:
continue
for k in range(N):
if j == k or T[j][k] == -1 or T[j][k] == is_kind[k]:
continue
found = False
if not found:
break
if found:
ans = max(ans, sum(is_kind))
print(ans)
| p02837 |
N = int(eval(input()))
T = [[-1] * N for _ in range(N)]
for i in range(N):
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
T[i][x - 1] = y
ans = 0
for i in range(1 << N):
is_kind = [i >> j & 1 for j in range(N)]
found = True
for j in range(N):
if not is_kind[j]:
continue
for k in range(N):
if j == k or T[j][k] == -1 or T[j][k] == is_kind[k]:
continue
found = False
if not found:
break
if found:
ans = max(ans, sum(is_kind))
print(ans)
| N = int(eval(input()))
T = []
for i in range(N):
for _ in range(int(eval(input()))):
x, y = list(map(int, input().split()))
T.append((i, x - 1, y))
ans = 0
for i in range(1 << N):
is_kind = [i >> j & 1 for j in range(N)]
if all(not is_kind[j] or is_kind[x] == y for j, x ,y in T):
ans = max(ans, sum(is_kind))
print(ans)
| p02837 |
from itertools import product
n = int(eval(input()))
a = []
xy = []
for _ in range(n):
a_tmp = int(eval(input()))
a.append(a_tmp)
xy_tmp = []
for _ in range(a_tmp):
xy_tmp.append(list(map(int, input().split())))
xy.append(xy_tmp)
ans = 0
for pat in product([1, 0], repeat=n):
sat = True
for i, bl in enumerate(pat):
if bl:
for x, y in xy[i]:
x -= 1
if pat[x] != y:
sat = False
if sat:
cnt = sum(pat)
ans = max(ans, cnt)
print(ans)
| from itertools import product
n = int(eval(input()))
a = []
xy = []
for _ in range(n):
ea = int(eval(input()))
new = []
for _ in range(ea):
x, y = list(map(int, input().split()))
x -= 1
new.append([x, y])
xy.append(new)
ans = 0
for pat in product([1, 0], repeat=n):
bl = True
for i, e in enumerate(pat):
if e:
for x, y in xy[i]:
if pat[x] != y:
bl = False
if bl:
ans = max(ans, sum(pat))
print(ans)
| p02837 |
from itertools import combinations
import sys
N = int(eval(input()))
A = [[] for _ in range(N + 1)]
B = [[] for _ in range(N + 1)]
C = [[] for _ in range(N + 1)]
num_hint = []
# hint_dict = {}
for i in range(1, N + 1):
num_i = int(eval(input()))
num_hint.append(num_i)
for j in range(num_i):
x, y = list(map(int, input().split()))
A[i].append((x, y))
if y == 1:
B[i].append(x)
if y == 0:
C[i].append(x)
# if hint_dict.get(x) is None:
# hint_dict[x] = {0: [], 1: []}
# hint_dict[x][y].append(i)
# else:
# hint_dict[x][y].append(i)
for i in range(N + 1, 0, -1):
for combi in combinations(list(range(1, N + 1)), i):
remain = set(range(1, N + 1)) - set(combi)
s = set()
t = set()
hint_dict = {}
for j in combi:
s |= set(B[j])
t |= set(C[j])
for x, y in A[j]:
if hint_dict.get(x) is None:
hint_dict[x] = {0: [], 1: []}
hint_dict[x][y].append(i)
else:
hint_dict[x][y].append(i)
good1 = True
for value in list(hint_dict.values()):
if len(value[0]) != 0 and len(value[1]) != 0:
good1 = False
break
good2 = True
if len(s & remain) != 0:
good2 = False
good3 = True
if len(t & set(combi)) != 0:
good3 = False
if good1 and good2 and good3:
print(i)
sys.exit()
print((0))
| N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
tmp = []
for _ in range(A):
x, y = list(map(int, input().split()))
tmp.append((x - 1, y))
XY.append(tmp)
def judge(bit):
for i in range(N):
if not (bit & (1 << i)):
continue
for x, y in XY[i]:
if y == 1 and (not (bit & (1 << x))):
return False
if y == 0 and (bit & (1 << x)):
return False
return True
ans = 0
for bit in range(1 << N):
if (judge(bit)):
# print('bit', bit, bin(bit))
cnt = 0
for i in range(N):
if (bit & (1 << i)):
cnt += 1
ans = max(ans, cnt)
print(ans)
| p02837 |
import re
n=int(eval(input()))
A=[]
for i in range(n):
B=["."]*n
for x,y in [list(map(int,input().split())) for k in range(int(eval(input())))]:
B[x-1]=str(y)
A.append("".join(B))
ans=0
for i in range(2**n):
num=format(i,"b").zfill(n)
cnt,flag=0,1
for k,j in enumerate(num):
result=re.search(r"".join(A[k]),num)
if result!=None and j=="1":
cnt +=1
elif (result!=None and j=="0") or (result==None and j=="1"):
flag=0
break
if flag:
ans=max(ans,cnt)
print(ans) | import re
n=int(eval(input()))
A=[]
for i in range(n):
B=["."]*n
for x,y in [list(map(int,input().split())) for k in range(int(eval(input())))]:
B[x-1]=str(y)
A.append("".join(B))
ans=0
for i in range(2**n):
num=format(i,"b").zfill(n)
cnt,flag=0,1
for k,j in enumerate(num):
result=re.search(r"".join(A[k]),num)
if result is not None and j=="1":
cnt +=1
elif (result is not None and j == "0") or (result is None and j == "1"):
flag=0
break
if flag:
ans=max(ans,cnt)
print(ans) | p02837 |
import re
n=int(eval(input()))
A=[]
for i in range(n):
B=["."]*n
for x,y in [list(map(int,input().split())) for k in range(int(eval(input())))]:
B[x-1]=str(y)
A.append("".join(B))
ans=0
for i in range(2**n):
num=format(i,"b").zfill(n)
cnt,flag=0,1
for k,j in enumerate(num):
result=re.search(r"".join(A[k]),num)
if result!=None and j=="1":
cnt +=1
elif (result!=None and j=="0") or (result==None and j=="1"):
flag=0
break
if flag:ans=max(ans,cnt)
print(ans) | import re
n=int(eval(input()))
A=[]
for i in range(n):
word=["."]*n
for j in range(int(eval(input()))):
x,y=list(map(int,input().split()))
word[x-1]=str(y)
A.append(word)
ans=0
for i in range(2**n):
num=format(i, "b").zfill(n)
flag,cnt=1,0
for j,k in enumerate(num):
search=re.search(r"".join(A[j]),num)
if search!=None and k=="1":
cnt +=1
elif (search==None and k=="1") or (search!=None and k=="0"):
flag=0
break
if flag:ans=max(ans,cnt)
print(ans) | p02837 |
N = int(eval(input()))
state = [[-1] * N for i in range(N)]
for index in range(N):
Ai = int(eval(input()))
for naka in range(Ai):
x, y = list(map(int, input().split()))
state[index][x - 1] = y
# state[index][naka] = [x, y]
# print(state)
maxx = 0
for index in range(2 ** N):
# print(index)
person = index
tempM = 0
Ai = 0
ok = 1
while person > 0:
if person % 2 == 1:
tempM += 1
for i in range(N):
if state[Ai][i] != -1:
# print(str(Ai) + " " + str(i))
# print(str(state[Ai][i]) + " " + str((index // (2 ** i)) % 2))
# print()
if state[Ai][i] != (index // (2 ** i)) % 2:
ok = 0
person //= 2
Ai += 1
if ok == 1:
maxx = max(maxx, tempM)
print(maxx) | N = int(eval(input()))
state = [[-1] * N for i in range(N)]
for index in range(N):
Ai = int(eval(input()))
for naka in range(Ai):
x, y = list(map(int, input().split()))
state[index][x - 1] = y
# state[index][naka] = [x, y]
# print(state)
maxx = 0
for index in range(1, 2 ** N):
# print(index)
person = index
tempM = 0
Ai = 0
ok = 1
while person > 0:
if ok == 0:
break
if person % 2 == 1:
tempM += 1
for i in range(N):
if state[Ai][i] != -1:
# print(str(Ai) + " " + str(i))
# print(str(state[Ai][i]) + " " + str((index // (2 ** i)) % 2))
# print()
if state[Ai][i] != (index // (2 ** i)) % 2:
ok = 0
break
person //= 2
Ai += 1
if ok == 1:
maxx = max(maxx, tempM)
print(maxx) | p02837 |
N = int(eval(input()))
A = [0]*N
X = []
Y = []
for i in range(N):
A[i] = int(eval(input()))
X.append([])
Y.append([])
for j in range(A[i]):
x, y = list(map(int, input().split()))
X[i].append(x-1)
Y[i].append(y)
ans = 0
for bit in range(1<<N):
honest = 0
ok = True
for i in range(N):
if bit&(1<<i):
honest += 1
for j in range(A[i]):
if Y[i][j] == 0:
if bit&(1<<X[i][j]):
ok = False
break
else:
if not bit&(1<<X[i][j]):
ok = False
break
if not ok:
break
if ok:
ans = max(ans, honest)
print(ans) | N = int(eval(input()))
XY = [[] for _ in range(N)]
for i in range(N):
A = int(eval(input()))
for _ in range(A):
x, y = list(map(int, input().split()))
XY[i].append((x-1,y))
ans = 0
for bit in range(1<<N):
cnt = bin(bit).count('1')
ok = True
for i in range(N):
if bit&(1<<i):
for x,y in XY[i]:
if y == 1:
if not bit&(1<<x):
ok = False
break
else:
if bit&(1<<x):
ok = False
break
if not ok:
break
if ok:
ans = max(ans, cnt)
print(ans) | p02837 |
import itertools
n=int(eval(input()))
la=[]
for _ in range(n):
d=int(eval(input()))
for dd in range(d):
x,y=list(map(int,input().split()))
la.append([_,x-1,y])
ans=0
for i in itertools.product([0,1],repeat=n):
s=sum(list(i))
for l in la:
if i[l[0]]==1 and i[l[1]]!=l[2]:
break
else:
ans=max(ans,s)
print(ans) | 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 |
N=int(eval(input()))
honest=[0 for i in range(N)]
liar=[0 for i 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==0:
liar[i]|=(1<<(x-1))
else:
honest[i]|=(1<<(x-1))
ans=0
for i in range(2**N):
# 1ループ＝正直者・不親切者の1パターン＝iをビット化したもの
ok=True
for j in range(N):
# j番目が正直者であるパターン
if (i>>j)&1:
hon=honest[j]
pat=i
while hon>0:
if hon&1==1 and pat&1==0:
ok=False
break
hon>>=1
pat>>=1
li=liar[j]
pat=i
while li>0:
if li&1==1 and pat&1==1:
ok=False
break
li>>=1
pat>>=1
if not ok:
break
if ok:
val=i
cnt=0
while val>0:
if val&1==1:
cnt+=1
val>>=1
ans=max(ans,cnt)
print(ans) | N=int(eval(input()))
honest=[0 for i in range(N)]
liar=[0 for i 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==0:
liar[i]|=(1<<(x-1))
else:
honest[i]|=(1<<(x-1))
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j)&1:
hon=honest[j]
pat=i
while hon>0:
if hon&1==1 and pat&1==0:
ok=False
break
hon>>=1
pat>>=1
li=liar[j]
pat=i
while li>0:
if li&1==1 and pat&1==1:
ok=False
break
li>>=1
pat>>=1
if not ok:
break
if ok:
val=i
cnt=0
while val>0:
if val&1==1:
cnt+=1
val>>=1
ans=max(ans,cnt)
print(ans)
| p02837 |
import sys
input = sys.stdin.readline
N, = list(map(int, input().split()))
rs = []
for _ in range(N):
A, = list(map(int, input().split()))
ts, fs = set(), set()
for _ in range(A):
x, y = list(map(int, input().split()))
if y:
ts.add(x-1)
else:
fs.add(x-1)
rs.append((ts, fs))
r = 0
for i in range(2**N):
i = i+2**N
bi = bin(i)[3:]
ok = True
for j in range(N):
if int(bi[j]):
for t in rs[j][0]:
if not int(bi[t]):
ok = False
for t in rs[j][1]:
if int(bi[t]):
ok = False
if ok:
r = max(r, bi.count("1"))
print(r)
| import sys
input = sys.stdin.readline
N, = list(map(int, input().split()))
rs = []
for _ in range(N):
A, = list(map(int, input().split()))
ts, fs = set(), set()
for _ in range(A):
x, y = list(map(int, input().split()))
if y:
ts.add(x-1)
else:
fs.add(x-1)
rs.append((ts, fs))
r = 0
for i in range(2**N):
ok = True
c = 0
for j in range(N):
if (i>>j) % 2:
for t in rs[j][0]:
if not (i>>t) % 2:
ok = False
for t in rs[j][1]:
if (i>>t) % 2:
ok = False
c += 1
if ok:
r = max(r, c)
print(r)
| p02837 |
n=int(eval(input()))
a=[]
x=[]
for _ in range(n):
A=int(eval(input()))
X=[list(map(int,input().split())) for _ in range(A)]
a.append(A)
x.append(X)
ans=0
for i in range(2**n):
tmp=[0]*n
for j in range(n):
if (i>>j)&1:
tmp[j]=1
for k in range(n):
if a[k]==0:
continue
for h in range(a[k]):
hito=x[k][h][0]-1
singi=x[k][h][1]
if tmp[k]==1:
if tmp[hito]!=singi:
break
else:
continue
break
else:
ans=max(ans,sum(tmp))
print(ans)
| n=int(eval(input()))
a=[]
x=[]
for _ in range(n):
A=int(eval(input()))
X=[list(map(int,input().split())) for _ in range(A)]
a.append(A)
x.append(X)
ans=0
for i in range(2**n):
tmp=[0]*n
for j in range(n):
if (i>>j)&1:
tmp[j]=1
for k in range(n):
# if a[k]==0:
# continue
for h in range(a[k]):
hito=x[k][h][0]-1
singi=x[k][h][1]
if tmp[k]==1:
if tmp[hito]!=singi:
break
else:
continue
break
else:
ans=max(ans,sum(tmp))
print(ans)
| p02837 |
n = int(eval(input()))
XY = []
for i in range(n):
a = int(eval(input()))
xy = []
for j in range(a):
xy.append(list(map(int, input().split())))
XY.append(xy)
def check(i, xiyj, HoU):
# 矛盾したらFalse 正直者と仮定した証言より 正直&正直者と仮定されている / 不親切&不親切と仮定されている True
if ((i >> xiyj) & 1) ^ HoU:
return False
return True
max_honest = 0
for i in range(2 ** len(XY)):
count = 0
is_contradiction = True
for j in range(len(XY)):
# 正直者と仮定したときだけ採用
if not ((i >> j) & 1): continue
for k in range(len(XY[j])):
xiyj = XY[j][k][0] - 1
HoU = XY[j][k][1]
if not check(i, xiyj, HoU):
is_contradiction = False
break
if not is_contradiction:
break
if is_contradiction:
for j in range(len(XY)):
if ((i >> j) & 1): count+=1
if count > max_honest:
max_honest =count
print(max_honest) | n = int(eval(input()))
XY = []
for i in range(n):
a = int(eval(input()))
xy = []
for j in range(a):
xy.append(list(map(int, input().split())))
XY.append(xy)
"""
矛盾したらFalse
矛盾しなければTrue
正直者と仮定した者の証言
正直&正直者と仮定されている
不親切&不親切と仮定されている
"""
def check(i, xiyj, HoU):
# XOR
if HoU ^ ((i >> xiyj) & 1):
return False
return True
max_honest = 0
for i in range(2 ** len(XY)):
count = 0
is_contradiction = True
for j in range(len(XY)):
# 正直者と仮定したときだけ採用
if not ((i >> j) & 1): continue
count+=1
for k in range(len(XY[j])):
xiyj = XY[j][k][0] - 1
HoU = XY[j][k][1]
if not check(i, xiyj, HoU):
is_contradiction = False
break # TLE対策
if not is_contradiction:
break # TLE対策
# 矛盾がなく、正直者の数が更新できれば更新
if is_contradiction and (count > max_honest):
max_honest =count
print(max_honest) | p02837 |
def c_honest_or_unkind_2():
N = int(eval(input()))
Answers = []
for _ in range(N):
a = int(eval(input()))
Answers.append([[int(i) for i in input().split()] for j in range(a)])
# print(Answers)
ret = -1
for bits in range(1 << N):
honests = set()
unkinds = set()
for k in range(N):
if (bits >> k) & 1 == 1:
honests.add(k)
else:
unkinds.add(k)
# print(honests, unkinds, end=' ')
is_contradict = False
for k, answer in enumerate(Answers):
if k not in honests:
continue
for x, y in answer:
x -= 1
if (y == 1 and x in unkinds) or (y == 0 and x in honests):
# print(k, x, y)
is_contradict = True
break
if is_contradict:
break
else:
# print(honests)
ret = max(ret, len(honests))
return ret
print((c_honest_or_unkind_2())) | def c_honest_or_unkind_2():
N = int(eval(input()))
Answers = []
for _ in range(N):
a = int(eval(input()))
Answers.append([[int(i) for i in input().split()] for j in range(a)])
ret = -1
for bits in range(1 << N):
honests = set()
for k in range(N):
if (bits >> k) & 1 == 1:
honests.add(k)
is_contradict = False
for k, answer in enumerate(Answers):
if k not in honests:
continue # k 人目は不親切な人としたので証言を調べない
for x, y in answer:
x -= 1
# 証言に矛盾が生じた
if (y == 0 and x in honests) or (y == 1 and not x in honests):
is_contradict = True
break
if is_contradict:
break # 1つでも矛盾があれば全証言に矛盾があるとする
else:
# 全証言に矛盾がなかったので正直者の人数を更新する
ret = max(ret, len(honests))
return ret
print((c_honest_or_unkind_2())) | p02837 |
N = int(eval(input()))
a = [[] for _ in range(N)]
for i in range(N):
A_i = int(eval(input()))
for j in range(A_i):
a[i].append(list(map(int, input().split())))
max_honest = 0
for i in range(2**N):
contradiction = False
honest_p = []
unkind_p = []
doubt_honest_p = []
doubt_unkind_p = []
length = len(format(2**N-1, "b"))
bin_num = format(i, "b").zfill(length)
for j in range(length):
if (i >> j) & 1:
if not j+1 in honest_p:
honest_p.append(j+1)
if not j+1 in doubt_honest_p:
doubt_honest_p.append(j+1)
for k in a[j]:
p = k[0]
t = k[1]
if t:
if not p in honest_p:
honest_p.append(p)
else:
if not p in unkind_p:
unkind_p.append(p)
else:
if not j+1 in unkind_p:
unkind_p.append(j+1)
if not j+1 in doubt_unkind_p:
doubt_unkind_p.append(j+1)
if len(list(set(honest_p) & set(unkind_p))) != 0:
contradiction = True
if not contradiction and max_honest <= len(doubt_honest_p):
max_honest = len(doubt_honest_p)
print(max_honest) | N = int(eval(input()))
a = [[] for _ in range(N)]
for i in range(N):
A_i = int(eval(input()))
for j in range(A_i):
a[i].append(list(map(int, input().split())))
max_person = 0
for i in range(2**N):
judge = True
bin_num = bin(i)
times = 0
end = False
for j in reversed(bin_num):
if j == "b":
break
if j == "1":
for k in a[times]:
if ((i >> k[0]-1) & 1) != k[1]:
judge = False
times += 1
true_person = bin_num.count("1")
if judge == True:
max_person = max(max_person, true_person)
print(max_person) | p02837 |
import sys
from collections import deque
readline = sys.stdin.readline
N = int(readline())
testimonies = [[[], []] for _ in range(N)]
# testimonies = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(readline())
for _ in range(A):
x, y = list(map(int, readline().rstrip().split()))
testimonies[i][y].append(x-1)
# testimonies[i][x-1] = y
def check(honest_persons):
"""矛盾がないか検証する"""
honest_checked = set(honest_persons) # 宛先を確認済みの正直者の人
honest_stack = deque(honest_persons) # 宛先を確認する正直者の人の待ち行列
honest, liers = honest_persons[:], [] # 正直者の人, 不親切な人
# 正直者の人の証言も元に、正直者の人/不親切な人を追加していく
while len(honest_stack) > 0:
honest_person = honest_stack.popleft()
honest_checked.add(honest_person)
next_honest_persons = testimonies[honest_person][1]
# 検証済み以外の人をstackする
for person in next_honest_persons:
if person not in honest_checked:
honest_stack.append(person)
honest += testimonies[honest_person][1]
liers += testimonies[honest_person][0]
# 矛盾がなければOK
if len(set(honest) & set(liers)) == 0:
return True
else:
return False
def main():
# bit全探索する
ans = 0
has_checked = []
for i in range(1, 2**N):
comb = bin(i)[2:].zfill(N)
honest_persons = [p for p, c in enumerate(comb) if c == '1']
flag = False
for checked in has_checked:
if checked < set(honest_persons):
flag = True
break
if flag:
continue
if check(honest_persons):
ans = max(ans, sum(list(map(int, list(comb)))))
else:
has_checked.append(set(honest_persons))
print(ans)
if __name__ == '__main__':
main() | import sys
N = int(sys.stdin.readline())
testimonies = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(sys.stdin.readline())
for _ in range(A):
x, y = list(map(int, sys.stdin.readline().rstrip().split()))
testimonies[i][x-1] = y
def check(honest_persons):
flag = True
for i in range(N):
if honest_persons[i]:
for j in range(N):
if testimonies[i][j] == -1:
continue
if testimonies[i][j] != honest_persons[j]:
flag = False
break
return flag
def main():
ans = 0
for i in range(1, 2**N):
honest_persons = bin(i)[2:].zfill(N)
honest_persons = list(map(int, list(honest_persons)))
if check(honest_persons):
ans = max(ans, sum(honest_persons))
print(ans)
if __name__ == '__main__':
main() | p02837 |
import sys
N = int(sys.stdin.readline())
testimonies = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(sys.stdin.readline())
for _ in range(A):
x, y = list(map(int, sys.stdin.readline().rstrip().split()))
testimonies[i][x-1] = y
def check(honest_persons):
flag = True
for i in range(N):
if honest_persons[i]:
for j in range(N):
if testimonies[i][j] == -1:
continue
if testimonies[i][j] != honest_persons[j]:
flag = False
break
return flag
def main():
ans = 0
for i in range(1, 2**N):
honest_persons = bin(i)[2:].zfill(N)
honest_persons = list(map(int, list(honest_persons)))
if check(honest_persons):
ans = max(ans, sum(honest_persons))
print(ans)
if __name__ == '__main__':
main() | import sys
N = int(sys.stdin.readline())
testimonies = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(sys.stdin.readline())
for _ in range(A):
x, y = list(map(int, sys.stdin.readline().rstrip().split()))
testimonies[i][x-1] = y
def check(honest_persons):
flag = True
for i in range(N):
if honest_persons[i]:
for j in range(N):
if testimonies[i][j] == -1:
continue
if testimonies[i][j] != honest_persons[j]:
flag = False
break
else:
continue
break
return flag
def main():
ans = 0
for i in range(1, 2**N):
honest_persons = bin(i)[2:].zfill(N)
honest_persons = list(map(int, list(honest_persons)))
if check(honest_persons):
ans = max(ans, sum(honest_persons))
print(ans)
if __name__ == '__main__':
main() | p02837 |
n=int(eval(input()))
xy=[[] for i in range(n)]
for i in range(n):
a=int(eval(input()))
for j in range(a):
x,y=list(map(int,input().split()))
xy[i].append([x,y])
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
ok=True
for j in range(n):
if ok==False:break
if i&(1<<j):
for x,y in xy[j]:
if y==1 and i&(1<<x-1)==0:
ok=False
if y==0 and i&(1<<x-1):
ok=False
if ok:
ans=max(cnt,ans)
print(ans)
| n=int(eval(input()))
xy=[[] for i 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
xy[i].append((x,y))
ans=0
for i in range(1<<n):
cnt=bin(i).count("1")
if cnt<=ans:continue
for j in range(n):
if i&(1<<j):
for x,y in xy[j]:
if y==1 and i&(1<<x):continue
if y==0 and i&(1<<x)==0:continue
break
else:
continue
break
else:
ans=cnt
print(ans)
| p02837 |
#ABC-147
#参考 https://atcoder.jp/contests/abc147/submissions/8896111
N = int(eval(input()))
evidences = [[] for i 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):
#すでに矛盾するパターンのiとわかっているならば飛ばす。
if consistent == False:
break
#jが正しいと仮定する。(もし0ならcontinueで飛ばされる。)
if (i >> j) & 1 == 0:
continue
#jの証言を一個ずつ確認していく。
for x, y in evidences[j]:
if (i >> x) & 1 != y:
consistent = False
break
#全ての人の証言で矛盾がないパターンのiだったら、1の数(=正直者の数)をresultに記録しておく。
if consistent == True:
result = max(result, bin(i)[2:].count("1"))
print(result) | N = int(eval(input()))
memo = [[] for _ in range(N)]
ans = 0
for i in range(N):
A = int(eval(input()))
for _ in range(A):
#配列が0始まりなので、xは-1して使用する
x, y = list(map(int, input().split()))
memo[i].append((x,y))
# print(memo)
for i in range(2**N):
# print(i)#test
flag = True
for j in range(N):
# bitが1の人の証言を確認していく。
if i >> j & 1:
for evidence in memo[j]:
check_evidence = int(bin(i >> (evidence[0]-1))[-1])
if check_evidence != evidence[1]:
# print(check_evidence==evidence[1])
flag = False
break
if not flag:
break
if flag:
bin_i = bin(i)
ans = max(ans, bin_i.count("1"))
print(ans)
| p02837 |
n = int(eval(input()))
l = [[] for i 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, y])
ans = 0
for b in range(1 << n): # 正直者か不親切か全ての設定パターンを作る。
cnt = bin(b).count("1")
judge = True
for j in range(n):
if judge == False: #矛盾があれば、ループを止める。
break
if b & (1 << j) != 0: # j番目の人が正直者設定なら進む。
for x, y in l[j]:
if y == 1 and b & (1 << x - 1) == 0: # 証言:正直者、設定:不親切の場合
judge = False
if y == 0 and b & (1 << x - 1) != 0: # 証言:不親切、設定:正直者の場合
judge = False
if judge == True:
ans = max(cnt, ans)
print(ans) | n = int(eval(input()))
xy = [[] for _ in range(n)]
ans = 0
for i in range(n): #証言者 i人目
a = int(eval(input()))
for j in range(a): #i人目の証言者のj番目の証言
x, y = list(map(int, input().split()))
xy[i].append([x, y])
for b in range(1 << n): #設定上、正直者か不親切かの全パターンを探索
cnt = bin(b).count("1") #正直者設定の人数をカウント
judge = True
for i in range(n):
if judge == False:
break
if b & (1 << i) != 0: #i番目の証言者が正直者設定の場合
for x, y in xy[i]:
if y == 1 and b & (1 << x - 1) == 0:
#証言:正直者、設定:不親切の場合
judge = False
if y == 0 and b & (1 << x - 1) != 0:
#証言:不親切、設定:正直者の場合
judge = False
if judge == True:
ans = max(ans, cnt)
print(ans) | p02837 |
n = int(eval(input()))
l = [[] for _ in range(n)]
ans = 0
for i in range(n):
a = int(eval(input()))
for j in range(a):
xy = input().split()
l[i].append(list(map(int, xy)))
for i in range(2**n):
judge = True
for j in range(n):
if i & (1 << j): #証言者が正直者設定なら進む。
for x, y in l[j]:
if y == 0 and i & 1 << (x - 1): #証言:不親切 設定:親切
judge = False
if y == 1 and i & 1 << (x - 1) == 0: #証言:正直、設定:不親切
judge = False
if judge == True:
cnt = bin(i).count("1")
ans = max(ans, cnt)
print(ans) | n = int(eval(input()))
l = [[] for _ in range(n)]
ans = 0
for i in range(n):
a = int(eval(input()))
for j in range(a):
xy = input().split()
l[i].append(list(map(int, xy)))
for i in range(2**n):
judge = True
for j in range(n):
if judge == False:
break
if i & (1 << j): #証言者が正直者設定なら進む。
for x, y in l[j]:
if y == 0 and i & 1 << (x - 1): #証言:不親切 設定:親切
judge = False
if y == 1 and i & 1 << (x - 1) == 0: #証言:正直、設定:不親切
judge = False
if judge == True:
cnt = bin(i).count("1")
ans = max(ans, cnt)
print(ans) | p02837 |
from itertools import product
N = int(eval(input()))
said = [[-1] * (N+1) for _ in range(N+1)]
for a in range(N):
K = int(eval(input()))
for _ in range(K):
x, y = list(map(int, input().split()))
said[a][x - 1] = y
ans = 0
for cand in product(list(range(2)), repeat=N):
isOK = True
for i, c in enumerate(cand):
if not c:
continue
A = said[i]
for j in range(N):
if i == j or A[j] == -1:
continue
if cand[j] != A[j]:
isOK = False
break
if isOK:
ans = max(ans, sum(cand))
print(ans)
| from itertools import product
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
mention = []
for _ in range(N):
A = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(A)]
mention.append(xy)
ans = 0
for pair in product(list(range(2)), repeat=N):
isOK = True
for i, p in enumerate(pair):
if not p:
continue
for x, y in mention[i]:
if pair[x - 1] != y:
isOK = False
if isOK:
ans = max(ans, sum(pair))
print(ans) | p02837 |
print((input().replace("2017", "2018"))) | s = input().split("/")
print(("/".join(["2018", s[1], s[2]]))) | p03469 |
print(('2018'+input()[4:])) | print((input(2018)[4:])) | p03469 |
print((input().replace("2017","2018"))) | print(("2018"+input()[4:])) | p03469 |
print(("/".join(["2018"] + input().split("/")[1:]))) | print((input().replace("017","018"))) | p03469 |
print(("2018" + input().rstrip("\n")[4:])) | print(("2018" + input()[4:]))
| p03469 |
print((input().replace("2017","2018"))) | print((input().replace("17","18"))) | p03469 |
print((input().replace("2017", "2018"))) | S = input().replace("2017", "2018")
print(S) | p03469 |
import re
S = list(input())
S[3] = "8"
out = ""
for s in S:
out += s
print(out)
| S = input()
print("2018"+S[4:])
| p03469 |
H, W = list(map(int, input().split()))
h, w = list(map(int, input().split()))
H -= h
W -= w
print((H * W)) | H, W = list(map(int, input().split()))
h, w = list(map(int, input().split()))
print(((H-h)*(W-w))) | p03101 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.