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;
int findEgg(int N, vector<pair<int, int>> bridges)
{
vector<vector<int>> adj(N);
for (auto [u, v] : bridges)
adj[u - 1].push_back(v - 1),
adj[v - 1].push_back(u - 1);
vector<int> order;
queue<int> q;
vector<bool> visited(N, 0);
for (q.push(0), visited[0] = 1; !q.empty();)
{
int u = q.front();
q.pop();
order.push_back(u);
for (int v : adj[u])
{
if (!visited[v])
q.push(v), visited[v] = 1;
}
}
assert((int)order.size() == N);
int lo = 1, hi = N;
while (lo < hi)
{
int mid = (lo + hi) / 2;
vector<int> islands;
for (int i = 0; i < mid; i++)
islands.push_back(order[i] + 1);
if (query(islands))
hi = mid;
else
lo = mid + 1;
}
return order[lo - 1] + 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |