#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++)
{
vector <int> k;
k.push_back(i);
bool l=query(k);
if(l)
{
return i;
}
}
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |