#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int size[1005];
int fa[1005];
bool used[1005];
vector<int> ask;
vector<int> adj[1005];
//bool query(vector<int> dwsad)
//{
// return true;
//}
void dfs(int node, int fat)
{
ask.push_back(node);
size[node]++;
for(auto i:adj[node])
{
if(i==fat) continue;
dfs(i, node);
size[node]+=size[i];
fa[i]=node;
}
}
void dfs1(int node, int fat)
{
ask.push_back(node);
size[node]++;
for(auto i:adj[node])
{
if(i==fat) continue;
dfs(i, node);
size[node]+=size[i];
fa[i]=node;
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
ask.clear();
for(auto i:bridges)
{
adj[i.first].push_back(i.second);
adj[i.second].push_back(i.first);
}
dfs(1,1);
int n=N;
int left=n;
while(true)
{
if(left==1)
{
for(int i=1; i<=n; i++)
{
if(!used[i]) return i;
}
}
int maxsize=0, take=0;
for(int i=1; i<=n; i++)
{
if(!used[i]&&size[i]>=n/2&&size[i]>maxsize)
{
maxsize=size[i];
take=i;
}
}
dfs1(take,take);
if(query(ask)==0)
{
for(auto i:ask)
{
used[i]=true;
}
int cac=fa[take];
while(cac!=0)
{
size[cac]-=size[take];
cac=fa[cac];
}
}
else
{
int lay[1000];
memset(lay, 0, sizeof(lay));
for(auto i:ask)
{
lay[i]=1;
}
for(int i=1; i<=n; i++)
{
if(!lay[i])
used[i]=true;
else
used[i]=false;
}
}
}
}
int main()
{
return 0;
}
Compilation message
/tmp/cc2F1eG5.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccBwH3gp.o:eastereggs.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
