# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146403 | feev1x | Easter Eggs (info1cup17_eastereggs) | C++20 | 2 ms | 496 KiB |
#include <bits/stdc++.h>
#include "grader.h"
int findEgg (int n, std::vector<std::pair<int, int>> bridges) {
std::vector<int> fq;
int nd = n;
std::vector<std::vector<int>> g(n + 1);
std::vector<bool> used(n + 1);
for (auto [u, v]: bridges) {
g[u].emplace_back(v);
g[v].emplace_back(u);
}
auto Dfs = [&](auto &&self, int v, int p) -> void {
if (fq.size() == nd) {
return;
}
while (v < 1 || v > n);
if (!used[v]) {
fq.emplace_back(v);
used[v] = true;
}
for (auto to: g[v]) {
if (to == p) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |