結果
問題 |
No.3237 Find the Treasure!
|
ユーザー |
|
提出日時 | 2025-09-04 22:47:57 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 406 ms / 3,000 ms |
コード長 | 4,558 bytes |
コンパイル時間 | 4,073 ms |
コンパイル使用メモリ | 295,964 KB |
実行使用メモリ | 25,972 KB |
平均クエリ数 | 13.83 |
最終ジャッジ日時 | 2025-09-04 22:48:13 |
合計ジャッジ時間 | 14,809 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h> using namespace std; template <class F> class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward<F>(f)) {} template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); } }; using ll = long long; using ld = long double; using u8 = uint8_t; using u32 = uint32_t; using u64 = uint64_t; using vi = vector<int>; using vl = vector<ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>; inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); } template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } template <class T> void dedup(std::vector<T>& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); } void SCAN() {} template <class H, class... T> void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); } #define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__) #define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__) #define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__) #define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__) #define VEC(type, name, size) std::vector<type> name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]); #define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]); #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define len(x) (long long)(size(x)) #define pb push_back #ifndef LOCAL #define debug(...) #endif #include <atcoder/modint> using mint = atcoder::modint; void run_case() { INT(N); vector<vector<int>> G(N); vector<pii> E; rep(i, N - 1) { INT(a, b); a--, b--; G[a].pb(b); G[b].pb(a); E.pb({a, b}); } vi color(N); y_combinator([&](auto self, int v, int p) -> void {for(auto u: G[v]) if(u != p) color[u] = 1 - color[v], self(u, v); })(0, -1); auto Ask = [&](const vi& a) -> int { assert(len(a) == N - 1); cout << "? "; rep(i, len(a)) cout << a[i] + 1 << " \n"[i == len(a) - 1]; cout << flush; STR(S); return S == "Yes"; }; int cc = 0; vi cand; vi dm(N); { vi xs; rep(i, N - 1) { auto [a, b] = E[i]; debug(color[a], color[b]); if (color[a]) xs.push_back(a); if (color[b]) xs.push_back(b); } int s = Ask(xs); if (s) { cc = 1; rep(i, N) { if (color[i] == 0) dm[i] = 1; else cand.pb(i); } } else { cc = 0; rep(i, N) { if (color[i] == 1) dm[i] = 1; else cand.pb(i); } } } while (len(cand) > 1) { int M = len(cand) / 2; set<int> next{cand.begin(), cand.begin() + M}; vi xs; rep(i, N - 1) { auto [a, b] = E[i]; if (next.count(a)) xs.push_back(a); else if (next.count(b)) xs.push_back(b); else if (color[a] != cc) xs.push_back(a); else if (color[b] != cc) xs.push_back(b); else assert(0); } int s = Ask(xs); if (s) { cand = {cand.begin(), cand.begin() + M}; } else { cand = {cand.begin() + M, cand.end()}; } } cout << "! " << cand.front() + 1 << "\n"; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; while (T--) run_case(); return 0; }