結果
問題 | No.1210 XOR Grid |
ユーザー | LayCurse |
提出日時 | 2020-08-30 13:45:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 6,732 bytes |
コンパイル時間 | 3,619 ms |
コンパイル使用メモリ | 212,016 KB |
実行使用メモリ | 8,696 KB |
最終ジャッジ日時 | 2023-08-09 11:59:11 |
合計ジャッジ時間 | 6,795 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,356 KB |
testcase_01 | AC | 2 ms
5,604 KB |
testcase_02 | AC | 2 ms
5,628 KB |
testcase_03 | AC | 3 ms
5,468 KB |
testcase_04 | AC | 2 ms
5,468 KB |
testcase_05 | AC | 2 ms
5,420 KB |
testcase_06 | AC | 2 ms
5,388 KB |
testcase_07 | AC | 2 ms
5,604 KB |
testcase_08 | AC | 2 ms
5,452 KB |
testcase_09 | AC | 2 ms
5,380 KB |
testcase_10 | AC | 2 ms
5,672 KB |
testcase_11 | AC | 2 ms
5,604 KB |
testcase_12 | AC | 2 ms
5,424 KB |
testcase_13 | AC | 2 ms
5,484 KB |
testcase_14 | AC | 2 ms
5,492 KB |
testcase_15 | AC | 2 ms
5,428 KB |
testcase_16 | AC | 2 ms
5,432 KB |
testcase_17 | AC | 3 ms
5,392 KB |
testcase_18 | AC | 2 ms
5,428 KB |
testcase_19 | AC | 3 ms
5,424 KB |
testcase_20 | AC | 2 ms
5,424 KB |
testcase_21 | AC | 2 ms
5,360 KB |
testcase_22 | AC | 2 ms
5,380 KB |
testcase_23 | AC | 2 ms
5,416 KB |
testcase_24 | AC | 2 ms
5,428 KB |
testcase_25 | AC | 21 ms
6,864 KB |
testcase_26 | AC | 24 ms
8,048 KB |
testcase_27 | AC | 24 ms
7,964 KB |
testcase_28 | AC | 21 ms
6,936 KB |
testcase_29 | AC | 16 ms
7,960 KB |
testcase_30 | AC | 10 ms
6,980 KB |
testcase_31 | AC | 16 ms
8,060 KB |
testcase_32 | AC | 12 ms
7,108 KB |
testcase_33 | AC | 2 ms
5,696 KB |
testcase_34 | AC | 2 ms
5,528 KB |
testcase_35 | AC | 2 ms
5,428 KB |
testcase_36 | AC | 13 ms
6,468 KB |
testcase_37 | AC | 13 ms
7,332 KB |
testcase_38 | AC | 13 ms
7,328 KB |
testcase_39 | AC | 8 ms
6,336 KB |
testcase_40 | AC | 22 ms
8,420 KB |
testcase_41 | AC | 24 ms
8,408 KB |
testcase_42 | AC | 42 ms
8,548 KB |
testcase_43 | AC | 35 ms
8,540 KB |
testcase_44 | AC | 43 ms
8,468 KB |
testcase_45 | AC | 41 ms
8,472 KB |
testcase_46 | AC | 40 ms
8,488 KB |
testcase_47 | AC | 6 ms
8,292 KB |
testcase_48 | AC | 7 ms
8,420 KB |
testcase_49 | AC | 2 ms
5,464 KB |
testcase_50 | AC | 17 ms
8,564 KB |
testcase_51 | AC | 25 ms
8,512 KB |
testcase_52 | AC | 22 ms
8,392 KB |
testcase_53 | AC | 24 ms
8,472 KB |
testcase_54 | AC | 7 ms
8,256 KB |
testcase_55 | AC | 14 ms
8,696 KB |
testcase_56 | AC | 12 ms
7,108 KB |
testcase_57 | AC | 13 ms
7,876 KB |
testcase_58 | AC | 2 ms
5,380 KB |
testcase_59 | AC | 2 ms
5,364 KB |
ソースコード
#pragma GCC optimize ("Ofast") #include<bits/stdc++.h> using namespace std; #define MD (1000000007U) struct Modint{ unsigned val; Modint(){ val=0; } Modint(int a){ val = ord(a); } Modint(unsigned a){ val = ord(a); } Modint(long long a){ val = ord(a); } Modint(unsigned long long a){ val = ord(a); } inline unsigned ord(unsigned a){ return a%MD; } inline unsigned ord(int a){ a %= (int)MD; if(a < 0){ a += MD; } return a; } inline unsigned ord(unsigned long long a){ return a%MD; } inline unsigned ord(long long a){ a %= (int)MD; if(a < 0){ a += MD; } return a; } inline unsigned get(){ return val; } inline Modint &operator+=(Modint a){ val += a.val; if(val >= MD){ val -= MD; } return *this; } inline Modint &operator-=(Modint a){ if(val < a.val){ val = val + MD - a.val; } else{ val -= a.val; } return *this; } inline Modint &operator*=(Modint a){ val = ((unsigned long long)val*a.val)%MD; return *this; } inline Modint &operator/=(Modint a){ return *this *= a.inverse(); } inline Modint operator+(Modint a){ return Modint(*this)+=a; } inline Modint operator-(Modint a){ return Modint(*this)-=a; } inline Modint operator*(Modint a){ return Modint(*this)*=a; } inline Modint operator/(Modint a){ return Modint(*this)/=a; } inline Modint operator+(int a){ return Modint(*this)+=Modint(a); } inline Modint operator-(int a){ return Modint(*this)-=Modint(a); } inline Modint operator*(int a){ return Modint(*this)*=Modint(a); } inline Modint operator/(int a){ return Modint(*this)/=Modint(a); } inline Modint operator+(long long a){ return Modint(*this)+=Modint(a); } inline Modint operator-(long long a){ return Modint(*this)-=Modint(a); } inline Modint operator*(long long a){ return Modint(*this)*=Modint(a); } inline Modint operator/(long long a){ return Modint(*this)/=Modint(a); } inline Modint operator-(void){ Modint res; if(val){ res.val=MD-val; } else{ res.val=0; } return res; } inline operator bool(void){ return val!=0; } inline operator int(void){ return get(); } inline operator long long(void){ return get(); } inline Modint inverse(){ int a = val; int b = MD; int u = 1; int v = 0; int t; Modint res; while(b){ t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } if(u < 0){ u += MD; } res.val = u; return res; } inline Modint pw(unsigned long long b){ Modint a(*this); Modint res; res.val = 1; while(b){ if(b&1){ res *= a; } b >>= 1; a *= a; } return res; } inline bool operator==(int a){ return ord(a)==val; } inline bool operator!=(int a){ return ord(a)!=val; } } ; inline Modint operator+(int a, Modint b){ return Modint(a)+=b; } inline Modint operator-(int a, Modint b){ return Modint(a)-=b; } inline Modint operator*(int a, Modint b){ return Modint(a)*=b; } inline Modint operator/(int a, Modint b){ return Modint(a)/=b; } inline Modint operator+(long long a, Modint b){ return Modint(a)+=b; } inline Modint operator-(long long a, Modint b){ return Modint(a)-=b; } inline Modint operator*(long long a, Modint b){ return Modint(a)*=b; } inline Modint operator/(long long a, Modint b){ return Modint(a)/=b; } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } inline void rd(long long &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(int x){ int s=0; int m=0; char f[10]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(Modint x){ int i; i = (int)x; wt_L(i); } template<class T, class S> inline T pow_L(T a, S b){ T res = 1; res = 1; for(;;){ if(b&1){ res *= a; } b >>= 1; if(b==0){ break; } a *= a; } return res; } inline double pow_L(double a, double b){ return pow(a,b); } int N; int M; int X; long long A[200000]; long long B[200000]; int main(){ int b; int r; int c; Modint res; rd(N); rd(M); rd(X); { int Lj4PdHRW; for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){ rd(A[Lj4PdHRW]); } } { int e98WHCEY; for(e98WHCEY=(0);e98WHCEY<(M);e98WHCEY++){ rd(B[e98WHCEY]); } } for(b=(0);b<(X);b++){ int i; r = c = 0; for(i=(0);i<(N);i++){ if(A[i]&1LL<<b){ r++; } } for(i=(0);i<(M);i++){ if(B[i]&1LL<<b){ c++; } } if(r%2 != c%2){ wt_L(0); wt_L('\n'); return 0; } } res =(pow_L(Modint(2),((long long) N * M - N - M + 1))); (res = pow_L(res,X)); wt_L(res); wt_L('\n'); return 0; } // cLay varsion 20200813-1 [beta] // --- original code --- // int N, M, X; // ll A[2d5], B[2d5]; // { // int r, c; // Modint res; // rd(N,M,X,A(N),B(M)); // rep(b,X){ // r = c = 0; // rep(i,N) if(A[i]&1LL<<b) r++; // rep(i,M) if(B[i]&1LL<<b) c++; // if(r%2 != c%2) wt(0), return 0; // } // res = Modint(2) ** ((ll) N * M - N - M + 1); // res **= X; // wt(res); // }