#543949 (C++14) No.1210 XOR Grid

• 問題: No.1210 XOR Grid
• ユーザー: kiyoshi0205
• 提出日時: 2020-08-30 14:21:41
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 78 ms / 2,000 ms
• コード長: 4,263 bytes
• コンパイル時間: 2,634 ms
• コンパイル使用メモリ: 187,516 KB
• 実行使用メモリ: 6,452 KB
• 最終ジャッジ日時: 2023-08-09 12:24:30
• 合計ジャッジ時間: 7,037 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	2 ms; 4,376 KB
testcase_04	AC	2 ms; 4,388 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	2 ms; 4,380 KB
testcase_07	AC	1 ms; 4,380 KB
testcase_08	AC	2 ms; 4,380 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	1 ms; 4,380 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	1 ms; 4,376 KB
testcase_14	AC	1 ms; 4,380 KB
testcase_15	AC	1 ms; 4,380 KB
testcase_16	AC	2 ms; 4,384 KB
testcase_17	AC	1 ms; 4,380 KB
testcase_18	AC	1 ms; 4,380 KB
testcase_19	AC	2 ms; 4,380 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	2 ms; 4,380 KB
testcase_22	AC	1 ms; 4,380 KB
testcase_23	AC	1 ms; 4,380 KB
testcase_24	AC	2 ms; 4,380 KB
testcase_25	AC	40 ms; 4,676 KB
testcase_26	AC	40 ms; 4,568 KB
testcase_27	AC	40 ms; 4,692 KB
testcase_28	AC	40 ms; 4,580 KB
testcase_29	AC	40 ms; 4,628 KB
testcase_30	AC	32 ms; 4,380 KB
testcase_31	AC	39 ms; 4,560 KB
testcase_32	AC	40 ms; 4,824 KB
testcase_33	AC	1 ms; 4,380 KB
testcase_34	AC	1 ms; 4,380 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	13 ms; 4,568 KB
testcase_37	AC	14 ms; 4,568 KB
testcase_38	AC	13 ms; 4,692 KB
testcase_39	AC	13 ms; 4,752 KB
testcase_40	AC	25 ms; 6,280 KB
testcase_41	AC	25 ms; 6,452 KB
testcase_42	AC	78 ms; 6,160 KB
testcase_43	AC	68 ms; 6,212 KB
testcase_44	AC	78 ms; 6,276 KB
testcase_45	AC	77 ms; 6,148 KB
testcase_46	AC	74 ms; 6,212 KB
testcase_47	AC	28 ms; 6,148 KB
testcase_48	AC	28 ms; 6,212 KB
testcase_49	AC	2 ms; 4,380 KB
testcase_50	AC	40 ms; 6,272 KB
testcase_51	AC	77 ms; 6,304 KB
testcase_52	AC	67 ms; 6,004 KB
testcase_53	AC	76 ms; 6,156 KB
testcase_54	AC	28 ms; 6,148 KB
testcase_55	AC	50 ms; 6,208 KB
testcase_56	AC	40 ms; 4,868 KB
testcase_57	AC	43 ms; 5,480 KB
testcase_58	AC	2 ms; 4,380 KB
testcase_59	AC	1 ms; 4,380 KB

ソースコード

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

void topcoder(vector<int>& v){
  string s;
  while(1){
    cin>>s;
    int i=s[0]=='{',x=0;
    while(s[i]>='0'&&s[i]<='9'){
      x=x*10+s[i]-'0';
      ++i;
    }
    v.eb(x);
    if(s[i]=='}')break;
  }
}
void topcoder(string& s){
  string t;
  cin>>t;
  int i=1;
  while(t[i]!='"'){
    s+=t[i++];
  }
}
struct unionfind{
  private:
  int maxN;
  vector<int> par,treesize;
  public:unionfind(int N) :maxN(N),par(N),treesize(N,1){
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  int root(int x){
    while(par[x]!=x){
      x=par[x]=par[par[x]];
    }
    return x;
  }
  bool unite(int x,int y){
    x=root(x);
    y=root(y);
    if(x==y)return false;
    if(treesize[x]>treesize[y])swap(x,y);
    par[x]=y;
    treesize[y]+=treesize[x];
    return true;
  }
  bool parcheck(int x,int y){
    return root(x)==root(y);
  }
  int size(int x){
    return treesize[root(x)];
  }
  void clear(){
    treesize.assign(maxN,1);
    for(int i=0;i<maxN;++i)par[i]=i;
  }
};

ll N,M,K;
ll ans;

int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j,c;
  cin>>N>>M>>c;
  vec a(N),b(M);
  rep(i,N)cin>>a[i];
  rep(i,M)cin>>b[i];
  rep(i,N)K^=a[i];
  rep(i,M)K^=b[i];
  if(K){print(0);return 0;}
  i=modpow(2,(N-1)*(M-1));
  print(modpow(i,c));
}