Submission #1174193

#TimeUsernameProblemLanguageResultExecution timeMemory
1174193ElayV13Easter Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms448 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector < vector < int > > adj; vector < int > tree; void dfs(int v , int p) { } int findEgg(int N, vector < pair < int, int > > bridges) { adj.resize(N + 1); for(int i = 1;i < N;i++) { int u = bridges[i].first , v = bridges[i].second; adj[u].push_back(v); adj[v].push_back(u); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...