# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145984 | stasko | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <grader.h>
using namespace std;
int used[1024];
vector <int> v[1024];
vector <int> ans;
void dfs(int beg)
{
used[beg]=1;
ans.push_back(beg);
for(auto c:v[beg])
{
if(!used[c])
{
dfs(c);
}
}
return;
}
int findEgg(int N, vector < pair < int, int > > bridges)
{
fill(used,used+1000,0);
ans.clear();
for(int i=1;i<=1010;i++)
{
v[i].clear();
}
for(auto c:bridges)
{