| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 61623 | huynhsmd | 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 pb push_back
#define fi first
#define se second
using namespace std;
typedef pair <int , int > ii;
const int N = 1e5 + 5;
int arr[N], cnt;
vector < int > adj[N], ask;
void dfs(int u, int p){
	arr[u] = ++cnt;
	for(int v : adj[u]) if(v != p) dfs(v);
}
int findEgg(int N, vector < ii > bridges){
	for(ii i : bridges){
		adj[i.fi].pb(i.se); adj[i.se].pb(i.fi);
	}
	dfs(1, 1);
	int l = 1, r = n, res;
	while(l <= r){
		int mid = l + r >> 1;
		for(int i = 1; i <= mid; ++ i) ask.pb(arr[i]);
		if(query(ask)) res = mid, r = mid - 1;
		else l = mid + 1;
	}
	return arr[res];
}
