Submission #15518338

Source Code Expand

n,m = map(int,input().split())
l = [[int(x) for x in input().split()[1:]] for i in range(m)]
odd_even = [int(x) for x in input().split()]


num = 0
limit = 2**n
ans = 0
while(num < limit):
    
    isOK = True
    for i in range(m):
        cnt = 0
        for x in l[i]:
            if((num >> (x-1)) & 1):
                cnt += 1
        
        if(cnt%2!=odd_even[i]):
            isOK = False
            break        
        
    if(isOK):
        ans += 1    
    
    num += 1

print(ans)

Submission Info

Submission Time
Task C - Switches
User onigiriman
Language Python (3.8.2)
Score 300
Code Size 524 Byte
Status AC
Exec Time 41 ms
Memory 9184 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 30
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 21 ms 9044 KiB
02.txt AC 28 ms 9136 KiB
03.txt AC 26 ms 9168 KiB
04.txt AC 29 ms 8892 KiB
05.txt AC 31 ms 8900 KiB
06.txt AC 33 ms 9124 KiB
07.txt AC 31 ms 8892 KiB
08.txt AC 21 ms 8888 KiB
09.txt AC 32 ms 9020 KiB
10.txt AC 28 ms 8888 KiB
11.txt AC 26 ms 9076 KiB
12.txt AC 27 ms 8892 KiB
13.txt AC 30 ms 8984 KiB
14.txt AC 30 ms 9024 KiB
15.txt AC 30 ms 9024 KiB
16.txt AC 23 ms 9080 KiB
17.txt AC 25 ms 9184 KiB
18.txt AC 26 ms 9080 KiB
19.txt AC 31 ms 9008 KiB
20.txt AC 24 ms 8892 KiB
21.txt AC 23 ms 8888 KiB
22.txt AC 24 ms 9140 KiB
23.txt AC 23 ms 9040 KiB
24.txt AC 25 ms 8888 KiB
25.txt AC 23 ms 9020 KiB
26.txt AC 26 ms 8888 KiB
27.txt AC 41 ms 9060 KiB
s1.txt AC 25 ms 9024 KiB
s2.txt AC 31 ms 8884 KiB
s3.txt AC 24 ms 9016 KiB