結果
問題 | No.1654 Binary Compression |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-08-20 22:25:39 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,750 bytes |
コンパイル時間 | 1,821 ms |
コンパイル使用メモリ | 153,984 KB |
実行使用メモリ | 98,708 KB |
最終ジャッジ日時 | 2024-06-22 12:07:52 |
合計ジャッジ時間 | 12,656 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 185 ms
92,708 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 186 ms
92,944 KB |
testcase_20 | WA | - |
testcase_21 | AC | 188 ms
95,192 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 134 ms
95,064 KB |
testcase_25 | AC | 132 ms
93,076 KB |
testcase_26 | AC | 132 ms
93,552 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 133 ms
96,436 KB |
testcase_30 | AC | 133 ms
95,856 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 151 ms
95,060 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 152 ms
96,192 KB |
testcase_40 | AC | 152 ms
94,676 KB |
testcase_41 | AC | 146 ms
95,912 KB |
testcase_42 | AC | 144 ms
95,236 KB |
testcase_43 | AC | 129 ms
95,064 KB |
testcase_44 | AC | 148 ms
98,156 KB |
testcase_45 | AC | 147 ms
95,156 KB |
testcase_46 | AC | 144 ms
93,716 KB |
testcase_47 | AC | 1 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 156 ms
94,328 KB |
testcase_50 | AC | 154 ms
95,328 KB |
testcase_51 | AC | 162 ms
96,248 KB |
testcase_52 | WA | - |
ソースコード
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("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; } dp[i] += dp1Sum[begs[i]] - dp1Sum[last[i] + 1]; if (ends[i] == N) { ans += dp[i]; } 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); } } catch (EOFException e) { } }