Submission #1162714

#TimeUsernameProblemLanguageResultExecution timeMemory
1162714cnn008Easter Eggs (info1cup17_eastereggs)C++20
40 / 100
8 ms512 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; vector <int> g[515],e; void dfs(int u, int p){ e.push_back(u); for(auto v:g[u]) if(v!=p) dfs(v,u); } int findEgg(int n, vector <pair <int,int> > bridges){ for(int i=1; i<=n; i++) g[i].clear(); e.clear(); for(auto [u,v]:bridges){ g[u].push_back(v); g[v].push_back(u); } dfs(1,0); int l=2,r=n,ans=0; while(l<=r){ int mid=(l+r)>>1; vector <int> cur; for(int i=0; i<mid; i++) cur.push_back(e[i]); if(query(cur)) ans=mid,r=mid-1; else l=mid+1; } if(!ans) ans=1; return e[ans-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...