Submission #1146402

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
11464022025-02-06 03:31:13NurislamEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
2 ms476 KiB
#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
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);
//for(int i = 1; i <= n; i ++ ){
//cout << i << ' ' << tin[i] << '\n';
//}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...