結果
問題 |
No.3237 Find the Treasure!
|
ユーザー |
👑 |
提出日時 | 2025-08-15 21:33:02 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 392 ms / 3,000 ms |
コード長 | 2,689 bytes |
コンパイル時間 | 1,608 ms |
コンパイル使用メモリ | 107,672 KB |
実行使用メモリ | 25,972 KB |
平均クエリ数 | 13.74 |
最終ジャッジ日時 | 2025-08-15 21:33:19 |
合計ジャッジ時間 | 12,061 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 |
ソースコード
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)); } int N; int[] A, B; bool ask(int[] xs) { write("?"); foreach (i; 0 .. N - 1) write(" ", xs[i]); writeln; stdout.flush; const res = readToken; if (res == "Invalid") { import core.stdc.stdlib; exit(0); } return (res == "Yes"); } int[][] graph; int[] dep; void dfs(int u, int p) { foreach (v; graph[u]) if (p != v) { dep[v] = dep[u] + 1; dfs(v, u); } } void main() { N = readInt; A = new int[N - 1]; B = new int[N - 1]; foreach (i; 0 .. N - 1) { A[i] = readInt; B[i] = readInt; } graph = new int[][N + 1]; foreach (i; 0 .. N - 1) { graph[A[i]] ~= B[i]; graph[B[i]] ~= A[i]; } dep = new int[N + 1]; dfs(1, -1); auto us = iota(1, N + 1).array; auto sides = new int[N + 1]; sides[] = -1; foreach (u; 1 .. N + 1) sides[u] = dep[u] & 1; for (; ; ) { debug { writefln("us = %s, sides = %s", us, sides); } // select 1 auto xs = new int[N - 1]; foreach (i; 0 .. N - 1) { const a = A[i]; const b = B[i]; const sa = sides[a]; const sb = sides[b]; xs[i] = (sa == 1) ? a : (sb == 1) ? b : (sa == 0) ? b : (sb == 0) ? a : a; } const res = ask(xs); int[] vs; if (res) { foreach (u; us) if (sides[u] == 1) vs ~= u; } else { foreach (u; us) if (sides[u] == 0) vs ~= u; } us = vs; if (us.length == 1) break; sides[] = -1; foreach (i, u; us) sides[u] = (2 * i >= us.length) ? 1 : 0; } writeln("! ", us[0]); stdout.flush; }