input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, C = list(map(int,input().split()))
D = [0] * C
for i in range(C):
t = list(map(int,input().split()))
D[i] = t
c = [0] * N
for i in range(N):
t = list(map(int,input().split()))
c[i] = t
Dsum = [0] * C
for k in range(C):
ccc = [0, 0, 0]
for i in range(N):
for j in range(N):... | N, C = list(map(int,input().split()))
D = []
for i in range(C):
t = list(map(int,input().split()))
D.append(t)
c = []
for i in range(N):
t = list(map(int,input().split()))
c.append(t)
Dsum = []
for k in range(C):
ccc = [0, 0, 0]
for i in range(N):
for j in range(N):
... | p03330 |
N, C = list(map(int, input().split()))
D = [ [int(i) for i in input().split()] for _ in range(C) ]
c = [ [int(i) for i in input().split()] for _ in range(N) ]
costD = [ [0, 0, 0] for _ in range(C)]
for c0 in range(C):
for i in range(N):
for j in range(N):
costD[c0][(i+j)%3] += D[... | import itertools
def main():
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(C)]
CC = [list([int(x) - 1 for x in input().split()]) for _ in range(N)]
cost = [[0 for _ in range(C)] for _ in range(3)]
for c in range(C):
for i in range(... | p03330 |
N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for i in range(C)]
L = [list(map(int,input().split())) for i in range(N)]
d0 = {}
d1 = {}
d2 = {}
for i in range(N) :
for j in range(N) :
before = L[i][j] - 1
if (i+j) % 3 == 0 :
if before no... | N,C = list(map(int,input().split()))
D = [list(map(int,input().split())) for i in range(C)]
L = [list(map(int,input().split())) for i in range(N)]
di = [{}, {}, {}]
for i in range(N) :
for j in range(N) :
num = (i+j) % 3
before = L[i][j] - 1
if before not in di[num] :
... | p03330 |
import itertools
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for i in range(C)]
c = [list(map(int, input().split())) for i in range(N)]
# 全探索だと間に合わない
# 一旦実装だけしてみる
corres = list(itertools.permutations(list(range(C)), 3))
ans = float('inf')
indices = [2, 0, 1]
for corr in corr... | N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for i in range(C)]
c = [list(map(int, input().split())) for i in range(N)]
cost0 = []
cost1 = []
cost2 = []
indices = [2, 0, 1]
for color in range(C):
cost = [0, 0, 0]
for i in range(N):
idx = indices[i%3]
for j in rang... | p03330 |
# 目指すグリッドは
# ABCABCABC..
# BCABCABCA..
# CABCABCAB..
# ABCABCABC..
# ...
# N = 500なので総マス数は250000
# 色の種類は30種類
# すべてのマスをあまりごとに3グループに分ける
# 各グループにおいて、各色が何マスずつあるかを計算する。250000回
# 長さ30の配列 * 3になるのであとは変更先の色をすべて試す。30 * 3回
# 隣あったマスを同じ色にすることができないため、
# グループごとに候補を3位まで用意し、3 * 2 * 1は6通りをすべて試す。
# 3位と4位がタイのときはどっちを取っても大丈夫
... | # 目指すグリッドは
# ABCABCABC..
# BCABCABCA..
# CABCABCAB..
# ABCABCABC..
# ...
# N = 500なので総マス数は250000
# 色の種類は30種類
# すべてのマスをあまりごとに3グループに分ける
# 各グループにおいて、各色が何マスずつあるかを計算する。250000回
# 長さ30の配列 * 3になるのであとは変更先の色をすべて試す。30 * 3回
# 隣あったマスを同じ色にすることができないため、
# グループごとに候補を3位まで用意し、3 * 3 * 3 = 27通りをすべて試す。
# 3位と4位がタイのときはどっちを取っても大丈夫... | p03330 |
n,m=list(map(int,input().split()))
d=[list((list(map(int,input().split())))) for _ in range(m)]
c=[list((list(map(int,input().split())))) for _ in range(n)]
x=[[[True for _ in range(n)] for _ in range(n)] for _ in range(m)]
for k in range(m):
for i in range(n):
for j in range(n):
if c[i][... | n,m=list(map(int,input().split()))
d=[list((list(map(int,input().split())))) for _ in range(m)]
c=[list((list(map(int,input().split())))) for _ in range(n)]
x=[[0 for _ in range(m)] for _ in range(3)]
for i in range(n):
for j in range(n):
x[(i+j)%3][c[i][j]-1]+=1
res=[]
for c1 in range(m):
fo... | p03330 |
import itertools
N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(C)]
G = [list(map(int, input().split())) for _ in range(N)]
count_color = [[0 for _ in range(C+1)] for _ in range(3)]
for y in range(N):
for x in range(N):
count_color[(x+y)%3][G[y][x]] += 1
ans = 1... | N, C = list(map(int, input().split()))
D = [list(map(int, input().split())) for _ in range(C)]
G = [list(map(int, input().split())) for _ in range(N)]
GC = []
GC.append([0]*C)
GC.append([0]*C)
GC.append([0]*C)
for y in range(N):
for x in range(N):
GC[(y+x)%3][G[y][x]-1] += 1
ans = 1000000000
for a in r... | p03330 |
import sys
N = int(sys.stdin.readline().strip())
A = list(map(int, sys.stdin.readline().strip().split()))
ans = 0
for i in range(N):
if i % 2 == 0 and A[i] % 2 == 1:
ans += 1
print(ans) | import sys
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
ans = 0
for i in range(N):
if i % 2 == 0 and A[i] % 2 == 1:
ans += 1
print(ans) | p02607 |
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i%2 == 0 and A[i]%2 != 0:
cnt += 1
else:
continue
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for i in range(0, N, 2):
if A[i]%2 != 0:
cnt += 1
print(cnt) | p02607 |
n = int(eval(input()))
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
if i%2 == 0 and S[i]%2 == 1:
ans += 1
print(ans)
| n = eval(input())
N = int(n)
list1 = input().split(" ")
Numbers = list1[:N]
count = 0
for i in range(0, N):
if (i+1) % 2 != 0:
if int(Numbers[i]) % 2 != 0:
count += 1
else:
continue
print(count)
| p02607 |
n,*l=list(map(int,open(0).read().split()))
c=0
for e,i in enumerate(l):
c+=((e+1)*i)%2
print(c) | _,*l=list(map(int,open(0).read().split()));print((sum(-~e*i%2 for e,i in enumerate(l)))) | p02607 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
if a[i] % 2:
ans += 1
print(ans) | p02607 |
print((sum([int(x)%2 for x in open(0).read().split()[1::2]]))) | N, *A = list(map(int, open(0).read().split()))
print((len([a for a in A[::2] if a%2]))) | p02607 |
N, *a = list(map(int, open(0).read().split()))
print((sum(1 for e in a[::2] if e % 2 == 1)))
| N, *a = list(map(int, open(0).read().split()))
print((sum(e % 2 for e in a[::2])))
| p02607 |
n = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(n):
if i %2 == 1:
continue
if A[i] % 2 == 1:
ans += 1
print(ans) | n = eval(input())
ans = 0
for i,j in enumerate(map(int,input().split())):
ans += (~i&1 and j&1)
print(ans) | p02607 |
#!/usr/bin/env python3
# atcoder
# Türkler var mı?
# Herkese memnün oldum
import sys
iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
MOD = (10 ** 9) + 7 # operować sobie na typie int32_t
def 関数(n, a):
res = 0
f... | #!/usr/bin/env python3
# atcoder
# Türkler var mı?
# Herkese memnün oldum
import sys
iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
MOD = (10 ** 9) + 7 # operować sobie na typie int32_t
def 関数(n, a):
res = 0
f... | p02607 |
eval(input())
print((len([i for n,i in enumerate(map(int,input().split()),1) if i%2==1 and n%2]))) | eval(input())
print((len([i for i in list(map(int,input().split()))[::2] if i%2]))) | p02607 |
N = int(eval(input()))
nombres = [int(x) for x in input().split()]
k = 0
for indexe,nombre in enumerate(nombres):
if ((indexe + 1)%2 == 1 and nombre%2 == 1):
k += 1
print(k) | n = int(eval(input()))
A = [int(x) for x in input().split()]
comp = 0
for el in range(0, n, 2):
if A[el] % 2 != 0:
comp += 1
print(comp) | p02607 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans=0
for i in range(0, N, 2):
if A[i]%2==1:
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int, input().split()))
ans=0
for i in range(0,n,2):
if a[i]%2==1:
ans+=1
print(ans) | p02607 |
N = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
if (i+1) % 2 != 0 and a[i] % 2 != 0:
cnt += 1
print(cnt) | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(0, N, 2):
if a[i] % 2 != 0:
cnt += 1
print(cnt) | p02607 |
class BIT():
def __init__(self,number):
self.n=number
self.list=[0]*(number+1)
def add(self,i,x):#ith added x 1indexed
while i<=self.n:
self.list[i]+=x
i+=i&-i
def search(self,i):#1-i sum
s=0
while i>0:
... | class BIT():
def __init__(self,number):
self.n=number
self.list=[0]*(number+1)
def add(self,i,x):#ith added x 1indexed
while i<=self.n:
self.list[i]+=x
i+=i&-i
def search(self,i):#1-i sum
s=0
while i>0:
... | p03277 |
n = int(eval(input()))
a = list(map(int, input().split()))
class BIT:
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit[i]
i -= i&(-i)
return s
def add(self, i, x):
... | import math
n = int(eval(input()))
a = list(map(int, input().split()))
class BIT:
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.bit[i]
i -= i&(-i)
return s
def add(self,... | p03277 |
N=int(eval(input()))
A=[int(i) for i in input().split()]
sorted_A=sorted(A)
def add(B,a,n):
x = a
while x<=n:
B[x]+=1
x+=x&(-x)
def sums(B,a):
x=a
S=0
while x!=0:
S+=B[x]
x-=x&(-x)
return S
def invnumber(n,A):
S=[0]*n
A=sorted(... | N=int(eval(input()))
A=[int(i) for i in input().split()]
sorted_A=sorted(A)
def add(B,a,n):
x = a
while x<=n:
B[x]+=1
x+=x&(-x)
def sums(B,a):
x=a
S=0
while x!=0:
S+=B[x]
x-=x&(-x)
return S
def invnumber(n,A):
B=[0]*(n*2+1... | p03277 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
def init(bit, values):
for i,v in enumerate(values):
update(bit,i,v)
#A1 ~ Aiまでの和 O(logN)
def query(bit,i):
res_sum = 0
while i > 0:
r... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = list(map(int, input().split()))
from collections import Counter
def sub(x):
l = [1 if item>=x else -1 for item in a]
count = [0] ... | p03277 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p03277 |
from operator import itemgetter
class BIT():
"""一点加算、区間取得クエリをそれぞれO(logN)で答える
add: i番目にvalを加える
get_sum: 区間[l, r)の和を求める
i, l, rは0-indexed
"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _sum(self, i):
s = 0
while i > 0:
... | from operator import itemgetter
import sys
input = sys.stdin.readline
class BIT():
"""一点加算、区間取得クエリをそれぞれO(logN)で答える
add: i番目にvalを加える
get_sum: 区間[l, r)の和を求める
i, l, rは0-indexed
"""
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def _sum(self, i):
... | p03277 |
N=int(eval(input()))
alist=list(map(int,input().split()))
numlist=[]
if len(alist)==1:
print((alist[0]))
exit()
i=1
for x in range(0,((N+1)//2)):
numlist+=[alist[x]]*i
i+=2
i=2
for x in range(N-1,((N+1)//2)-1,-1):
numlist+=[alist[x]]*i
i+=2
numlist.sort()
print((numlist[len(numlist)//2+1])) | N=int(eval(input()))
alist=list(map(int,input().split()))
numdict={}
amount=0
if len(alist)==1:
print((alist[0]))
exit()
for x in alist:
if x in numdict:
numdict[x]+=1
else:
numdict[x]=1
medilist=alist.copy()
newmedilist=[]
for i in range(1,N):
if i%2:
for x in range(0,N-i):
... | p03277 |
import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class BinaryIndexedTree:
"""
Parameters
----------
array : list
to construct BIT from
f : func
binary operation of the abelian group
fi : func
inv... | import itertools
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class BinaryIndexedTree:
"""
Parameters
----------
array : list
to construct BIT from
f : func
binary operation of the abelian group
fi : func
inv... | p03277 |
def d_median_of_medians(N, A):
class BIT(object):
def __init__(self, n):
self.size = n
self.tree = [0] * (self.size + 1)
def __str__(self):
return '[{}]'.format(', '.join(map(str, self.tree)))
def sum(self, index):
# 1からindexまでの和を計算... | def d_median_of_medians(N, A):
class BIT(object):
def __init__(self, n):
self.size = n
self.tree = [0] * (self.size + 1)
def __str__(self):
return '[{}]'.format(', '.join(map(str, self.tree)))
def sum(self, index):
# 1からindexまでの和を計算... | p03277 |
# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: 数
"""
return ... | # coding: utf-8
import sys
# import bisect
# import math
# import numpy as np
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: 数
"""
return ... | p04001 |
# coding: utf-8
import sys
# import bisect
# import math
# import numpy as np
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: 数
"""
return ... | import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | p04001 |
from itertools import combinations
S = str(eval(input()))
pos = [i for i in range(len(S)-1)]
insert_indices = [comb for i in range(len(S)) for comb in combinations(pos, i)]
ans = 0
for inds in insert_indices:
cur_ix = 0
cur_ans = 0
while cur_ix < len(S):
cur_ans += int(S[cur_ix])
... | from itertools import combinations
S = str(eval(input()))
n = len(S)
ans = 0
for i in range(1 << (n-1)):
cur_ans = int(S[0])
for j in range(n-1):
add_plus = (i >> (n-2-j)) & 1
if add_plus:
ans += cur_ans
cur_ans = 0
else:
cur_ans *= 10
... | p04001 |
from itertools import permutations
import sys, re
inp = sys.stdin.readline().strip()
perms = []
used = []
total = 0
#orig = inp
def checkOrder(check, inp):
count = 0
for i in range(len(check)):
if check[i] == '+':
continue
elif check[i] == inp[count]:
count... | import sys
perm = sys.stdin.readline().strip()
total = 0
# Add n * '+' to inp
def addPlus(inp, n):
total = 0
possible = [inp]
orig = inp
for i in range(1, len(orig)):
possible.append(orig[:i] + '+' + perm[i:])
for i in range(1, n):
curr = possible[:]
for ite... | p04001 |
import sys
def pokakito(num_line):
if not num_line and flag == 1:
result_lis.append(check_num)
return True
for num in num_line:
if three(num, num_line): return True
if two(num, num_line): return True
if straight(num, num_line): return True
def three(num, ... | import sys
def pokakito(num_line):
if not num_line and flag == 1:
result_lis.append(check_num)
return True
for num in num_line:
if three(num, num_line): return True
if two(num, num_line): return True
if straight(num, num_line): return True
def three(num, ... | p00043 |
import itertools
N, M = list(map(int,input().split()))
def main():
k = []
s = []
answers = []
for i in range(M + 1):
inputs = list(map(int,input().split()))
if i == M:
answers = inputs.copy()
else:
k.append(inputs[0])
s.append(inputs[1:])
allCandidates = []
for i in range(N ... | import itertools
N, M = list(map(int,input().split()))
def main():
k = []
s = []
answers = []
for i in range(M + 1):
inputs = list(map(int,input().split()))
if i == M:
answers = inputs.copy()
else:
k.append(inputs[0])
s.append(inputs[1:])
allCandidates = (list(itertools.produc... | p03031 |
n, m = list(map(int, input().split()))
k = [list(map(int, input().split()))[1:] for _ in range(m)]
p = list(map(int, input().split()))
answer = 0
## k = sorted(k, reverse=True, key=lambda x: len(x))
all = [] # 全てのスイッチの状態
for i in range(0, 2**n):
all.append(list(str(format(i, 'b').zfill(n))))
for a in all:... | #!/usr/bin/env python3
def main():
N,M = list(map(int,input().split()))
K = []
s = []
answer = 0
for _ in range(M):
ks = list(map(int,input().split()))
K.append(ks[0])
s.append(ks[1:])
p = list(map(int,input().split()))
for switch in range(0,2**N):
... | p03031 |
n,m = list(map(int,input().split()))
l_list = [list(map(int,input().split())) for i in range(m)]
p = list(map(int,input().split()))
output = 0
for i in range(2 ** n):
lights = []
for j in range(n+1):
if ((i >> j) & 1):
lights.append(j+1)
for inde, l in enumerate(l_list):
if len(... | n,m = list(map(int,input().split()))
l_list = [list(map(int,input().split())) for i in range(m)]
p = list(map(int,input().split()))
output = 0
for i in range(2 ** n):
lights = []
for j in range(n+1):
if ((i >> j) & 1):
lights.append(j+1)
for k, l in enumerate(l_list):
if len(set... | p03031 |
n, m = list(map(int, input().split()))
bits = '0b' + '1' * n
s = []
for _ in range(m):
i = [int(i) for i in input().split()]
s.append(i[1:])
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
l = bin(i)[2:]
b = (n - len(l)) * '0' + l
addable = True
for h, j in enum... | n, m = list(map(int, input().split()))
s = [[int(i) for i in input().split()[1:]] for _ in range(m)]
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
addable = True
for j in range(m):
d = sum(2 ** (k - 1) for k in s[j])
if bin(i & d).count('1') % 2 != p[j]:
... | p03031 |
N, M = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
P = list(map(int, input().split()))
ans = 0
for bit in range(2 ** N):
ons = set([i + 1 for i in range(N) if bit >> i & 1])
flg = True
for i in range(M):
k, *s = X[i]
p = P[i]
fl... |
N, M = list(map(int, input().split()))
K = []
X = []
for _ in range(M):
k, *x = list(map(int, input().split()))
K.append(k)
X.append(x)
P = list(map(int, input().split()))
ans = 0
for bit in range(2 ** N):
light_on = [False] * M
for i in range(M):
tmp = 0
for s in X[... | p03031 |
# -*- coding: utf-8 -*-
"""
Created on Sun May 26 20:56:00 2019
@author: Yamazaki Kenichi
"""
N,M = list(map(int,input().split()))
ks = [list(map(int,input().split())) for i in range(M)]
p = list(map(int,input().split()))
ans = 0
for i in range(2**N):
t = '{:010b}'.format(i)
flg = True
for... | # -*- coding: utf-8 -*-
"""
Created on Mon May 27 21:28:42 2019
@author: Yamazaki Kenichi
"""
N, M = list(map(int,input().split()))
ks = [list(map(int,input().split())) for i in range(M)]
p = list(map(int,input().split()))
S = [0 for i in range(M)]
for i in range(M):
for j in range(1,ks[i][0]+1):
... | p03031 |
n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt = 0
for j in range(1, len(lst_sw[i])):
... | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt_sw_on = 0
for j in range(1, len(lst_sw[i])):
... | p03031 |
n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt_sw_on = 0
for j in range(1, len(lst_sw[i])):
... | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt_sw_on = 0
for j in range(1, len(lst_sw[i])):
... | p03031 |
n,m = list(map(int, input().split()))
S = [list(map(int, input().split())) for i in range(m)]
P = list(map(int, input().split()))
c = 0
a = 0
for a in range(2**n):
a2 = format(a, 'b').zfill(n)
d = 0
for i in range(m):
o = 0
for j in range(S[i][0]):
o += int(a2[S[i][j+1]-1])
if o % 2 ... | N,M = list(map(int,input().split()))
B = [tuple(map(int,input().split())) for _ in range(M)]
P = tuple(map(int,input().split()))
ans = 0
for i in range(2**N):
flag = True
for k in range(M):
on = 0
for j in range(B[k][0]):
if i>>(B[k][j+1]-1) & 1:
... | p03031 |
# ABC128C - Switches
from itertools import product
n, m = list(map(int, input().rstrip().split()))
lst = [list(map(int, input().rstrip().split())) for _ in range(m)]
con = list(map(int, input().rstrip().split()))
ans = 0
for i in product(list(range(2)), repeat=n):
cnt = 0
for j in range(m):
o... | # ABC128C - Switches
import sys
from itertools import product
input = sys.stdin.readline
n, m = list(map(int, input().rstrip().split()))
lst = [list(map(int, input().rstrip().split())) for _ in range(m)]
con = list(map(int, input().rstrip().split()))
ans = 0
for i in product(list(range(2)), repeat=n):
... | p03031 |
n,m=list(map(int,input().split()))
light=[]
ans=0
for i in range(m):
List=list(map(int,input().split()))
light.append(List)
p=list(map(int,input().split()))
for i in range(2**n):
l=[0]*n
for j in range(n):
if (i>>j&1):
l[j]=1
on=0
for k in range(m):
cn... | n,m=list(map(int,input().split()))
light=[list(map(int,input().split())) for _ in range(m)]
p=list(map(int,input().split()))
ans=0
for i in range(2**n):
state=[0]*n
for j in range(n):
if (i>>j&1):
state[j]=1
light_num=0
for k in range(m):
switch_num=0
for ... | p03031 |
def main():
import itertools
n,m=list(map(int,input().split()))
li=[list(map(int,input().split()))[1:] for _ in range(m)]
p=tuple(map(int,input().split()))
q=set(sum(li,[]))
r=set(range(1,n+1))
v=r-q
ans=0
for i in range(0,len(q)+1):
for s in itertools.combinations(q,i):
... | def main():
import itertools
n,m=list(map(int,input().split()))
li=[list(map(int,input().split()))[1:] for _ in range(m)]
p=tuple(map(int,input().split()))
q=set(sum(li,[]))
r=set(range(1,n+1))
v=r-q
ans=0
for i in range(0,len(q)+1):
for s in itertools.combinations(q,i):
... | p03031 |
f = lambda : list(map(int, input().split()))
n, m = f()
ll = [[0]*n for i in range(m)]
for i in range(m):
k, *t = f()
for j in range(k):
ll[i][t[j]-1] = 1
lp = list(f())
import itertools as it
lt = [p for p in it.product([0,1], repeat=n)]
ans = 0
for p in lt:
lj = []
for l in ll:
lj.ap... | f = lambda : list(map(int, input().split()))
n, m = f()
ll = [[0]*n for i in range(m)]
for i in range(m):
k, *t = f()
for j in range(k):
ll[i][t[j]-1] = 1
lp = list(f())
import itertools as it
ans = 0
for p in it.product([0,1], repeat=n):
if lp == [sum(a*b for a, b in zip(p,l))%2 for l in ll]... | p03031 |
f = lambda : list(map(int, input().split()))
n, m = f()
ll = [[0]*n for i in range(m)]
for i in range(m):
_, *t = f()
for j in t:
ll[i][j-1] = 1
lp = list(f())
import itertools as it
ans = 0
for p in it.product([0,1], repeat=n):
if lp == [sum(a*b for a, b in zip(p,l))%2 for l in ll]:
ans... | f=lambda:list(map(int,input().split()))
n,m=f()
ll=[[0]*n for _ in range(m)]
for l in ll:
k,*s=f()
for i in s: l[i-1]=1
p=list(f())
import itertools as it
print((sum(all(sum(a*b for a,b in zip(l,t))%2==p[i] for i,l in enumerate(ll)) for t in it.product([0,1],repeat=n)))) | p03031 |
N, M = list(map(int, input().split()))
int_switch_repr = 2**N
light_bulbs_switches = []
for i in range(M):
k_s = [int(x) for x in input().split()]
k_i = k_s[0]
light_bulbs_switches.append(k_s[1:]) # i-th light bulb
P = [int(x) for x in input().split()] # p_i
ans = 0
for itg in range(int_switch_repr):
... | N, M = list(map(int, input().split()))
int_switch_repr = 2**N
light_bulbs_switches = []
for i in range(M):
k_s = [int(x) for x in input().split()]
k_i = k_s[0]
light_bulbs_switches.append(k_s[1:]) # i-th light bulb
P = [int(x) for x in input().split()] # p_i
ans = 0
for itg in range(int_switch_repr):
... | p03031 |
n,m = list(map(int,input().split()))
S = [list(map(int,input().split()))[1:] for i in range(m)]
P = list(map(int,input().split()))
ans = 0
#bit全探索
for bit in range(1<<n):
on = []
ok = True #全部の電球が光る
for i in range(n):
if (bit & (1<<i)):
on.append(i+1)
for i in range(m):
... | n,m = list(map(int,input().split()))
d = []
for i in range(m):
d.append(list(map(int,input().split())))
p = list(map(int,input().split()))
ans = 0
def search(x):
global ans
cnt = 0
for i in range(m):
c = 0
for j in d[i][1:]:
if x[j-1]==1:
c += 1... | p03031 |
n,m = list(map(int,input().split()))
s = [0] * m
ans = 0
for i in range(m):
s[i] = list(map(int,input().split()))
s[i] = s[i][1:]
p = list(map(int,input().split()))
for k in range(2**n):
a = format(k,'0'+str(n)+'b')
t = True
for i in range(m):
if sum(a[j-1] == '1' for j in s[i])%2... | n,m = list(map(int,input().split()))
s = [0] * m
k = [0] * m
for i in range(m):
s[i] = list(map(int,input().split()))
k[i] = s[0]
s[i] = s[i][1:]
p = list(map(int,input().split()))
ans = 0
b = '0' + str(n) + 'b'
for i in range(1 << n):
sw = format(i,b)
if all(sum(sw[g-1] == '1' for g i... | p03031 |
n, m = list(map(int, input().split()))
k = []
s = []
for i in range(m):
l = list(map(int, input().split()))
k.append(l[0])
s.append(l[1:])
p = list(map(int, input().split()))
ans = 0
for bit in range(2 ** n):
q = 1
for i in range(m):
sum = 0
for j in range(k[i]):
... | N, M = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** N): # all comb
for j in range(M): # k loop
c = 0
for k in range(N): # s loop
if ((i >> k) & 1) and (k + 1) in s[j][1:]... | p03031 |
n,m=list(map(int,input().split()))
s=[]
k=[]
for i in range(m):
ss=list(map(int,input().split()))
k.append(ss[0])
s.append(ss[1:])
p=list(map(int,input().split()))
def cntbin(num):
bin_num = bin(num)[2:]
count = 0
for i in bin_num:
count += int(i)
return count
... | n,m=list(map(int,input().split()))
k=[]
s=[]
def cntbin(num):
bin_num = bin(num)[2:]
count = 0
for i in bin_num:
count += int(i)
return count
for i in range(m):
kk,*ss=list(map(int,input().split()))
k.append(kk)
s.append(ss)
p=list(map(int,input().split()))
... | p03031 |
# https://atcoder.jp/contests/abc128/tasks/abc128_c
# なんかかすかに解いた記憶あるな？
# load data
N, M = list(map(int, input().split()))
S = []
for _ in range(M):
S.append(list(map(int, input().split()))[1:])
P = list(map(int, input().split()))
def is_on(i, S, p):
# bit表現 i のときSのスイッチの個数とpでonか返す
cnt = 0
... | # https://atcoder.jp/contests/abc128/tasks/abc128_c
# なんかかすかに解いた記憶あるな？
# load data
N, M = list(map(int, input().split()))
S = []
for _ in range(M):
S.append(list(map(int, input().split()))[1:])
P = list(map(int, input().split()))
def is_on(i, S, p):
# bit表現 i のときSのスイッチの個数とpでonか返す
cnt = 0
... | p03031 |
N, M = list(map(int, input().split()))
K = []; S = []
for _ in range(M):
k, *s = list(map(int, input().split()))
K.append(k); S.append(s)
P = list(map(int,input().split()))
ans = 0
for i in range(2**N):
flag = 0
stat = str(bin(i)[2:])
stat = stat.rjust(N, "0")
for j in range(M):
... | N, M = list(map(int, input().split()))
lightList = []
for _ in range(M):
lightList.append(list(map(int, input().split())))
P = list(map(int, input().split()))
ans = 0
for i in range(2**N):
flag = True
for a in range(M):
cnt = 0
for b in lightList[a][1:]:
if not (i & ... | p03031 |
#N = int(input())
n, m = list(map(int, input().split()))
#hl = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(m)]
pl = list(map(int, input().split()))
count=0
for i in range(2**n):
b = bin(i)
switch = [False for i in range(n)]
boollist=[]
for j in range(n):... | #m = int(input())
n, m = list(map(int, input().split()))
#al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]
switch = []
kl = []
for i in range(m):
temp = list(map(int, input().split()))
kl.append(temp[0])
switch.append(temp[1:])
pl = list(map(int, input().split()))
# prin... | p03031 |
n, m = [int(i) for i in input().split()]
ks = [[int(i) for i in input().split()] for _ in range(m)]
p = [int(i) for i in input().split()]
cnt = 0
for i in range(2**n):
on = set(j + 1 for j in range(n) if i >> j & 1 == 1)
flag = True
for j in range(m):
_, *s = ks[j]
flag &= len(on & set(s)) % 2 ==... | from itertools import product
n, m = list(map(int, input().split()))
l = [[int(i) for i in input().split()] for _ in range(m)]
p = [int(i) for i in input().split()]
c = 0
for sw in product((0, 1), repeat=n):
for i in range(m):
if sum(sw[si - 1] for si in l[i][1:]) % 2 != p[i]:
break
... | p03031 |
# 2019-11-13 21:06:16(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# ... | import sys
n, m = list(map(int, sys.stdin.readline().split()))
s = [set(map(int, sys.stdin.readline().split()[1:])) for _ in range(m)]
*p, = list(map(int, sys.stdin.readline().split()))
def main():
combs = 0
for i in range(2 ** n):
t = set([j + 1 for j in range(n) if i >> j & 1])
for... | p03031 |
N, M = list(map(int,input().split()))
state = []
for _ in range(M):
lst = list(map(int, input().split()))
state.append(lst[1:])#switch numbers each denkyu
p = list(map(int, input().split()))#numbers switches on %2 == pi
ans = 0
for i in range(2**N):
total = 0
for j in range(M):
cnt = 0
for s... | N, M = list(map(int,input().split()))
state = []
for _ in range(M):
lst = list(map(int, input().split()))
state.append(lst[1:])#switch numbers each denkyu
p = list(map(int, input().split()))#numbers switches on %2 == pi
ans = 0
for i in range(2**N):
total = 0
for j in range(M):
cnt = 0
for s... | p03031 |
#入力
N, M = list(map(int, input().split()))
#入力: 電球iについての情報
lst = []
for i in range(M):
a = list(map(int, input().split()))
lst += [a]
#入力: どのような情報であればOKかのリスト
p = list(map(int, input().split()))
# print ('lst', lst)
#計算部分
ans = 0 #全探索用の答え
for i in range(2 ** N): #1をon, 0をoffとする2bit
#最大でもスイ... | N, M = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(M)]
p = list(map(int, input().split()))
count = 0
#bit全探索
for i in range(2**N): #スイッチの状態をbit-全探索
c = [0] * M
for j in range(N): #j桁目を確認
if (i >> j) & 1: #j桁目 = j個目のスイッチがONの時
for k in range... | p03031 |
N, M = list(map(int, input().split()))
bulbs = []
for m in range(M):
ks = list(map(int, input().split()))
bulbs.append(list(ks)[1:])
P = list(map(int, input().split()))
result = 0
for m in range(2**N):
switches = list(map(int, list(str(bin(m))[2:])))
switches = [0]*(N-len(switches)) + swi... | N, M = list(map(int, input().split()))
bulbs = []
for m in range(M):
ks = list(map(int, input().split()))
bulbs.append(list(ks)[1:])
P = list(map(int, input().split()))
result = 0
for m in range(2**N):
flag = True
for idx, bulb in enumerate(bulbs):
count = 0
for switch... | p03031 |
from collections import deque
n, m = list(map(int, input().split()))
s = [0] * m
k = [0] * m
for i in range(m):
s[i] = deque(list(map(int, input().split())))
k[i] = deque.popleft(s[i])
s[i] = list(s[i])
p = list(map(int, input().split()))
cnt = 0
for i in range(2 ** n):
l = [0] * n
f... | n, m = list(map(int, input().split()))
s = [0] * m
for i in range(m):
s[i] = list(map(int, input().split()))[1:]
p = list(map(int, input().split()))
ans = 0
for bit in range(2 << (n-1)):
l = [0] * n
for i in range(n):
if bit >> i & 1:
l[i] += 1
for i in range(m):
... | p03031 |
n,m = list(map(int,input().split()))
res = 0
Q = []
for i in range(m):
Q.append(list(map(int,input().split()))[1:])
P = list(map(int,input().split()))
for s in range(1<<n):
tmp = 0
for i in range(len(Q)):
cnt = 0
for t in Q[i]:
if s>>(t-1) &1 == 1:
c... | N,M = list(map(int,input().split()))
S = []
for _ in range(M):
S.append(list(map(int,input().split()))[1:])
P = list(map(int,input().split()))
res = 0
for i in range(2**N):
tmp = 0
for j in range(M):
ON = 0
for s in S[j]:
if (i >> s-1)&1 == 1:
ON += 1
... | p03031 |
n, m = list(map(int, input().split(' ')))
k = [0] * m
s = [[]] * m
for i in range(m):
_input = [num for num in map(int, input().split(' '))]
k[i] = _input[0]
s[i] = _input[1:]
p = [num for num in map(int, input().split(' '))]
# print(n, m)
# print(k)
# print(s)
# print(p)
# スイッチのパターンデータ作成
s_patte... | n , m = list(map(int, input().split()))
sl = [[]] * m
for i in range(m):
s = [num for num in map(int, input().split())]
sl[i] = s
p = [num for num in map(int, input().split())]
# print(p, sl)
ans = 0
# すべてのスイッチの状態を bit全探索 (各bit 1: on, 0: off)
for i in range(1 << n):
# print('i: ', i)
# その... | p03031 |
ks=[]
n,m=list(map(int,input().split()))
for i in range(m):
ks.append(list(map(int,input().split())))
p=list(map(int,input().split()))
ans_ans=0
for i in range(2**n):
num="0"*10+bin(i)
ans=0
for j in range(m):
cnt=0
for k in range(n):
if num[-k-1]=="1" and k+1 in ks[j][1:]:
cnt+=1
if cnt%... | n,m=list(map(int,input().split()))
ks=[]
for _ in range(m):
rr=list(map(int,input().split()))
ks.append(rr)
p=list(map(int,input().split()))
def two(x):
return "0"*(n-len(bin(x)[2:]))+bin(x)[2:]
ans=0
for i in range(2**n):
r=two(i)
f=1
for j in range(m):
cnt=0
for k in range(ks[j][0]):
if r[... | p03031 |
from itertools import product
N, M = list(map(int, input().split()))
sss = []
for _ in range(M):
k, *ss = list(map(int, input().split()))
sss.append(ss)
ps = list(map(int, input().split()))
ans = 0
for ptn in product(list(range(2)), repeat=N):
numL = 0
for ss, p in zip(sss, ps):
n... | N, M = list(map(int, input().split()))
switchss = []
for _ in range(M):
k, *sws = list(map(int, input().split()))
switchss.append([sw-1 for sw in sws])
ps = list(map(int, input().split()))
ans = 0
for S in range(1<<N):
for i in range(M):
num = 0
for sw in switchss[i]:
... | p03031 |
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
blst = []
cnt = 0
for i in range(2 ** N):
slst = []
for j in range(N):
if i >> j & 1:
slst.append(j)
blst.append(slst)
for i in blst:
ansF... |
def dfs(cnt):
global ans
if cnt == N:
onF = True
for i in range(M):
tmp = 0
for j in range(ks[i][0]):
if bit[ks[i][j + 1] - 1] == 1:
tmp += 1
if tmp % 2 != p[i]:
onF = False
break... | p03031 |
n, m = list(map(int,input().split()))
k = []
s = []
for i in range(m):
temp = list(map(int, input().split()))
temp_k = temp[0]
temp_s = temp[1:]
k.append(temp_k)
s.append(temp_s)
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
on = bin(i)[2:].rjust(n,"0")
... |
N, M = list(map(int, input().split()))
K = []
S = []
for _ in range(M):
tmp = list(map(int ,input().split()))
K.append(tmp[0])
tmp.pop(0)
S.append(tmp)
P = list(map(int, input().split()))
ans = 0
for i in range(2**N):
flg = [0 for _ in range(M)]
for j in range(N):
if i & (1 << j):
for k... | p03031 |
N, M = list(map(int, input().split()))
kss = []
for i in range(M):
tmp = list(map(int, input().split()))
k = tmp[0]
s = tmp[1:]
kss.append([k, s])
ps = list(map(int, input().split()))
def check_on(s_all, s, p):
oncnt = 0
for i in s:
if s_all[i]:
oncnt += 1
... | N, M = list(map(int, input().split()))
onptns = []
for i in range(M):
k, *s= list(map(int, input().split()))
onptn = 0
for i in s:
onptn += 1 << (i - 1)
onptns.append(onptn)
ps = list(map(int, input().split()))
ans = 0
s = 0
while s < (1 << N):
ans += 1
for onptn, p in z... | p03031 |
N, M = list(map(int,input().split()))
K = []
S = []
for i in range(M):
k = 0
s = []
k, *s = list(map(int,input().split()))
K.append(k)
S.append(s)
P = list(map(int,input().split()))
res = 0
for bit in range(1 << N):
judge = True
for i in range(M):
cnt = 0
for s... | N, M = list(map(int,input().split()))
K = []
S = []
for i in range(M):
k = 0
s = []
k, *s = list(map(int,input().split()))
K.append(k)
S.append(s)
P = list(map(int,input().split()))
res = 0
for bit in range(1 << N):
judge = True
for i in range(M):
cnt = 0
for s... | p03031 |
n, m = list(map(int, input().split()))
s = []
k = []
for i in range(m):
s.append(list(map(int, input().split())))
k.append(s[i].pop(0))
p = list(map(int, input().split()))
# 全点灯パターンの個数
ans = 0
# 点灯している電球の数
cnt_s_on = 0
# 電球jに繋がるONのスイッチの数
cnt_switch = 0
for i in range(2**n):
# print(bin... | n, m = list(map(int, input().split()))
s = []
k = []
for i in range(m):
s.append(list(map(int, input().split())))
k.append(s[i].pop(0))
p = list(map(int, input().split()))
# 全点灯パターンの個数
ans = 0
# 点灯している電球の数
cnt_s_on = 0
# 電球jに繋がるONのスイッチの数
cnt_switch = 0
for i in range(2**n):
cnt_s_on = ... | p03031 |
n,m=list(map(int,input().split()))
sw=[list(map(int,input().split())) for _ in range(m)]
p=list(map(int,input().split()))
ans=0
for i in range(2**n):
f=1
for j in range(m):
c=0
for x in sw[j][1:]:
x-=1
c+=(i>>x)&1
if c%2!=p[j]:
f=0
a... | n,m=list(map(int,input().split()))
s=[list(map(int,input().split())) for _ in range(m)]
p=list(map(int,input().split()))
ans=0
for i in range(2**n):
ss=[0]*n
cc=0
for j in range(n):
if i>>j&1:
ss[j]=1
for j in range(m):
c=0
k=s[j][0]
for l in rang... | p03031 |
N, M = list(map(int, input().split()))
S = [list(map(int, input().split()))[1:] for _ in range(M)]
P = list(map(int, input().split()))
count = 0
for i in range(2 ** N):
state = ''.join(list(reversed(str(bin(i))[2:].zfill(N))))
flg = True
for m in range(M):
on = 0
for s in S[m]:
... | # コンテスト中は無理やりなビット全探索[alias bit全探索]をしたが、正しく書き換えた
N, M = list(map(int, input().split()))
S = [list(map(int, input().split()))[1:] for _ in range(M)]
P = list(map(int, input().split()))
count = 0
for i in range(2 ** N):
flg = True
for m in range(M):
on = 0
for s in S[m]:
i... | p03031 |
#!/usr/bin/env python3
MOD = 2 # type: int
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
# Failed to predict input format
N,M = list(map(int,input().split()))
from... | #!/usr/bin/env python3
MOD = 2 # type: int
def main():
N, M = list(map(int, input().split()))
k = []
s = []
for i in range(M):
l = input().split()
k.append(l[0])
s.append(list(map(int, l[1:])))
p = list(map(int, input().split()))
ans = 0
f... | p03031 |
n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(set(ks[1:]))
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
kk = [0] * m
for j in range(n):
# スイッチjがonの場合
if (i>>j)&1:
... | n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(ks[1:])
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
kk = [0] * m
switch_states = [(i>>j)&1 for j in range(n)]
for idq, dq in enumerate(de... | p03031 |
n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(ks[1:])
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
kk = [0] * m
switch_states = [(i>>j)&1 for j in range(n)]
for idq, dq in enumerate(de... | n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(ks[1:])
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
kk = [0] * m
# switch_states = [(i>>j)&1 for j in range(n)]
for idq, dq in enumerate(... | p03031 |
n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(ks[1:])
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
# switch_states = [(i>>j)&1 for j in range(n)]
for idq, dq in enumerate(denq):
co... | n, m = list(map(int, input().split()))
denq = []
for _ in range(m):
ks = tuple([int(x)-1 for x in input().split()])
denq.append(ks[1:])
P = tuple(map(int, input().split()))
ans = 0
for i in range(2**n):
switch_states = [(i>>j)&1 for j in range(n)]
for idq, dq in enumerate(denq):
coun... | p03031 |
from itertools import product
n,m = list(map(int,(input().split())))
sw =[list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ans = 0
for bit in product([0, 1], repeat=n):
ele = True
for i in range(m):
cnt = 0
for j in sw[i][1:]:
cnt += ... | from itertools import product
n,m = list(map(int,(input().split())))
sw =[list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
ans = 0
for bit in product([0, 1], repeat=n):
ele = True #全部点灯ならtrue
for i in range(m): #電球1～mに対するループ
cnt = 0
for j in sw[i]... | p03031 |
N, M = list(map(int, input().split()))
lights = []
for _ in range(M):
S = list(map(int, input().split()))
mask = 0
for a in S[1:]:
mask |= (1 << (a - 1))
lights.append(mask)
P = list(map(int, input().split()))
ans = 0
for mask in range(1 << N):
for state, p in zip(lights, P)... | N, M = list(map(int, input().split()))
S = []
for _ in range(M):
s = tuple([int(a) - 1 for a in input().split()])[1:]
S.append(s)
P = tuple(map(int, input().split()))
ans = 0
for state in range(1 << N):
for p, s in zip(P, S):
cnt = 0
for i in s:
cnt += 1 if (stat... | p03031 |
#ABC 128C
def main():
import sys
import itertools as ite
N, M = list(map(int, sys.stdin.readline().split()))
Light = [tuple(map(int, sys.stdin.readline().split())) for _ in range(M)]
P = list(map(int, sys.stdin.readline().split()))
S = list(ite.product([0,1], repeat=N)) #スイッチの状態
ans ... | #ABC128C
def main():
import sys, itertools as ite
N, M = list(map(int, sys.stdin.readline().split()))
KS = [tuple(map(int, sys.stdin.readline().split())) for _ in range(M)]
P = tuple(map(int, sys.stdin.readline().split()))
#print(KS)
#bit全探索
SWS = tuple(ite.product([0,1], repea... | p03031 |
# C - Switches
#bit全探索の練習問題
import copy
N,M = input().split()
N = int(N)
M = int(M)
ks = []
for l in range(M):
s = input().split()
ks.append(s)
p = list(map(int, input().split()))
KS = []
for m in range(M):#列の数はМ
box = list()
for n in range(len(ks[m])):#M列の要素を数字に直す処理
ks[m][n... | # 93 C - Switches
N,M = list(map(int,input().split()))
K = []
S = []
for _ in range(M):
s = list(map(int,input().split()))
K.append(s[0])
# 0-indexed
s = [i-1 for i in s]
S.append(s[1:])
P = list(map(int,input().split()))
ans = 0
for i in range(1<<N):
swiches = [0]*N
for j i... | p03031 |
# -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
# 標準入力を取得
N, M = list(map(int, input().split()))
k, s = [], []
for m in range(M):
l = list(map(int, input().split()))
k_m, s_m = l[0], l[1:]
k.appe... | # -*- coding: utf-8 -*-
# 標準入力を取得
N, M = list(map(int, input().split()))
k, s = [], []
for m in range(M):
l = list(map(int, input().split()))
k.append(l[0])
s.append(l[1:])
p = list(map(int, input().split()))
# 求解処理
ans = 0
for bit in range(1 << N):
is_light_on = True
for m in range(M... | p03031 |
import sys
input = sys.stdin.readline
v = []
p = []
count = 0
m = 0
def rec(l, n):
global count
if len(l) == n:
c = 0
for k, sw in enumerate(v):
st = set()
for i in range(n):
if l[i] == 1:
st.add(i + 1)
# print(st)
if len(sw.intersection(st)) % 2 == p[k]:
c += 1
# pr... | import sys
input = sys.stdin.readline
v = []
p = []
count = 0
m = 0
def rec(l, n):
global count
if len(l) == n:
c = 0
for k, sw in enumerate(v):
st = set()
for i in range(n):
if l[i] == 1:
st.add(i + 1)
# print(st)
if len(sw.intersection(st)) % 2 != p[k]:
return
# pr... | p03031 |
import sys
input = sys.stdin.readline
v = []
p = []
count = 0
m = 0
def rec(l, n):
global count
if len(l) == n:
c = 0
st = set()
for i in range(n):
if l[i] == 1:
st.add(i + 1)
for k, sw in enumerate(v):
# print(st)
if len(sw.intersection(st)) % 2 != p[k]:
return
# print(... | import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().strip().split()))
A = [0] * n
for i in range(m):
sw = list(map(int, input().strip().split()))[1:]
for e in sw:
e -= 1
A[e] |= 1 << i
pl = list(map(int, input().strip().split()))
p = 0
for i, e in enumerate(pl)... | p03031 |
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
B = 1 << N
for i in range(B):
L = [0] * M
for j in range(M):
for k in ks[j][1:]:
if i >> (k - 1) & 1:
L[j] = (L[j] + 1) % 2
for j in range(M):
... | N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1 << N):
for j in range(M):
t = 0
for k in range(1, ks[j][0] + 1):
if i >> (ks[j][k] - 1) & 1:
t += 1
if t % 2 != p[j]:
... | p03031 |
N,M = list(map(int,input().split()))
ls = []
for i in range(M):
s = list(map(int,input().split()))
ls.append(s[1:])
p = list(map(int,input().split()))
#greedy O(2^N)(MN) : (all set of switch N) = 2^10 * M 10 10^4 OK
ans = 0
for i in range(2**N): # all set of N 2**N == 1 << N (shif operator N right shif... | n,m = list(map(int,input().split()))
light = []
for i in range(m):
light.append(list(map(int,input().split())))
p = list(map(int,input().split()))
# bit全探索 nで スイッチのパターンを全てためす
#
ans = 0
for i in range(2**n):
ng = 0
for j in range(m):
ans_j = 0
for k in range(n):
if i >> k & 1 and k+1 in... | p03031 |
N,M = list(map(int,input().split(" ")))
switch = []
for i in range(M):
tmp = list(map(int,input().split(" ")))
switch.append(tmp)
p = list(map(int,input().split(" ")))
light = [0 for i in range(N)]
def search(N,M,switch,p,l,light):
if l<N:
l += 1
a=search(N,M,switch,p,... | N,M = list(map(int,input().split(" ")))
light = []
for i in range(M):
tmp = list(map(int,input().split(" ")))
light.append(tmp)
p = list(map(int,input().split(" ")))
switch = [0 for i in range(N)]
def search(N,M,light,p,l,switch):
if l<N:
l += 1
a=search(N,M,light,p,l,sw... | p03031 |
#
# abc128 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)
ou... | #
# abc128 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)
ou... | p03031 |
# pythonで青くなるブログ
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
lamps = [list([int(x)-1 for x in input().split()])[1:]
#1個目は繋がっているスイッチの個数
#2個目以降が繋がっているスイッチの番号
for _ in range(M)]
p = list(map(int, input().split()))
# on になっ... | # pythonで青くなるブログ
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
lamps = [list([int(x)-1 for x in input().split()])[1:]
#1個目は繋がっているスイッチの個数
#2個目以降が繋がっているスイッチの番号、0始まりに
for _ in range(M)]
p = list(map(int, input().split()))
# ... | p03031 |
"""
n,m<=10
"""
n,m = list(map(int, input().split( )))
s = []
for i in range(m):
sij = list(map(int, input().split( )))
s.append(sij[1:])
p = list(map(int, input().split( )))
ans = 0
for i in range(2**n):
flag = True
for k in range(m):
tst = 0
for sm in s[k]:
... | n,m = list(map(int, input().split( )))
sw = [0 for _ in range(m)]#でんきゅがつながってるスイッチ
for i in range(m):
s = list(map(int, input().split( )))
s = [si-1 for si in s[1:]]
bt = 0
for sj in s:#電球
bt += 1<<sj
sw[i] = bt
p = list(map(int, input().split( )))
#スイッチ
bit = 1<<n
ans = 0... | p03031 |
import itertools
N, M = list(map(int, input().split()))
target_switches = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
answer_count = 0
for switches in itertools.product((0, 1), repeat=N):
on_count = 0
for j in range(M):
count = 0
for i i... | N, M = list(map(int, input().split())) # Nはスイッチの数、Mは電球の数
lights = [[0] * N for _ in range(M)]
for i in range(M):
temp = list(map(int, input().split())) # 0番目はスイッチの個数、1番目以降はスイッチを示す
k = temp[0]
switches = temp[1:]
for j in range(k):
lights[i][switches[j]-1] = 1
P = list(map(int, input().s... | p03031 |
N, M = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
temp = [0]*N
for i in range(2**N):
for j in range(N):
if((i >> j) & 1):
temp[j] = 1
for k in range(M):
count = 0
for l i... | import itertools
N, M = list(map(int, input().split()))
data = [list(map(int, input().split())) for _ in range(M)]
P = list(map(int, input().split()))
# スイッチが付いているか付いていないかを表す集合
ans = 0
for bit in itertools.product([0, 1], repeat=N):
for d, p in zip(data, P):
cnt = 0
for i in d[1:]:
... | p03031 |
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | p03031 |
n,m=list(map(int,input().split()))
l=[list(map(int,input().split()))[1:] for i in range(m)]
p=list(map(int,input().split()))
form = "0" + str(n) + "b"
ans=0
for i in range(2**n):
ptr = format(i,form)
flg = True
for j in range(m):
s= sum(int(ptr[k-1]) for k in l[j])
if s%2 != p[j]:
flg = False
if ... | n,m=list(map(int,input().split()))
k=[0]*m
s=[set() for i in range(m)]
for i in range(m):
k[i],*t=list(map(int,input().split()))
for j in range(k[i]):
s[i].add(t[j]-1)
ans=0
p=list(map(int,input().split()))
for i in range(2**n):
switch=[0]*n
flag=True
for j in range(n):
if i>>j&1:
... | p03031 |
N, M = list(map(int, input().split()))
s = []
for _ in range(M):
kss = list(map(int, input().split()))
s.append(set([x - 1 for x in kss[1:]]))
p = list(map(int, input().split()))
ans = 0
for bit in range(1 << N):
on_counts = [0] * M
for i in range(N):
if bit & (1 << i):
... | N, M = list(map(int, input().split()))
B = [None] * M
for i in range(M):
ks = list(map(int, input().split()))
B[i] = [s - 1 for s in ks[1:]]
p = list(map(int, input().split()))
ans = 0
bit = 0
for bit in range(1 << N):
for i, b in enumerate(B):
if p[i] != (len([1 for s in b if bit & (1 <... | p03031 |
N,M = list(map(int,input().split()))
k = [0] * M
s = [0] * M
for i in range(M):
ks = list(map(int,input().split()))
for j,x in enumerate(ks):
if j == 0:
k[i] = x
continue
s[i] += 1 << x-1
p = [int(i) for i in input().split()]
answer = 0
for i in range(2**N):... | N,M = list(map(int,input().split()))
S = []
for _ in range(M):
INPUT = tuple(map(int,input().split()))
S.append(INPUT[1:])
P = [int(i) for i in input().split()]
ans = 0
for i in range(2**N):
# state[i]: スイッチiがon
state = [False] * N
for j in range(N):
if 1 & (i >> j):
... | p03031 |
from itertools import product
N, M = list(map(int, input().split()))
k = []
s = []
for _ in range(M):
t = list(map(int, input().split()))
k.append(t[0])
s.append(t[1:])
p = list(map(int, input().split()))
ans = sum(
all(
sum(
t[j - 1]
for j in s[i]
... | from itertools import product
# 入力
N, M = list(map(int, input().split()))
k, s = list(zip(
*(
(int(k), list(map(int, s.split())))
for _ in range(M)
for k, s in [input().split(maxsplit=1)]
)
))
p = list(map(int, input().split()))
# 全探索で解を求める
ans = sum(
all(
s... | p03031 |
def fbit(k,n):
t=[]
kk=k
for i in range(n):
t.append(kk%2)
kk=int(kk/2)
return t
n,m=list(map(int,input().split()))
s=[]
for i in range(m):
si=[]
for j in range(n):
si.append(0)
s.append(si)
for j in range(m):
str=input().split()
... |
import itertools
n,m=list(map(int,input().split()))
ks=[]
for i in range(m):
ksi=list(map(int,input().split()))
ks.append(ksi)
p=list(map(int,input().split()))
icnt=0
for i in itertools.product([0,1], repeat=n):
yn=""
mcnt=0
for j in range(m):
ksum=0
for k in r... | p03031 |
# coding: utf-8
N, M = list(map(int, input().split()))
K, S = [], []
for i in range(M):
tmp = list(map(int, input().split()))
K.append(tmp[0])
S.append(tmp[1:])
P = list(map(int, input().split()))
ans = 0
for bit in range(2**N):
lamp = 0
switch = [0] * N
# インデックスに対応したランプがついてる(1, 0)... | # coding: utf-8
N, M = list(map(int, input().split()))
S = []
for i in range(M):
tmp = list(map(int, input().split()))
S.append(tmp[1:])
P = list(map(int, input().split()))
ans = 0
# print(S)
for bit in range(2**N):
l = []
for j in range(N):
if bit >> j & 1 == 1:
l.appen... | p03031 |
#!/usr/bin/env python
def main():
N, M = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(M)]
P = list(map(int, input().split()))
ans = 0
# all possible switch patterns
for i in range(2 ** N):
light_on = 0
# all switch conditions
... | #!/usr/bin/env python
def main():
N, M = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
isConflict = False
for j in range(M):
tmp = 0
... | p03031 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.