# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
279639 | MKutayBozkurt | 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>> v;
vector<int> ans;
void dfs(int i, int last = -1) {
ans.emplace_back(i);
for (auto node : v[i]) {
if (last == node) continue;
dfs(node, i);
}
}
int findEgg(int n, vector<pair<int, int>> bridges) {
v = vector<vector<int>>(n + 1);
for (auto node : bridges) {
v[node.first].emplace_back(node.second);
v[node.second].emplace_back(node.first);
}
dfs(1);
int l = 0, r = n - 1;
while (l <= r) {
int m = (l + r) / 2;
if (query(vector<int>(ans.begin(), ans.begin() + mid + 1))) r = mid;
else l = mid;
}
return ans[l];
}