結果

問題 No.1142 XOR と XOR
コンテスト
ユーザー Ricky_pon
提出日時 2020-07-31 22:36:41
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 3,880 bytes
コンパイル時間 2,117 ms
コンパイル使用メモリ 198,892 KB
最終ジャッジ日時 2025-01-12 10:53:25
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:150:16: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘modint<1000000007>::i64’ {aka ‘long int’} [-Wformat=]
  150 |     printf("%lld\n", ans.a);
      |             ~~~^     ~~~~~
      |                |         |
      |                |         modint<1000000007>::i64 {aka long int}
      |                long long int
      |             %ld
main.cpp:125:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  125 |     scanf("%d%d%d", &n, &m, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp:128:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  128 |     rep(i, n) scanf("%d", &a[i+1]), a[i+1] ^= a[i];
      |               ~~~~~^~~~~~~~~~~~~~~
main.cpp:129:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  129 |     rep(i, m) scanf("%d", &b[i+1]), b[i+1] ^= b[i];
      |               ~~~~~^~~~~~~~~~~~~~~

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
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(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 500010;

template<int_fast64_t MOD> struct modint{
    using i64=int_fast64_t;
    i64 a;
    modint(const i64 a_=0): a(a_){
        if(a>MOD) a%=MOD;
        else if(a<0) (a%=MOD)+=MOD;
    }
    modint inv(){
        i64 t=1, n=MOD-2, x=a;
        while(n){
            if(n&1) (t*=x)%=MOD;
            (x*=x)%=MOD;
            n>>=1;
        }
        modint ret(t);
        return ret;
    }
    bool operator==(const modint x) const{return a==x.a;}
    bool operator!=(const modint x) const{return a!=x.a;}
    modint operator+(const modint x) const{
        return modint(*this)+=x;
    }
    modint operator-(const modint x) const{
        return modint(*this)-=x;
    }
    modint operator*(const modint x) const{
        return modint(*this)*=x;
    }
    modint operator/(const modint x) const{
        return modint(*this)/=x;
    }
    modint operator^(const lint x) const{
        return modint(*this)^=x;
    }
    modint &operator+=(const modint &x){
        a+=x.a;
        if(a>=MOD) a-=MOD;
        return *this;
    }
    modint &operator-=(const modint &x){
        a-=x.a;
        if(a<0) a+=MOD;
        return *this;
    }
    modint &operator*=(const modint &x){
        (a*=x.a)%=MOD;
        return *this;
    }
    modint &operator/=(modint x){
        (a*=x.inv().a)%=MOD;
        return *this;
    }
    modint &operator^=(lint n){
        i64 ret=1;
        while(n){
            if(n&1) (ret*=a)%=MOD;
            (a*=a)%=MOD;
            n>>=1;
        }
        a=ret;
        return *this;
    }
    modint operator-() const{
        return modint(0)-*this;
    }
    modint &operator++(){
        return *this+=1;
    }
    modint &operator--(){
        return *this-=1;
    }
    bool operator<(const modint x) const{
        return a<x.a;
    }
};

using mint=modint<1000000007>;

vector<mint> fact;
vector<mint> revfact;

void setfact(int n){
    fact.resize(n+1); revfact.resize(n+1);
    fact[0] = 1;
    rep(i, n) fact[i+1] = fact[i] * mint(i+1);

    revfact[n] = fact[n].inv();
    for(int i=n-1; i>=0; i--) revfact[i] = revfact[i+1] * mint(i+1);
}

mint getC(int n, int r){
    if(n<r) return 0;
    return fact[n] * revfact[r] * revfact[n-r];
}

int main(){
    int n, m, K;
    scanf("%d%d%d", &n, &m, &K);
    int a[n+1], b[m+1];
    a[0] = b[0] = 0;
    rep(i, n) scanf("%d", &a[i+1]), a[i+1] ^= a[i];
    rep(i, m) scanf("%d", &b[i+1]), b[i+1] ^= b[i];
    mint apos[1<<10], bpos[1<<10];
    rep(i, 1<<10) apos[i] = bpos[i] = 0;
    rep(i, n+1) ++apos[a[i]];
    rep(i, m+1) ++bpos[b[i]];

    mint acnt[1<<10], bcnt[1<<10];
    rep(i, 1<<10) acnt[i] = bcnt[i] = 0;
    rep(i, 1<<10)For(j, i, 1<<10){
        if(i != j){
            acnt[i^j] += apos[i] * apos[j];
            bcnt[i^j] += bpos[i] * bpos[j];
        }
        else{
            acnt[i^j] += apos[i] * (apos[i]-1) / 2;
            bcnt[i^j] += bpos[i] * (bpos[i]-1) / 2;
        }
    }

    mint ans = 0;
    rep(i, 1<<10) ans += acnt[i] * bcnt[K^i];
    printf("%lld\n", ans.a);
}
0