# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146242 | rado15 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <vector>
#include "grader.h"
#include <iostream>
using namespace std;
void findEgg(int N, const vector<pair<int, int>>& bridges)
{
vector<vector<int>> adj(N + 1);
for (const auto& bridge : bridges)
{
adj[bridge.first].push_back(bridge.second);
adj[bridge.second].push_back(bridge.first);
}
function<int(int, int)> findEggHelper = [&](int left, int right) -> int
{
if (left == right)
{
return left;
}
int mid = (left + right) / 2;
vector<int> group1, group2;
for (int i = left; i <= mid; ++i)
{
group1.push_back(i);
}