結果
問題 |
No.3237 Find the Treasure!
|
ユーザー |
|
提出日時 | 2025-08-15 22:14:20 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 392 ms / 3,000 ms |
コード長 | 2,278 bytes |
コンパイル時間 | 3,218 ms |
コンパイル使用メモリ | 296,940 KB |
実行使用メモリ | 26,236 KB |
平均クエリ数 | 13.83 |
最終ジャッジ日時 | 2025-08-15 22:14:50 |
合計ジャッジ時間 | 12,156 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h> #define fi first #define se second #define rep(i,s,n) for (int i = (s); i < (n); ++i) #define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define len(x) (int)(x).size() #define dup(x,y) (((x)+(y)-1)/(y)) #define pb push_back #define eb emplace_back #define Field(T) vector<vector<T>> using namespace std; using ll = long long; using ull = unsigned long long; template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>; using P = pair<int,int>; template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;} int main() { int n; cin >> n; vector<vector<int>> G(n); vector<int> u(n), v(n); rep(i,0,n-1) { cin >> u[i] >> v[i]; --u[i], --v[i]; G[u[i]].eb(v[i]), G[v[i]].eb(u[i]); } vector<int> dist(n, -1); queue<int> que; que.emplace(0); dist[0] = 0; while(!que.empty()) { int v = que.front(); que.pop(); for (int nv : G[v]) { if (dist[nv] == -1) { dist[nv] = dist[v] + 1; que.emplace(nv); } } } function<int(vector<int>)> output = [&](vector<int> x) { cout << "? "; rep(i,0,n-1) { cout << x[i]+1 << " "; } cout << endl; string s; cin >> s; return (s == "Yes"); }; vector<int> x(n); rep(i,0,n-1) { x[i] = (dist[u[i]]%2 == 1 ? u[i] : v[i]); } int b = output(x); if (!b) { rep(i,0,n) ++dist[i]; rep(i,0,n-1) { x[i] = (x[i] == u[i] ? v[i] : u[i]); } } set<int> st; rep(i,0,n-1) st.emplace(x[i]); while(len(st) >= 2) { int m = len(st); set<int> nst; while(len(nst) < m/2) { nst.emplace(*st.begin()); st.erase(st.begin()); } vector<int> nx(n-1); rep(i,0,n-1) { if (dist[x[i]]%2==0) nx[i] = x[i]; else if (st.contains(x[i])) nx[i] = x[i]; else nx[i] = (x[i] == u[i] ? v[i] : u[i]); } b = output(nx); if (!b) { st = nst; rep(i,0,n-1) { if (dist[x[i]]%2==0) nx[i] = x[i]; else if (st.contains(x[i])) nx[i] = x[i]; else nx[i] = (x[i] == u[i] ? v[i] : u[i]); } } x = nx; } cout << "! " << *(st.begin())+1 << endl; return 0; }