結果

問題 No.1142 XOR と XOR
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-07-31 21:36:50
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 3,871 bytes
コンパイル時間 1,725 ms
コンパイル使用メモリ 154,236 KB
実行使用メモリ 19,276 KB
最終ジャッジ日時 2024-06-22 07:55:32
合計ジャッジ時間 3,595 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
6,816 KB
testcase_01 AC 10 ms
6,940 KB
testcase_02 AC 11 ms
6,944 KB
testcase_03 AC 57 ms
19,208 KB
testcase_04 AC 43 ms
14,020 KB
testcase_05 AC 36 ms
9,008 KB
testcase_06 AC 44 ms
10,752 KB
testcase_07 AC 41 ms
19,276 KB
testcase_08 AC 52 ms
18,780 KB
testcase_09 AC 54 ms
18,816 KB
testcase_10 AC 54 ms
18,880 KB
testcase_11 AC 11 ms
6,944 KB
testcase_12 AC 11 ms
6,940 KB
testcase_13 AC 10 ms
6,940 KB
testcase_14 AC 33 ms
10,764 KB
testcase_15 AC 32 ms
10,796 KB
testcase_16 AC 13 ms
6,944 KB
testcase_17 AC 32 ms
9,456 KB
testcase_18 AC 14 ms
6,940 KB
testcase_19 AC 43 ms
11,188 KB
testcase_20 AC 32 ms
8,756 KB
testcase_21 AC 23 ms
6,940 KB
testcase_22 AC 18 ms
6,944 KB
testcase_23 AC 41 ms
10,204 KB
testcase_24 AC 45 ms
10,992 KB
testcase_25 AC 30 ms
10,116 KB
testcase_26 AC 43 ms
10,312 KB
testcase_27 AC 35 ms
10,732 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 1000000007;
alias Mint = ModInt!MO;

enum LIM = 1 << 10;

void main() {
  try {
    for (; ; ) {
      const M = readInt();
      const N = readInt();
      const K = readInt();
      auto A = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
      }
      auto B = new int[N];
      foreach (i; 0 .. N) {
        B[i] = readInt();
      }
      
      Mint[] calc(int[] as) {
        auto freq = new long[LIM];
        int s;
        freq[s] += 1;
        foreach (a; as) {
          s ^= a;
          freq[s] += 1;
        }
        auto ret = new Mint[LIM];
        foreach (x; 0 .. LIM) {
          ret[0] += freq[x] * (freq[x] - 1) / 2;
        }
        foreach (x; 0 .. LIM) foreach (y; x + 1 .. LIM) {
          ret[x ^ y] += freq[x] * freq[y];
        }
        return ret;
      }
      
      const fs = calc(A);
      const gs = calc(B);
      Mint ans;
      foreach (x; 0 .. LIM) {
        ans += fs[x] * gs[x ^ K];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0