結果

問題 No.1239 Multiplication -2
コンテスト
ユーザー hos.lyric
提出日時 2020-09-25 22:01:09
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 36 ms / 2,000 ms
コード長 4,260 bytes
コンパイル時間 1,542 ms
コンパイル使用メモリ 156,704 KB
実行使用メモリ 14,788 KB
最終ジャッジ日時 2024-06-22 09:10:20
合計ジャッジ時間 3,149 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

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 = 998244353;
alias Mint = ModInt!MO;

/*
  [i, j): 2^(i + N - j)
*/
void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      auto two = new Mint[N + 1];
      two[0] = 1;
      foreach (i; 1 .. N + 1) {
        two[i] = two[i - 1] * 2;
      }
      
      Mint ans;
      
      auto sumSig = new int[N + 1];
      auto sumTwo = new int[N + 1];
      for (int i = 0, j; i < N; i = j) {
        for (j = i; j < N && (A[i] != 0) == (A[j] != 0); ++j) {}
        if (A[i] != 0) {
          debug {
            writefln("[%s, %s): %s", i, j, A[i .. j]);
          }
          sumSig[i] = 0;
          sumTwo[i] = 0;
          foreach (k; i .. j) {
            sumSig[k + 1] = sumSig[k] ^ ((A[k] < 0) ? 1 : 0);
            sumTwo[k + 1] = sumTwo[k] + ((A[k] % 2 == 0) ? 1 : 0);
          }
          auto sums = new Mint[][](2, j - i + 1);
          foreach (k; i .. j + 1) {
            const s = sumSig[k];
            const t = sumTwo[k];
            debug {
              writeln("  ", k, ": ", s, " ", t);
            }
            if (t >= 1) {
              ans += sums[s ^ 1][t - 1] * two[max(N - k - 1, 0)];
            }
            sums[s][t] += two[max(k - 1, 0)];
          }
        }
      }
      
      ans /= two[N - 1];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0