#include <bits/stdc++.h>
// #include "grader.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b){a = b; return true;}
return false;
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b){a = b; return true;}
return false;
}
template <class T>
void printArr(T& a, string separator = " ", string finish = "\n"){
for(auto i: a) cout << i << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 600;
int n;
vector<int> graph[N];
int num[N];
int dfs_cnt = 0;
void dfs(int u, int p){
num[++dfs_cnt] = u;
for(int v: graph[u]) if (v != p) dfs(v, u);
}
int findEgg (int _n, vector <pair<int, int>> bridges){
n = _n;
for(int i = 1; i<=n; ++i) graph[i].clear();
for(int i = 0; i<n-1; ++i){
int u = bridges[i].first, v = bridges[i].second;
graph[u].push_back(v);
graph[v].push_back(u);
}
dfs_cnt = 0;
dfs(1, 1);
int l = 1, r = n;
while(l < r){
int mid = (l + r) >> 1;
vector<int> S;
for(int i = 1; i<=mid; ++i) S.push-back(i);
if (query(S)) r = mid;
else l = mid + 1;
}
return l;
}
// int main(void){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// return 0;
// }
Compilation message
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:72:39: error: 'class std::vector<int>' has no member named 'push'
72 | for(int i = 1; i<=mid; ++i) S.push-back(i);
| ^~~~
eastereggs.cpp:72:44: error: 'back' was not declared in this scope
72 | for(int i = 1; i<=mid; ++i) S.push-back(i);
| ^~~~
eastereggs.cpp:73:13: error: 'query' was not declared in this scope
73 | if (query(S)) r = mid;
| ^~~~~
