# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145738 | txni128 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include "grader.h"
#include <iostream>
#include <vector>
using namespace std;
int findEgg(int N, vector < pair < int, int > > bridges)
{
int used[1024];
fill(used,used+1000,0);
for(auto c:bridges)
{
vector <int> k;
k.push_back(c.first);
k.push_back(c.second);
if(used[k[0]]==0||used[k[1]]==0)
{
bool l=query(k);
if(l==0)
{
used[c.first]=1;
used[c.second]=1;
}
}
}
for(int i=1;i<=n;i++)
{
if(used[i]==0)
{
return i;
}
}
int l=1,r=N;
int mid=(l+r)/2;
while(l<=r)
{
mid=(l+r)/2;
vector <int> q;
for(int i=mid;i<=r;i++)
{
q.push_back(i);
}
bool l=query(q);
if(l==1)
{
l=mid+1;
}
else r=mid-1;
}
return l;
}