#691272 (D) No.1654 Binary Compression

提出ソース

結果

問題	No.1654 Binary Compression
ユーザー	👑 hos.lyric
提出日時	2021-08-20 22:31:37
言語	D (dmd 2.106.1)
結果	AC
実行時間	193 ms / 2,000 ms
コード長	5,617 bytes
コンパイル時間	1,923 ms
コンパイル使用メモリ	154,924 KB
実行使用メモリ	96,612 KB
最終ジャッジ日時	2024-06-22 12:08:17
合計ジャッジ時間	10,940 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	1 ms 6,944 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	182 ms 88,824 KB
testcase_11	AC	192 ms 89,544 KB
testcase_12	AC	190 ms 93,996 KB
testcase_13	AC	187 ms 95,724 KB
testcase_14	AC	187 ms 93,608 KB
testcase_15	AC	188 ms 92,020 KB
testcase_16	AC	160 ms 94,516 KB
testcase_17	AC	160 ms 94,052 KB
testcase_18	AC	190 ms 95,100 KB
testcase_19	AC	191 ms 95,120 KB
testcase_20	AC	193 ms 94,284 KB
testcase_21	AC	190 ms 93,972 KB
testcase_22	AC	190 ms 95,472 KB
testcase_23	AC	144 ms 94,712 KB
testcase_24	AC	144 ms 94,212 KB
testcase_25	AC	144 ms 94,996 KB
testcase_26	AC	142 ms 95,408 KB
testcase_27	AC	157 ms 96,404 KB
testcase_28	AC	154 ms 92,940 KB
testcase_29	AC	143 ms 94,424 KB
testcase_30	AC	144 ms 94,972 KB
testcase_31	AC	144 ms 94,992 KB
testcase_32	AC	142 ms 94,680 KB
testcase_33	AC	158 ms 95,096 KB
testcase_34	AC	153 ms 93,488 KB
testcase_35	AC	143 ms 94,520 KB
testcase_36	AC	143 ms 94,964 KB
testcase_37	AC	142 ms 93,644 KB
testcase_38	AC	141 ms 95,260 KB
testcase_39	AC	152 ms 93,688 KB
testcase_40	AC	148 ms 93,332 KB
testcase_41	AC	149 ms 94,708 KB
testcase_42	AC	153 ms 95,028 KB
testcase_43	AC	150 ms 95,096 KB
testcase_44	AC	149 ms 95,492 KB
testcase_45	AC	149 ms 94,348 KB
testcase_46	AC	163 ms 96,052 KB
testcase_47	AC	1 ms 6,944 KB
testcase_48	AC	1 ms 6,940 KB
testcase_49	AC	159 ms 95,764 KB
testcase_50	AC	161 ms 94,548 KB
testcase_51	AC	171 ms 93,532 KB
testcase_52	AC	165 ms 96,612 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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


void main() {
  try {
    for (; ; ) {
      const S = readToken();
      const N = cast(int)(S.length);
      
      auto last = new int[N];
      auto app0 = new int[N];
      app0[] = -1;
      int app1 = -1;
      auto begs = new int[N];
      auto ends = new int[N];
      for (int i = 0, j; i < N; i = j) {
        if (S[i] == '0') {
          for (j = i; j < N && S[i] == S[j]; ++j) {}
          foreach (k; i .. j) {
            last[k] = app0[k - i];
            app0[k - i] = k;
            begs[k] = i;
            ends[k] = j;
          }
        } else {
          last[i] = app1;
          app1 = i;
          begs[i] = -2;
          ends[i] = -2;
          j = i + 1;
        }
      }
      debug {
        writeln("S = ", S);
        writeln("last = ", last);
      }
      
      auto dp = new Mint[N];
      auto dp0Sum = new Mint[N + 1];
      auto dp1Sum = new Mint[N + 1];
      Mint ans;
      foreach (i; 0 .. N) {
        if (S[i] == '0') {
          if (begs[i] == 0) {
            dp[i] += 1;
          }
          if (ends[i] == N) {
            ans += dp[i];
            ans += dp1Sum[i];
          }
          dp[i] += dp1Sum[begs[i]] - dp1Sum[last[i] + 1];
          dp0Sum[i + 1] = dp0Sum[i] + dp[i];
          dp1Sum[i + 1] = dp1Sum[i];
        } else {
          if (!~last[i]) {
            dp[i] += 1;
          }
          dp[i] += dp0Sum[i] - dp0Sum[last[i] + 1];
          if (~last[i]) {
            dp[i] += dp[last[i]];
          }
          ans += dp[i];
          dp0Sum[i + 1] = dp0Sum[i];
          dp1Sum[i + 1] = dp1Sum[i] + dp[i];
        }
      }
      debug {
        writeln("dp = ", dp);
      }
      
      writeln(ans);
      
      debug {
        if (N <= 16) {
          string[] ss;
          foreach (p; 0 .. 1 << (N - 1)) {
            int[] xs;
            xs ~= 0;
            foreach (i; 1 .. N) {
              if (p & 1 << (i - 1)) {
                xs ~= i;
              }
            }
            const len = cast(int)(xs.length);
            xs ~= N;
            string s;
            foreach (j; 0 .. len) {
              char c = '0';
              foreach (i; xs[j] .. xs[j + 1]) {
                if (S[i] == '1') {
                  c = '1';
                }
              }
              s ~= c;
            }
            ss ~= s;
          }
          ss = ss.sort.uniq.array;
          const brt = cast(int)(ss.length);
          writeln("brt = ", brt);
          assert(brt == ans.x);
        }
      }
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード