Submission #981384

#TimeUsernameProblemLanguageResultExecution timeMemory
981384batsukh2006Easter Eggs (info1cup17_eastereggs)C++17
0 / 100
184 ms131072 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; #define ff first #define ss second const int mxN=513; vector<int> v[mxN],o; void dfs(int a, int p){ o.push_back(a); for(auto node: v[a]){ if(node!=p){ dfs(node,a); } } } int findEgg(int N, vector<pair<int,int> > bridges){ for(auto p: bridges){ v[p.ff].push_back(p.ss); v[p.ss].push_back(p.ff); } dfs(1,1); int l=1,r=N; while(l<=r){ int m=l+(r-l)/2; vector<int> c(m); for(int i=0; i<m; i++) c[i]=o[i]; if(query(c)) r=m-1; else l=m+1; } return o[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...