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... | 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 ((s... | 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 >... | 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 >... | 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
... | 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(... | 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 ... | 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 ... | 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 rang... | 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 rang... | 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 rang... | 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 rang... | 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 ... | 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 ... | 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):
... | 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):
... | 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 ... | #
# 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 ... | 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... | 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... | 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()))... | 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()))
... | 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)#正直者リスト
... | 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)#正直者リスト
... | 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):
... | 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 ... | 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
... | 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
... | 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 r... | 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 hones... | 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:
hone... | 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:
hone... | 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全探... | 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):
... | 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 ... | 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 ... | 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.
... | 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.
... | 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
... | 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:
... | 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):
... | # 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):
... | 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(read... | 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(e... | 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
... | 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)
... | 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):
... | 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)):
... | 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... | 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... | 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
f... | 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
contra... | 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 ran... | # 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):
... | 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):
... |
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)... | 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 r... | 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 ran... | 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_li... | 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_li... | 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]... | 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=T... | 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)):
... | 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)):
... | 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)):
... | 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... | 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()
... | 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 =... | 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:
... | 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:#もし正直者だったら
... | 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):
... | 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):
... | 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... |
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):... | 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:
... | 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 ... | 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
f... | 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... | 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 = ... | 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 = [... | 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... | 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:... | 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
... | 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(an... | 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.... | 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)... | 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):
... | 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()))
... | 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... | 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... | 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... | 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... | 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:
#どの... |
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:
#... | 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):
... | 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)), rep... | 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:{} {... | 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
... | 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
... | 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
... | 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 ... | 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
... | 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]... | 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):
l... | 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:
... | 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_... | 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
fo... | 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 ran... | 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 ran... | 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 << ... | 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... | 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]... | 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 ... | 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 ... | 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 rang... | #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):
... | 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 ra... | 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 ra... | 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):
#そ... | 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 ... | 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 ... | 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]
... | 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))
... | 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))
... | 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[... | 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[... | 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
f... | 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... | 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:
... | 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:
... | 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... | 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
... | 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):
... | 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):
... | 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):
... | 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):
... | 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):
... | 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):
... | 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=... | 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], repe... | 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):
... | 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... | 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):
... | 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):
... | 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):... | 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)... | 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 = 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... | 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 ... | 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 b... | 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
e... | 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=m... | 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パタ... | 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... | 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.ad... | 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.ad... | 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):
i... | 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):
#... | 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) & ... | 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... | 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... | 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):
... | 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 = []
... | 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 =... | 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().s... | 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):
f... | 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):
f... | 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):
f... | 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):
... | 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... | 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(... | 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... | 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 ... | 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") #正直... | 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): #証言者が正直者設定なら進む。
... | 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
... | 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 = Tr... | 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(... | 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.