結果
問題 | No.2819 Binary Binary-Operator |
ユーザー |
👑 |
提出日時 | 2024-07-27 02:17:44 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 1,999 bytes |
コンパイル時間 | 1,127 ms |
コンパイル使用メモリ | 118,852 KB |
実行使用メモリ | 25,580 KB |
平均クエリ数 | 3.00 |
最終ジャッジ日時 | 2024-07-27 02:17:51 |
合計ジャッジ時間 | 6,631 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
24,812 KB |
testcase_01 | AC | 24 ms
25,196 KB |
testcase_02 | AC | 23 ms
25,196 KB |
testcase_03 | AC | 23 ms
24,940 KB |
testcase_04 | AC | 23 ms
24,556 KB |
testcase_05 | AC | 24 ms
25,196 KB |
testcase_06 | AC | 24 ms
25,196 KB |
testcase_07 | AC | 23 ms
25,196 KB |
testcase_08 | AC | 23 ms
25,452 KB |
testcase_09 | AC | 23 ms
25,580 KB |
testcase_10 | AC | 24 ms
24,940 KB |
testcase_11 | AC | 23 ms
25,196 KB |
testcase_12 | AC | 23 ms
24,812 KB |
testcase_13 | AC | 23 ms
24,812 KB |
testcase_14 | AC | 23 ms
24,940 KB |
testcase_15 | AC | 23 ms
24,812 KB |
testcase_16 | AC | 23 ms
25,196 KB |
testcase_17 | AC | 23 ms
25,196 KB |
testcase_18 | AC | 23 ms
25,196 KB |
testcase_19 | AC | 23 ms
24,940 KB |
testcase_20 | AC | 23 ms
25,324 KB |
testcase_21 | AC | 23 ms
25,196 KB |
testcase_22 | AC | 24 ms
24,940 KB |
testcase_23 | AC | 24 ms
24,556 KB |
testcase_24 | AC | 24 ms
25,196 KB |
testcase_25 | AC | 24 ms
25,196 KB |
testcase_26 | AC | 24 ms
24,812 KB |
testcase_27 | AC | 23 ms
25,196 KB |
testcase_28 | AC | 24 ms
24,940 KB |
testcase_29 | AC | 23 ms
25,196 KB |
testcase_30 | AC | 23 ms
25,196 KB |
testcase_31 | AC | 24 ms
24,940 KB |
testcase_32 | AC | 23 ms
25,196 KB |
testcase_33 | AC | 23 ms
25,196 KB |
testcase_34 | AC | 23 ms
25,196 KB |
testcase_35 | AC | 22 ms
25,196 KB |
testcase_36 | AC | 24 ms
24,940 KB |
testcase_37 | AC | 23 ms
24,940 KB |
testcase_38 | AC | 24 ms
25,196 KB |
testcase_39 | AC | 24 ms
24,812 KB |
testcase_40 | AC | 23 ms
25,196 KB |
testcase_41 | AC | 23 ms
24,556 KB |
testcase_42 | AC | 23 ms
25,196 KB |
testcase_43 | AC | 23 ms
25,184 KB |
testcase_44 | AC | 23 ms
24,556 KB |
testcase_45 | AC | 24 ms
25,196 KB |
testcase_46 | AC | 23 ms
25,580 KB |
testcase_47 | AC | 23 ms
25,196 KB |
testcase_48 | AC | 23 ms
24,556 KB |
testcase_49 | AC | 25 ms
25,452 KB |
testcase_50 | AC | 23 ms
24,940 KB |
testcase_51 | AC | 23 ms
25,196 KB |
testcase_52 | AC | 23 ms
25,196 KB |
testcase_53 | AC | 23 ms
24,940 KB |
testcase_54 | AC | 23 ms
25,196 KB |
testcase_55 | AC | 23 ms
25,196 KB |
testcase_56 | AC | 23 ms
25,196 KB |
testcase_57 | AC | 24 ms
25,196 KB |
testcase_58 | AC | 23 ms
25,196 KB |
testcase_59 | AC | 23 ms
24,812 KB |
testcase_60 | AC | 24 ms
24,556 KB |
testcase_61 | AC | 22 ms
24,556 KB |
testcase_62 | AC | 22 ms
24,556 KB |
testcase_63 | AC | 23 ms
24,940 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; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } 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)); } void main() { debug { foreach (x; 0 .. 2) foreach (y; 0 .. 2) { for (int n = 3; ; ++n) { foreach (ask; 0 .. 1 << n) { bool ok = true; foreach (sec; 0 .. 16) { int op(int a, int b) { return sec >> (a*2+b) & 1; } int z = ask >> 0 & 1; foreach (i; 1 .. n) { z = op(z, ask >> i & 1); } ok = ok && (op(x, y) == z); } if (ok) { writeln([x, y], ": ", ask, " ", iota(n).map!(i => "01"[ask >> i & 1])); goto found; } } } found: } } const X = readInt; const Y = readInt; writeln(4); writeln(X, " ", Y, " ", Y, " ", Y); stdout.flush; const res = readInt; writeln(res); stdout.flush; }