# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145715 | txni128 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include "eggs.h"
#include <iostream>
#include <vector>
using namespace std;
int findEgg(int N, vector < pair < int, int > > bridges)
{
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;
}