Submission #981379

#TimeUsernameProblemLanguageResultExecution timeMemory
981379batsukh2006Easter Eggs (info1cup17_eastereggs)C++17
0 / 100
1 ms600 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; 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){ int l=0,r=N-1; while(l<=r){ int m=l+(r-l)/2; vector<int> c; for(int i=0; i<m; i++){ c.push_back(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...