結果
問題 | No.355 数当てゲーム(2) |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-03-28 02:36:15 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 2,506 bytes |
コンパイル時間 | 2,157 ms |
コンパイル使用メモリ | 167,288 KB |
実行使用メモリ | 24,348 KB |
平均クエリ数 | 26.69 |
最終ジャッジ日時 | 2023-09-04 06:37:46 |
合計ジャッジ時間 | 5,796 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
23,964 KB |
testcase_01 | AC | 25 ms
23,556 KB |
testcase_02 | AC | 26 ms
24,300 KB |
testcase_03 | AC | 27 ms
24,336 KB |
testcase_04 | AC | 27 ms
24,276 KB |
testcase_05 | AC | 25 ms
23,652 KB |
testcase_06 | AC | 26 ms
24,252 KB |
testcase_07 | AC | 26 ms
24,180 KB |
testcase_08 | AC | 26 ms
24,276 KB |
testcase_09 | AC | 27 ms
24,024 KB |
testcase_10 | AC | 26 ms
23,472 KB |
testcase_11 | AC | 27 ms
24,324 KB |
testcase_12 | AC | 27 ms
24,240 KB |
testcase_13 | AC | 26 ms
23,412 KB |
testcase_14 | AC | 25 ms
23,880 KB |
testcase_15 | AC | 27 ms
23,568 KB |
testcase_16 | AC | 26 ms
23,664 KB |
testcase_17 | AC | 27 ms
23,568 KB |
testcase_18 | AC | 28 ms
23,580 KB |
testcase_19 | AC | 26 ms
24,288 KB |
testcase_20 | AC | 27 ms
23,472 KB |
testcase_21 | AC | 27 ms
24,276 KB |
testcase_22 | AC | 27 ms
23,784 KB |
testcase_23 | AC | 27 ms
23,592 KB |
testcase_24 | AC | 27 ms
23,952 KB |
testcase_25 | AC | 28 ms
23,868 KB |
testcase_26 | AC | 27 ms
23,664 KB |
testcase_27 | AC | 27 ms
23,448 KB |
testcase_28 | AC | 27 ms
23,472 KB |
testcase_29 | AC | 26 ms
24,312 KB |
testcase_30 | AC | 28 ms
23,412 KB |
testcase_31 | AC | 27 ms
23,568 KB |
testcase_32 | AC | 27 ms
23,988 KB |
testcase_33 | AC | 26 ms
23,460 KB |
testcase_34 | AC | 27 ms
23,424 KB |
testcase_35 | AC | 26 ms
24,300 KB |
testcase_36 | AC | 27 ms
23,592 KB |
testcase_37 | AC | 27 ms
23,448 KB |
testcase_38 | AC | 27 ms
23,592 KB |
testcase_39 | AC | 27 ms
24,324 KB |
testcase_40 | AC | 26 ms
24,036 KB |
testcase_41 | AC | 26 ms
23,376 KB |
testcase_42 | AC | 27 ms
23,340 KB |
testcase_43 | AC | 28 ms
23,376 KB |
testcase_44 | AC | 26 ms
23,472 KB |
testcase_45 | AC | 27 ms
23,592 KB |
testcase_46 | AC | 27 ms
23,664 KB |
testcase_47 | AC | 27 ms
24,288 KB |
testcase_48 | AC | 26 ms
23,976 KB |
testcase_49 | AC | 26 ms
23,772 KB |
testcase_50 | AC | 26 ms
24,024 KB |
testcase_51 | AC | 28 ms
24,348 KB |
ソースコード
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)); } debug { int[] A; } alias Result = Tuple!(int, "hit", int, "blow"); Result Ask(int[] xs) { Result ret; debug { ret.hit = ret.blow = 0; foreach (i; 0 .. 4) { if (A[i] == xs[i]) { ++ret.hit; } else if (A.count(xs[i]) > 0) { ++ret.blow; } } } else { writefln("%s %s %s %s", xs[0], xs[1], xs[2], xs[3]); stdout.flush; ret.hit = readInt(); ret.blow = readInt(); } return ret; } void main() { debug { A = new int[4]; foreach (i; 0 .. 4) { A[i] = readInt(); } } int[] ps; foreach (s; 0 .. 2) { const pa = (s == 0) ? 3 : 0; const pb = (s == 0) ? 10 : 7; auto hbs = new int[10]; foreach (p; pa .. pb) { auto xs = (s == 0) ? [0, 1, 2, p] : [7, 8, 9, p]; const res = Ask(xs); if (res == Result(4, 0)) { debug { writeln("! ", xs); } return; } hbs[p] = res.hit + res.blow; } const mx = hbs.maxElement; foreach (p; pa .. pb) { if (mx == hbs[p]) { ps ~= p; } } } ps = ps.sort.uniq.array; debug { writeln("ps = ", ps); } assert(ps.length == 4); foreach (perm; ps.permutations) { const res = Ask(perm.array); if (res == Result(4, 0)) { debug { writeln(perm); } return; } } }