#include <vector>
#include <iostream>
#define TEST
using namespace std;
bool in[513] = {0, 0, 0, 0, 0, 1};
#ifdef TEST
int query(vector<int> islands){
cout << "Query: ";
for(auto i : islands){
cout << i << ' ';
}
bool y = false;
for(auto i : islands){
y |= in[i];
}
cout << (y ? "YES" : "NO") << endl;
return y;
}
#else
int query(vector<int> islands);
#endif
vector<int> G[513];
int c = 0, tot = 512;
int u[513], elim[513];
void dfs(int t, int v, int par = -1){
if(c == tot) return;
if(u[v] == 0) c++, u[v] = t;
for(auto i : G[v]){
if(i == par || elim[i])
continue;
dfs(t, i, v);
}
}
int findEgg(int N, vector<pair<int, int>> bridges){
if(N == 1) return 1;
for(int i = 1; i <= N; i++){
G[i].clear();
}
fill(u, u + N + 1, 0);
fill(elim, elim + N + 1, 0);
c = tot = 0;
for(int i = 0; i < N - 1; i++){
G[bridges[i].first].push_back(bridges[i].second);
G[bridges[i].second].push_back(bridges[i].first);
}
for(int a = N, i = (N + 1) / 2, t = 1;; t++){
c = 0; tot = i; dfs(t, 1);
vector<int> islands;
for(int j = 1; j <= N; j++){
if(u[j]) islands.push_back(j);
}
int r = query(islands);
if(!r){
if(a - i == 1){
for(int j = 1; j <= N; j++){
if(u[j] == 0 && !elim[j]) return j;
}
}
a = a - i; i = (a + 1) / 2;
}else{
if(i == 1){
for(int j = 1; j <= N; j++){
if(u[j] == t) return j;
}
}
a = i; i = (a + 1) / 2;
for(int j = 1; j <= N; j++){
if(u[j] == 0) elim[j] = true;
if(u[j] == t) u[j] = 0;
}
}
}
return 1;
}
#ifdef TEST
int main(){
cout << findEgg(6, {{1, 2}, {1, 3}, {2, 4}, {4, 5}, {4, 6}}) << endl;
}
#endif
Compilation message
/usr/bin/ld: /tmp/ccDGHs08.o: in function `query(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0x0): multiple definition of `query(std::vector<int, std::allocator<int> >)'; /tmp/ccws7hjb.o:eastereggs.cpp:(.text+0x50): first defined here
/usr/bin/ld: /tmp/ccDGHs08.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccws7hjb.o:eastereggs.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
