# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763491 | Quan2003 | 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 "grader.h"
#include "bits/stdc++.h"
using namespace std;
#define MAXN (int) 1e6 + 5
#define mp make_pair
#define pii pair<int,int>
vector<int> order;
vector<int>adj[MAXN];
void dfs(int u, int p)
{
order.push_back(u);
for(int i = 0; i < adj[u].size(); i++)
{
int v = adj[u][i];
if(v == p) continue;
dfs(v,u);
}
}
int find_egg(int n, vector<pii> bridges)
{
for(int i = 0; i < (int) bridges.size(); i++)
{
int u = bridges[i].first;
int v = bridges[i].second;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1, 0);
int l = 0;
int r = n - 1;
while(l < r)
{
int mid = (l + r + 1) / 2;
if(query(vector<int>(order.begin(), order.begin() + mid))) r = mid - 1;
else l = mid;
}
return order[l];
}