# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464805 | okaragul | 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"
using namespace std;
vector<vector<int>> g;
vector<int> ord;
int dfs(int v, int p){
ord.push_back(v);
for(auto &ch:g[v]) if(ch!=p) dfs(ch, v);
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
g.assign(N, vector<int>()); ord.clear();
for(int i = 1; i < N; i++){
int &[a, b]=bridges[i-1];
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
}
dfs(0, -1);
int l=1, r=n;
while(l<r){
int mid=(l+r)/2;
vector<int> tmp;
for(int i = 0; i < mid; i++) tmp.push_back(ord[i]);
if(!query(tmp)) l=mid+1;
else r=mid;
}
return l;
}