# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174201 | ElayV13 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<vector<int>> ve;
vector<int> w;
void dfs(int x, int p){
w.push_back(x);
for (auto el : ve[x]){
if (el != p){
dfs(el, x);
}
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
w.clear();
ve.clear();
ve.resize(N + 1);
for (auto el : bridges){
ve[el.first].push_back(el.second);
ve[el.second].push_back(el.first);
}
dfs(1, -1);
int l = 1, r = N;
while (l <= r){
if (l == r){
return w[l - 1];
}
int mid = (l + r) / 2;
vector<int> rec;