# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480527 | Haidara | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include<grader.h>
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
using namespace std;
vector<int>graph[maxn],ord;
void dfs(int st=1,int par=-1)
{
ord.push_back(st);
for(auto i:graph[st])
{
if(i==par)
continue;
dfs(i,st);
}
}
int findEgg(int n,vector< pair<int,int> >edges)
{
for(auto i:edges)
{
graph[i.ff].push_back(i.ss);
graph[i.ss].push_back(i.ff);
}
dfs();
int l=0,r=n-1;
while(l<r)
{
int mid=l+(r-l)/2;
if(query(vector<int>(ord.begin(),ord.begin()+mid)))
r=mid;
else
l=mid+1;
}
return ord[r];
}