#include <bits/stdc++.h> #include "grader.h" using namespace std; const int Nx = 600; int vis[Nx], val[Nx], cur; vector<int> adj[600]; void dfs(int u){ if(vis[u]) return; vis[u] = 1; val[u] = cur+1; cur++; for(auto v : adj[u]){ dfs(v); vis[v] = 1; } } int findEgg (int N, vector<pair<int, int>> bridges) { for(auto [u, v] : bridges){ adj[u].push_back(v); adj[v].push_back(u); } dfs(1); int l = 1, r = N; while(l < r){ int mid = (l+r)>>1; vector<int> Q; for(int i = 1; i <= mid; ++i) Q.push_back(val[i]); if(query(Q)) r = mid; else l = mid+1; } return val[l]; }