結果

問題 No.1426 Got a Covered OR
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-03-12 22:11:49
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 34 ms / 2,000 ms
コード長 4,539 bytes
コンパイル時間 5,228 ms
コンパイル使用メモリ 157,152 KB
実行使用メモリ 8,028 KB
最終ジャッジ日時 2023-09-04 12:21:21
合計ジャッジ時間 8,369 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
4,628 KB
testcase_01 AC 5 ms
4,428 KB
testcase_02 AC 5 ms
4,440 KB
testcase_03 AC 5 ms
4,484 KB
testcase_04 AC 5 ms
4,444 KB
testcase_05 AC 5 ms
4,624 KB
testcase_06 AC 6 ms
4,532 KB
testcase_07 AC 5 ms
4,500 KB
testcase_08 AC 5 ms
4,504 KB
testcase_09 AC 5 ms
4,444 KB
testcase_10 AC 6 ms
4,504 KB
testcase_11 AC 5 ms
4,460 KB
testcase_12 AC 11 ms
7,124 KB
testcase_13 AC 11 ms
7,372 KB
testcase_14 AC 11 ms
5,872 KB
testcase_15 AC 10 ms
6,376 KB
testcase_16 AC 6 ms
4,644 KB
testcase_17 AC 8 ms
4,932 KB
testcase_18 AC 22 ms
6,820 KB
testcase_19 AC 22 ms
6,952 KB
testcase_20 AC 12 ms
5,412 KB
testcase_21 AC 15 ms
6,328 KB
testcase_22 AC 14 ms
7,264 KB
testcase_23 AC 34 ms
8,028 KB
testcase_24 AC 17 ms
7,484 KB
testcase_25 AC 29 ms
7,732 KB
testcase_26 AC 29 ms
7,644 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 = 10^^9 + 7;
alias Mint = ModInt!MO;

enum LIM = 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt();
      auto B = new long[N + 1];
      foreach (i; 1 .. N + 1) {
        B[i] = readLong();
      }
      
      Mint ans = 1;
      for (int i = 0, j = 1; i < N; ++j) {
        if (B[j] != -1) {
          if (B[i] & ~B[j]) {
            ans = 0;
            break;
          }
          const n = j - i;
          const a = popcnt(B[i]);
          const b = popcnt(B[i] ^ B[j]);
          Mint num;
          foreach (k; 0 .. b + 1) {
            num += binom(b, k) * (-1)^^(k & 1) * (Mint(2)^^(a + b - k) - 1)^^n;
          }
          debug {
            writeln(n, " ", a, " ", b, ": ", num);
          }
          ans *= num;
          i = j;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0