#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 = 0, hi = N;
while (hi - lo > 1)
{
int mid = (lo + hi) / 2;
vector<int> islands;
for (int i = lo; i < mid; i++)
islands.push_back(order[i] + 1);
if (query(islands))
hi = mid;
else
lo = mid;
}
return order[lo] + 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
464 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |