#include <bits//stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset; #define ll long long #define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1)) #define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1)) #define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1)) #define pll pair<ll, ll> #define INF 1000000000000000 #define MOD1 1000000007 #define MOD2 998244353 #define MOD3 1000000009 ll n; vector<ll> adj[515]; vector<ll> co; void dfs(ll nd, ll pr) { co.push_back(nd + 1); for (auto it : adj[nd]) if (it != pr) dfs(it, nd); } int findEgg (int N, vector < pair < int, int > > bridges) { n = N; iloop(0, n) adj[i].clear(); co.clear(); for (auto it : bridges) { it.first--, it.second--; adj[it.first].push_back(it.second); adj[it.second].push_back(it.first); } dfs(0, -1); ll lb = 0, ub = n-1, mid; vector<int> qu; while (lb < ub) { mid = (lb + ub)>>1; qu.clear(); iloop(0, mid+1) qu.push_back(co[i]); if (query(qu)) ub = mid; else lb = mid + 1; } return co[lb]; }

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:44:21: error: 'query' was not declared in this scope
   44 |                 if (query(qu)) ub = mid;
      |                     ^~~~~