結果

問題 No.2040 010-1 Deletion
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-08-12 23:08:15
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 133 ms / 3,000 ms
コード長 6,355 bytes
コンパイル時間 3,221 ms
コンパイル使用メモリ 152,832 KB
実行使用メモリ 74,880 KB
最終ジャッジ日時 2024-11-08 22:00:11
合計ジャッジ時間 6,394 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 AC 1 ms
5,248 KB
testcase_08 AC 1 ms
5,248 KB
testcase_09 AC 1 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 97 ms
74,752 KB
testcase_12 AC 98 ms
74,752 KB
testcase_13 AC 96 ms
74,880 KB
testcase_14 AC 95 ms
74,752 KB
testcase_15 AC 108 ms
74,880 KB
testcase_16 AC 133 ms
74,752 KB
testcase_17 AC 81 ms
74,880 KB
testcase_18 AC 132 ms
74,880 KB
testcase_19 AC 12 ms
10,624 KB
testcase_20 AC 8 ms
7,936 KB
testcase_21 AC 40 ms
32,128 KB
testcase_22 AC 57 ms
51,712 KB
testcase_23 AC 87 ms
68,736 KB
testcase_24 AC 96 ms
73,088 KB
testcase_25 AC 77 ms
63,488 KB
testcase_26 AC 68 ms
59,520 KB
testcase_27 AC 83 ms
65,920 KB
testcase_28 AC 72 ms
59,264 KB
testcase_29 AC 85 ms
66,432 KB
testcase_30 AC 46 ms
34,944 KB
testcase_31 AC 96 ms
71,808 KB
testcase_32 AC 95 ms
73,216 KB
testcase_33 AC 92 ms
72,320 KB
testcase_34 AC 93 ms
72,704 KB
testcase_35 AC 94 ms
72,448 KB
testcase_36 AC 88 ms
70,400 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(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = cast(uint)(x_ % M); }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

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


void main() {
  /*
  debug {{
    bool greedy(in string s) {
      const n = cast(int)(s.length);
      int[] xs, ys;
      for (int i = 0, j; i < n; i = j) {
        for (j = i; j < n && s[i] == s[j]; ++j) {}
        if (s[i] == '0') {
          foreach (k; i .. j) {
            xs ~= k;
          }
        } else {
          ys ~= i;
        }
      }
      if (xs.length % 2 != 0) {
        return false;
      }
      const len = xs.length / 2;
      
      int l;
      foreach (k; 0 .. len) {
        for (; ; ) {
          if (l == ys.length) {
            return false;
          }
          if (xs[k] < ys[l]) {
            if (ys[l] < xs[len + k]) {
              ++l;
              break;
            } else {
              return false;
            }
          } else {
            ++l;
          }
        }
      }
      return true;
    }
    
    bool wise(in string s) {
      const n = cast(int)(s.length);
      int zero, cnt;
      for (int i = 0, j; i < n; i = j) {
        for (j = i; j < n && s[i] == s[j]; ++j) {}
        if (s[i] == '0') {
          zero += (j - i);
          ++cnt;
        }
      }
      return (zero == 0 || (zero % 2 == 0 && cnt >= zero / 2 + 1));
    }
    
    enum lim = 16;
    auto dp = new bool[][lim];
    dp[0] = [true];
    foreach (n; 1 .. lim) {
      dp[n] = new bool[1 << n];
      foreach (p; 0 .. 1 << n) {
        foreach (i; 0 .. n) if (p >> i & 1) {
          if (dp[n - 1][(p & ((1 << i) - 1)) | (p >> (i + 1) << i)]) {
            dp[n][p] = true;
          }
        }
        foreach (i; 0 .. n - 2) if ((p >> i & 7) == 2) {
          if (dp[n - 3][(p & ((1 << i) - 1)) | (p >> (i + 3) << i)]) {
            dp[n][p] = true;
          }
        }
      }
      int cnt;
      foreach (p; 0 .. 1 << n) {
        const s = iota(n).map!(i => "01"[p >> i & 1]).array;
        if (dp[n][p]) {
          ++cnt;
          writeln(s);
        }
        const grd = greedy(s);
        const wis = wise(s);
        assert(dp[n][p] == grd && dp[n][p] == wis, format("%s: %s %s %s", s, dp[n][p], grd, wis));
      }
      stderr.writeln(n, ": ", cnt);
      stderr.flush;
    }
    return;
  }}
  //*/
/*
1: 1
2: 1
3: 2
4: 4
5: 7
6: 14
7: 29
8: 57
9: 114
10: 232
11: 465
12: 931
13: 1876
14: 3767
15: 7548
*/
  
  try {
    for (; ; ) {
      const N = readInt;
      auto S = readToken;
      
      bool all1 = true;
      // 2 cnt - zero >= 2
      const lim = 2 * N + 10;
      const off = N + 5;
      auto dp = new Mint[][][][](N + 1, 2, 2, lim);
      dp[0][1][0][off] = 1;
      foreach (i; 0 .. N) {
        const can0 = (S[i] == '?' || S[i] == '0');
        const can1 = (S[i] == '?' || S[i] == '1');
        all1 = all1 && can1;
        foreach (last; 0 .. 2) foreach (s; 0 .. 2) foreach (x; 0 .. lim) {
          if (dp[i][last][s][x]) {
            if (can0) dp[i + 1][0][s ^ 1][x + 2 * last - 1] += dp[i][last][s][x];
            if (can1) dp[i + 1][1][s][x] += dp[i][last][s][x];
          }
        }
      }
      
      Mint ans;
      foreach (last; 0 .. 2) foreach (x; 0 .. lim) if (x - off >= 2) {
        ans += dp[N][last][0][x];
      }
      
      // all 1
      if (all1) {
        ans += 1;
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0