#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include "grader.h"
#define endl '\n'
#define ll long long
int findEgg(int n, vector < pair < int, int > > bridges)
{
for(int i=1;i<n;i++)
{
vector<int>v;
v.push_back(i);
int isThere = query(v);
if(isThere==1)
{
return i;
}
}
return n;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |