# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243002 | minhcool | 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;
#define fi first
#define se second
#define pb push_back
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
vector<int> euler;
vector<int> Adjlist[100005];
void dfs(int u, int p){
euler.pb(u);
for(int i = 0; i < Adjlist[u].size(); i++){
int v = Adjlist[u][i];
if(v == p) continue;
dfs(v, u);
}
}
int findEgg(int N, vector<ii> bridges){
for(int i = 1; i <= N; i++) bridges[i].clear();
for(int i = 0; i < bridges.size(); i++){
Adjlist[bridges[i].fi].pb(bridges[i].se);
Adjlist[bridges[i].se].pb(bridges[i].fi);
}
dfs(1, 1);
int l = 0, r = N - 1;
while(l != r){
int mid = (l + r) >> 1;
vector<int> nodes;
nodes.clear();
for(int i = 0; i <= mid; i++) nodes.pb(euler[i]);
if(query(nodes)) r = mid;
else l = mid + 1;
}
return euler[l];
}