# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146433 | Nurislam | Easter Eggs (info1cup17_eastereggs) | C++17 | 9 ms | 488 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg (int n, vector < pair < int, int > > bridges){
vector<vector<int>> g(n + 5);
for(auto [a, b] : bridges) {
g[a].push_back(b);
g[b].push_back(a);
};
vector<int> tin(n + 5, 0);
int tim = 1;
auto dfs = [&](auto dfs, int ps, int pr) -> void{
tin[ps] = tim++;
for(int to : g[ps])
if(to != pr)
dfs(dfs, to, ps);
};
dfs(dfs, 1, 1);
int ans = 1;
int l = 1, r = n;
while(l < r){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |