Submission #918387

#TimeUsernameProblemLanguageResultExecution timeMemory
918387ayankarimovaEaster Eggs (info1cup17_eastereggs)C++14
0 / 100
2 ms600 KiB
#include <bits/stdc++.h> #include "grader.h" #define ll long long using namespace std; const ll sz=600; ll used[sz]; vector<ll>g[sz], vec; void dfs(ll u) { vec.push_back(u); used[u]=1; for(auto v:g[u]){ if(!used[v]){ dfs(v); } } } int findEgg (int N, vector < pair < int, int > > br) { /* if (query ({1})) return 1; return N;*/ for(auto i:br){ ll u=i.first; ll v=i.second; g[u].push_back(v); g[v].push_back(u); } dfs(1); ll l=0, r=N-1; while(l<=r){ ll mid=(l+r)/2; vector<int>cur; for(int i=l; i<=mid; i++){ cur.push_back(vec[i]); } int q=query(cur); if(q==1){ r=mid; } else{ l=mid+1; } } return vec[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...