#include <bits/stdc++.h> #include "grader.h" using namespace std; const int nx = 530; int act[nx],vis[nx]; vector<int> adj[nx]; int findEgg (int n, vector < pair < int, int > > bridges) { for(int i = 0; i < nx; i++) vis[i]=0,adj[i].clear(); for(int i = 0; i < n; i++) { auto [u,v] = bridges[i]; adj[u].push_back(v); adj[v].push_back(u); } queue<int> q; q.push(1); vis[1] = 1; act[1] = 1; int cur = 2; while(!q.empty()) { int u = q.front(); q.pop(); for(auto v : adj[u]) { if(!vis[v]) { vis[v] = 1; act[cur] = v; cur++; q.push(v); } } } int l = 1, r = n; while(l<r) { int md = (l+r)/2; vector<int> check; for(int i = 1; i <= md; i++) check.push_back(act[i]); if(query(check)) r = md; else l = md+1; } return act[l]; }