Submission #1064475

#TimeUsernameProblemLanguageResultExecution timeMemory
1064475goduadzesabaEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
202 ms131072 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int n,l,r,md; vector <int> g[1000],a,b; void dfs (int i,int p){ a.push_back(i); for (int j:g[i]){ if (j==p) continue; dfs(j,i); } } int findEgg (int N, vector < pair < int, int > > bridges){ n=N; for (auto i:bridges){ g[i.first].push_back(i.second); g[i.second].push_back(i.first); } dfs(1,0); l=0; r=n-1; while (l<r){ md=(l+r)/2; b.clear(); for (int i=0; i<=md; i++) b.push_back(a[i]); if (query(b)) r=md; else l=md+1; } return a[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...