Submission #360180

#TimeUsernameProblemLanguageResultExecution timeMemory
360180tengiz05Easter Eggs (info1cup17_eastereggs)C++17
100 / 100
26 ms564 KiB
#include <bits/stdc++.h> #include "grader.h" #ifndef EVAL #include "grader.cpp" #endif using namespace std; const int MAXN = 515; vector<int> edges[MAXN]; int n; vector<int> a; void dfs(int u, int p = -1){ a.push_back(u); for(auto v : edges[u]){ if(v == p)continue; dfs(v,u); } } int findEgg(int N, vector<pair<int,int>> bridges){ n = N; for(auto [u, v] : bridges){ edges[u].push_back(v); edges[v].push_back(u); }dfs(1); int l=0, r=n-1; while(l < r){ int mid = (l+r)>>1; vector<int> toask; for(int i=0;i<=mid;i++){ toask.push_back(a[i]); }if(query(toask))r = mid; else l = mid+1; } int ans = a[l]; for(int i=1;i<=n;i++){ edges[i].clear(); }a.clear(); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...