Submission #516423

#TimeUsernameProblemLanguageResultExecution timeMemory
516423Ronin13Easter Eggs (info1cup17_eastereggs)C++14
100 / 100
21 ms360 KiB
#include <bits/stdc++.h> #include "grader.h" #define ll long long #define pb push_back #define epb emplace_back #define inf 1e9+1 #define linf 1e18+1 #define ull unsigned ll #define f first #define s second #define pii pair<int,int> using namespace std; vector<vector<int> >g(513); vector<int>vec; int timer=0; void dfs(int v,int e=-1){ vec.pb(v); for(int to:g[v]){ if(to==e)continue; dfs(to,v); } } int findEgg (int N, vector < pair < int, int > > bridges){ for(int i=1;i<=N;i++)g[i].clear(); vec.clear(); for(pii x:bridges){ int u=x.f,v=x.s; g[u].pb(v); g[v].pb(u); } dfs(1); int l=0,r=N; while(l+1<r){ int mid=(l+r)/2; vector<int>q; for(int i=0;i<mid;i++)q.pb(vec[i]); if(query(q))r=mid; else l=mid; } return vec[r-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...