# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874284 | asli_bg | Easter Eggs (info1cup17_eastereggs) | C++11 | 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"
using namespace std;
vector<int> ord;
vector<int> adjlist[550];
void dfs(int i=1, int r=0){
ord.push_back(i);
for(auto komsu:adjlist[i]){
if(komsu!=r){
dfs(komsu,i);
}
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i=1;i<=N;i++){
adjlist[i].clear();
}
ord.clear();
for(auto el:bridges){
int a=bridges.fi;
int b=bridges.se;
adjlist[a].pb(b);
adjlist[b].pb(a);
}
dfs();
int l=0;
int r=N-1;
while(l<(r-1)){
int mid=r+(r-l)/2;
if(query(vector<int>(ord.begin(),ord.begin()+mid))) r=mid;
else l=mid;
}
return ord[r];
}