結果

問題 No.1142 XOR と XOR
ユーザー mugen_1337mugen_1337
提出日時 2020-07-31 22:43:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 711 ms / 2,000 ms
コード長 5,078 bytes
コンパイル時間 3,278 ms
コンパイル使用メモリ 197,956 KB
最終ジャッジ日時 2025-01-12 11:01:06
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
struct IOSetup{
IOSetup(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(12);
}
} iosetup;
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
os<<p.first<<" "<<p.second;
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
return os;
}
template<ll Mod>
struct ModInt{
long long x;
ModInt():x(0){}
ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
ModInt &operator+=(const ModInt &p){
if((x+=p.x)>=Mod) x-=Mod;
return *this;
}
ModInt &operator-=(const ModInt &p){
if((x+=Mod-p.x)>=Mod)x-=Mod;
return *this;
}
ModInt &operator*=(const ModInt &p){
x=(int)(1ll*x*p.x%Mod);
return *this;
}
ModInt &operator/=(const ModInt &p){
(*this)*=p.inverse();
return *this;
}
ModInt operator-()const{return ModInt(x);}
ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
ModInt operator==(const ModInt &p)const{return x==p.x;}
ModInt operator!=(const ModInt &p)const{return x!=p.x;}
ModInt inverse()const{
int a=x,b=Mod,u=1,v=0,t;
while(b>0){
t=a/b;
swap(a-=t*b,b);swap(u-=t*v,v);
}
return ModInt(u);
}
ModInt pow(long long n)const{
ModInt ret(1),mul(x);
while(n>0){
if(n&1) ret*=mul;
mul*=mul;n>>=1;
}
return ret;
}
friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
static int get_mod(){return Mod;}
};
using mint=ModInt<mod>;
template<int MAX>
struct comcalc{
vector<mint> fact,finv,inv;
comcalc():fact(MAX),finv(MAX),inv(MAX){
fact[0]=mint(1),fact[1]=mint(1),finv[0]=mint(1),finv[1]=mint(1),inv[1]=mint(1);
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*mint(i);
inv[i]=mint(0)-inv[mod%i]*(mint(mod/i));
finv[i]=finv[i-1]*inv[i];
}
}
mint com(int n,int k){
if(n<k) return mint(0);
if(n<0 or k<0) return mint(0);
return fact[n]*(finv[k]*finv[n-k]);
}
mint fac(int n){
return fact[n];
}
// :nk
mint nHk(int n,int k){
return com(n+k-1,k);
}
// nk1O(k)
mint F12_dis_dis_one(int n,int k){
mint ret=1;
for(int i=0;i<=k;i++){
mint add=com(k,i)*(mint(i).pow(n));
if((k-i)%2) ret-=add;
else ret+=add;
}
return ret;
}
};
mint pow_mod(mint x,ll n){
return x.pow(n);
}
mint inv_mod(mint x){
return x.inverse();
}
// O(n)
mint fact_mod(ll n){
mint ret=1;
for(int i=2;i<=n;i++) ret*=mint(i);
return ret;
}
// O(r)
mint comb_mod(ll n,ll r){
if(r>n-r) r=n-r;
if(r==0) return 1;
mint a=1,b=mint(fact_mod(r)).inverse();
for(int i=0;i<r;i++)a*=mint(n-i);
return a*b;
}
const int MAX=4010000;
using cominit=comcalc<MAX>;
signed main(){
int n,m,k;cin>>n>>m>>k;
vector<int> a(n),b(m),sa(n+1),sb(m+1);
sa[0]=0,sb[0]=0;
rep(i,n){
cin>>a[i];
sa[i+1]=sa[i]^a[i];
}
rep(i,m){
cin>>b[i];
sb[i+1]=sb[i]^b[i];
}
vector<mint> va(1024,0);
vector<mint> vb(1024,0);
{
vector<mint> t(1024,0);
rep(i,n+1){
rep(j,1024){
va[sa[i]^j]+=t[j];
}
t[sa[i]]+=1;
}
}
{
vector<mint> t(1024,0);
rep(i,m+1){
rep(j,1024){
vb[sb[i]^j]+=t[j];
}
t[sb[i]]+=1;
}
}
// debug(sa);
// debug(sb);
// rep(i,1024){
// if(va[i].x>0){
// cout<<"a "<<i<<" : "<<va[i]<<endl;
// }
// }
// rep(i,1024){
// if(vb[i].x>0){
// cout<<"b "<<i<<" : "<<vb[i]<<endl;
// }
// }
mint res=0;
rep(i,1024){
int op=i^k;
res+=va[i]*vb[op];
}
cout<<res<<endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0