#1190076 (C++17) No.3237 Find the Treasure!

• 問題: No.3237 Find the Treasure!
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-09-22 00:55:24
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 198 ms / 3,000 ms
• コード長: 5,216 bytes
• コンパイル時間: 2,949 ms
• コンパイル使用メモリ: 223,512 KB
• 実行使用メモリ: 9,868 KB
• 平均クエリ数: 13.83
• 最終ジャッジ日時: 2026-09-22 00:55:33
• 合計ジャッジ時間: 8,352 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge5_0

ファイルパターン	結果
sample	AC * 1
other	AC * 22

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> u(N - 1);
    vector<ll> v(N - 1);
    rep(i, N - 1){
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    
    vector<vector<ll>> graph(N, vector<ll>(0));
    rep(i, N - 1){
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }

    vector<ll> col(N, -1);
    col[0] = 0;
    queue<ll> que;
    que.push(0);
    while (que.size()){
        ll p = que.front();
        que.pop();
        for (ll x: graph[p]){
            if (col[x] == -1){
                col[x] = 1 - col[p];
                que.push(x);
            }
        }
    }
    
    vector<bool> pos(N, true);
    // 最初の 1 回は 0 か 1 のどちらかを特定する
    vector<ll> first_x;
    for (ll i = 0; i < N - 1; i++){
        if (col[u[i]] == 0){
            first_x.push_back(u[i] + 1);
        }
        else{
            first_x.push_back(v[i] + 1);
        }
    }
    cout << "?";
    rep(i, N - 1){
        cout << " " << first_x[i];
    }
    cout << endl;
    string S1;
    cin >> S1;

    vector<ll> now_ans;
    if (S1 == "Yes"){
        rep(i, N){
            if (col[i] == 0) now_ans.push_back(i);
        }
    }
    else{
        rep(i, N){
            if (col[i] == 1) now_ans.push_back(i);
        }
    }
    while (now_ans.size() > 1){
        ll now_len = now_ans.size();
        vector<ll> form;
        vector<ll> latt;
        vector<bool> chosen(N, false);
        for (ll i = 0; i < now_len / 2; i++){
            form.push_back(now_ans[i]);
            chosen[now_ans[i]] = true;
        }
        vector<bool> not_chosen(N, false);
        for (ll i = now_len / 2; i < now_len; i++){
            latt.push_back(now_ans[i]);
            not_chosen[now_ans[i]] = true;
        }
        vector<ll> nxt_x;
        for (ll i = 0; i < N - 1; i++){
            if (chosen[u[i]] || not_chosen[v[i]]){
                nxt_x.push_back(u[i] + 1);
            }
            else{
                nxt_x.push_back(v[i] + 1);
            }
        }
        cout << "?";
        rep(i, N - 1){
            cout << " " << nxt_x[i];
        }
        cout << endl;
        string S;
        cin >> S;
        if (S == "Yes"){
            now_ans = form;
        }
        else{
            now_ans = latt;
        }
    }
    cout << "! " << now_ans[0] + 1 << endl;
}