結果

問題 No.1210 XOR Grid
ユーザー KeroruKeroru
提出日時 2020-08-30 16:13:07
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,426 bytes
コンパイル時間 689 ms
コンパイル使用メモリ 81,908 KB
実行使用メモリ 268,268 KB
最終ジャッジ日時 2024-04-27 09:52:32
合計ジャッジ時間 18,660 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 151 ms
92,736 KB
testcase_01 WA -
testcase_02 AC 157 ms
92,248 KB
testcase_03 AC 163 ms
92,672 KB
testcase_04 AC 153 ms
92,464 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 164 ms
92,672 KB
testcase_08 WA -
testcase_09 AC 167 ms
92,376 KB
testcase_10 WA -
testcase_11 AC 165 ms
92,644 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 161 ms
92,608 KB
testcase_15 WA -
testcase_16 AC 157 ms
92,668 KB
testcase_17 AC 167 ms
92,416 KB
testcase_18 AC 160 ms
92,172 KB
testcase_19 AC 163 ms
92,544 KB
testcase_20 AC 153 ms
92,520 KB
testcase_21 AC 165 ms
92,300 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 331 ms
203,200 KB
testcase_26 AC 343 ms
200,316 KB
testcase_27 AC 324 ms
200,176 KB
testcase_28 AC 325 ms
201,392 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 156 ms
92,348 KB
testcase_34 AC 156 ms
92,372 KB
testcase_35 AC 160 ms
92,432 KB
testcase_36 AC 296 ms
197,612 KB
testcase_37 AC 284 ms
191,560 KB
testcase_38 AC 299 ms
201,008 KB
testcase_39 AC 236 ms
153,956 KB
testcase_40 AC 430 ms
261,468 KB
testcase_41 AC 432 ms
260,908 KB
testcase_42 AC 498 ms
267,840 KB
testcase_43 AC 430 ms
255,536 KB
testcase_44 AC 478 ms
268,160 KB
testcase_45 AC 480 ms
268,268 KB
testcase_46 AC 458 ms
264,104 KB
testcase_47 AC 214 ms
127,820 KB
testcase_48 AC 210 ms
127,924 KB
testcase_49 AC 155 ms
92,708 KB
testcase_50 AC 299 ms
171,508 KB
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 AC 213 ms
127,488 KB
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1,ls=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print((a1,a2),inp)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()


class Comb:
    def __init__(self,n,mo=10**9+7):
        self.fac=[0]*(n+1)
        self.inv=[1]*(n+1)
        self.fac[0]=1
        self.fact(n)
        for i in range(1,n+1):
            self.fac[i]=i*self.fac[i-1]%mo
            self.inv[n]*=i
            self.inv[n]%=mo
        self.inv[n]=pow(self.inv[n],mo-2,mo)
        for i in range(1,n):
            self.inv[n-i]=self.inv[n-i+1]*(n-i+1)%mo
        return
    
    def fact(self,n):
        return self.fac[n]
        
    def invf(self,n):
        return self.inv[n]

    def comb(self,x,y):
        if y<0 or y>x:
            return 0
        return self.fac[x]*self.inv[x-y]*self.inv[y]%mo


def Golf_Comb(x,y,n=10**5,M=10**9+7):
    M=10**9+7
    F=[1]
    for i in range(n):F+=F[i]*-~i%M,
    C=lambda A,B:F[A]*pow(F[A-B]*F[B],M-2,M)%M
    return C(x,y)

show_flg=False
#show_flg=True

ans=0


for i in range(1):
    ans=1
    n,m,x=LI()
    a=LI()
    b=LI()
    fl=False
    
    N=x
    x=[0]*N
    for i in range(N):
        A=sum([(aa>>i)&1for aa in a])
        B=sum([(bb>>i)&1for bb in b])
        if (A-B)%2!=0:
            fl=True
        
        ans*=pow(2,(n-1)*(m-1),mo)
        ans%=mo
    
    if fl:
        print(-1)
        continue

    print(ans)
0