# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146536 | crispxx | Easter Eggs (info1cup17_eastereggs) | C++20 | 173 ms | 584 KiB |
#include <bits/stdc++.h>
#include "grader.h"
// #include "grader.cpp"
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define nl '\n'
int findEgg(int n, vector <pair<int, int>> edges) {
vector<set<int>> adj(n);
for(auto &[u, v] : edges) {
u--, v--;
adj[u].emplace(v);
adj[v].emplace(u);
}
vector<int> isl;
auto dfs = [&](auto &&dfs, int v, int p) -> void {
isl.pb(v + 1);
for(auto to : adj[v]) {
if(to == p) continue;
dfs(dfs, to, v);
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |