結果

問題 No.355 数当てゲーム(2)
ユーザー 👑 hos.lyric
提出日時 2020-03-28 02:36:15
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 2,506 bytes
コンパイル時間 1,711 ms
コンパイル使用メモリ 169,348 KB
実行使用メモリ 25,616 KB
平均クエリ数 26.69
最終ジャッジ日時 2024-06-22 05:59:39
合計ジャッジ時間 5,328 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 52
権限があれば一括ダウンロードができます

ソースコード

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)); }
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;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0