結果

問題 No.1654 Binary Compression
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-08-20 22:31:37
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 5,617 bytes
コンパイル時間 3,134 ms
コンパイル使用メモリ 152,340 KB
実行使用メモリ 89,488 KB
最終ジャッジ日時 2023-09-04 13:42:27
合計ジャッジ時間 13,305 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 208 ms
85,764 KB
testcase_11 AC 177 ms
86,024 KB
testcase_12 AC 179 ms
88,192 KB
testcase_13 AC 178 ms
88,280 KB
testcase_14 AC 174 ms
85,508 KB
testcase_15 AC 197 ms
87,140 KB
testcase_16 AC 152 ms
88,004 KB
testcase_17 AC 152 ms
88,004 KB
testcase_18 AC 179 ms
87,928 KB
testcase_19 AC 180 ms
88,036 KB
testcase_20 AC 178 ms
88,532 KB
testcase_21 AC 178 ms
88,040 KB
testcase_22 AC 177 ms
88,988 KB
testcase_23 AC 156 ms
88,316 KB
testcase_24 AC 136 ms
89,468 KB
testcase_25 AC 137 ms
88,356 KB
testcase_26 AC 139 ms
88,728 KB
testcase_27 AC 147 ms
88,056 KB
testcase_28 AC 146 ms
88,636 KB
testcase_29 AC 137 ms
88,100 KB
testcase_30 AC 136 ms
89,472 KB
testcase_31 AC 136 ms
88,540 KB
testcase_32 AC 136 ms
88,008 KB
testcase_33 AC 145 ms
88,892 KB
testcase_34 AC 145 ms
88,652 KB
testcase_35 AC 136 ms
88,964 KB
testcase_36 AC 137 ms
88,280 KB
testcase_37 AC 136 ms
88,464 KB
testcase_38 AC 135 ms
88,720 KB
testcase_39 AC 148 ms
89,388 KB
testcase_40 AC 147 ms
87,984 KB
testcase_41 AC 142 ms
88,608 KB
testcase_42 AC 148 ms
89,092 KB
testcase_43 AC 144 ms
88,892 KB
testcase_44 AC 143 ms
89,488 KB
testcase_45 AC 144 ms
88,800 KB
testcase_46 AC 157 ms
88,704 KB
testcase_47 AC 1 ms
4,380 KB
testcase_48 AC 1 ms
4,380 KB
testcase_49 AC 150 ms
88,000 KB
testcase_50 AC 148 ms
88,788 KB
testcase_51 AC 159 ms
88,760 KB
testcase_52 AC 156 ms
88,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 = 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) {
  }
}
0