結果
問題 | No.608 God's Maze |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-01-28 20:22:17 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,389 bytes |
コンパイル時間 | 1,265 ms |
コンパイル使用メモリ | 123,608 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-13 03:48:49 |
合計ジャッジ時間 | 2,336 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,944 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,944 KB |
testcase_28 | AC | 1 ms
6,940 KB |
testcase_29 | AC | 13 ms
6,812 KB |
testcase_30 | AC | 12 ms
6,940 KB |
testcase_31 | AC | 7 ms
6,940 KB |
testcase_32 | AC | 9 ms
6,940 KB |
testcase_33 | AC | 12 ms
6,944 KB |
testcase_34 | AC | 10 ms
6,940 KB |
testcase_35 | AC | 3 ms
6,944 KB |
testcase_36 | AC | 4 ms
6,940 KB |
testcase_37 | AC | 6 ms
6,944 KB |
testcase_38 | AC | 10 ms
6,944 KB |
testcase_39 | AC | 3 ms
6,940 KB |
testcase_40 | AC | 5 ms
6,940 KB |
testcase_41 | AC | 5 ms
6,940 KB |
testcase_42 | AC | 12 ms
6,940 KB |
testcase_43 | AC | 5 ms
6,940 KB |
testcase_44 | AC | 10 ms
6,944 KB |
testcase_45 | AC | 10 ms
6,940 KB |
testcase_46 | AC | 3 ms
6,940 KB |
testcase_47 | AC | 1 ms
6,940 KB |
testcase_48 | AC | 12 ms
6,940 KB |
testcase_49 | AC | 5 ms
6,940 KB |
testcase_50 | AC | 1 ms
6,944 KB |
testcase_51 | AC | 1 ms
6,944 KB |
testcase_52 | WA | - |
testcase_53 | AC | 1 ms
6,940 KB |
testcase_54 | AC | 1 ms
6,944 KB |
testcase_55 | AC | 1 ms
6,944 KB |
testcase_56 | AC | 1 ms
6,940 KB |
testcase_57 | AC | 1 ms
6,944 KB |
testcase_58 | AC | 1 ms
6,940 KB |
testcase_59 | AC | 1 ms
6,940 KB |
testcase_60 | AC | 1 ms
6,940 KB |
testcase_61 | AC | 2 ms
6,940 KB |
testcase_62 | AC | 1 ms
6,940 KB |
testcase_63 | AC | 1 ms
6,940 KB |
testcase_64 | AC | 1 ms
6,944 KB |
ソースコード
import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); } int N, K; string S; int solve() { int ret; auto a = S.map!(s => (s == '#')).array; int l = K; foreach (i; 0 .. K) { if (a[i]) { l = i; break; } } ret += (K - l); foreach (i; l .. K) { a[i] = !a[i]; } int r = -1; foreach_reverse (i; l .. N) { if (a[i]) { r = i; break; } } if (r != -1) { int[] xs; if (a[l]) { xs ~= l; } foreach (i; l + 1 .. r) { if (!a[i]) { xs ~= i; } } debug { writefln("ret = %s, [l, r] = [%s, %s], xs = %s", ret, l, r, xs); } if (xs == [l]) { ret += 3; } else { ret += (r - l); foreach (j; 0 .. xs.length / 2) { ret += 2 * (xs[2 * j + 1] - xs[2 * j]); } if (xs.length % 2 != 0) { ret += 2 * (r - xs[$ - 1]) - 1; } } } debug { writeln("solve ", S, " ", K, " = ", ret); } return ret; } void main() { try { for (; ; ) { K = readInt() - 1; S = readToken(); N = cast(int)(S.length); int ans = 100 * N; foreach (dir; 0 .. 2) { chmin(ans, solve()); K = N - 1 - K; S = cast(string)(cast(ubyte[])(S).dup.reverse); } writeln(ans); } } catch (EOFException e) { } }