結果
問題 | No.1210 XOR Grid |
ユーザー | Keroru |
提出日時 | 2020-08-30 16:19:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 413 ms / 2,000 ms |
コード長 | 4,425 bytes |
コンパイル時間 | 148 ms |
コンパイル使用メモリ | 82,240 KB |
実行使用メモリ | 268,176 KB |
最終ジャッジ日時 | 2024-04-27 09:54:31 |
合計ジャッジ時間 | 15,487 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
92,452 KB |
testcase_01 | AC | 129 ms
92,792 KB |
testcase_02 | AC | 125 ms
92,584 KB |
testcase_03 | AC | 127 ms
92,228 KB |
testcase_04 | AC | 125 ms
92,184 KB |
testcase_05 | AC | 127 ms
92,664 KB |
testcase_06 | AC | 134 ms
92,348 KB |
testcase_07 | AC | 128 ms
92,600 KB |
testcase_08 | AC | 127 ms
92,544 KB |
testcase_09 | AC | 124 ms
92,364 KB |
testcase_10 | AC | 126 ms
92,632 KB |
testcase_11 | AC | 127 ms
92,308 KB |
testcase_12 | AC | 125 ms
92,348 KB |
testcase_13 | AC | 126 ms
92,552 KB |
testcase_14 | AC | 132 ms
92,480 KB |
testcase_15 | AC | 138 ms
92,488 KB |
testcase_16 | AC | 134 ms
92,364 KB |
testcase_17 | AC | 130 ms
92,616 KB |
testcase_18 | AC | 125 ms
92,516 KB |
testcase_19 | AC | 126 ms
92,472 KB |
testcase_20 | AC | 127 ms
92,588 KB |
testcase_21 | AC | 125 ms
92,648 KB |
testcase_22 | AC | 125 ms
92,644 KB |
testcase_23 | AC | 122 ms
92,484 KB |
testcase_24 | AC | 127 ms
92,508 KB |
testcase_25 | AC | 288 ms
202,960 KB |
testcase_26 | AC | 284 ms
200,304 KB |
testcase_27 | AC | 269 ms
200,312 KB |
testcase_28 | AC | 276 ms
201,500 KB |
testcase_29 | AC | 280 ms
201,768 KB |
testcase_30 | AC | 244 ms
169,516 KB |
testcase_31 | AC | 276 ms
201,896 KB |
testcase_32 | AC | 283 ms
203,200 KB |
testcase_33 | AC | 127 ms
92,564 KB |
testcase_34 | AC | 130 ms
92,656 KB |
testcase_35 | AC | 122 ms
92,308 KB |
testcase_36 | AC | 248 ms
197,764 KB |
testcase_37 | AC | 238 ms
191,452 KB |
testcase_38 | AC | 252 ms
200,784 KB |
testcase_39 | AC | 199 ms
153,688 KB |
testcase_40 | AC | 349 ms
261,344 KB |
testcase_41 | AC | 359 ms
260,532 KB |
testcase_42 | AC | 413 ms
268,028 KB |
testcase_43 | AC | 369 ms
255,484 KB |
testcase_44 | AC | 412 ms
268,176 KB |
testcase_45 | AC | 406 ms
268,176 KB |
testcase_46 | AC | 390 ms
263,884 KB |
testcase_47 | AC | 179 ms
127,800 KB |
testcase_48 | AC | 179 ms
128,000 KB |
testcase_49 | AC | 132 ms
92,500 KB |
testcase_50 | AC | 258 ms
171,560 KB |
testcase_51 | AC | 398 ms
266,352 KB |
testcase_52 | AC | 371 ms
259,076 KB |
testcase_53 | AC | 396 ms
266,352 KB |
testcase_54 | AC | 178 ms
127,424 KB |
testcase_55 | AC | 387 ms
259,976 KB |
testcase_56 | AC | 279 ms
202,956 KB |
testcase_57 | AC | 277 ms
188,148 KB |
testcase_58 | AC | 131 ms
92,728 KB |
testcase_59 | AC | 131 ms
92,604 KB |
ソースコード
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(0) continue print(ans)