Submission #743600

#TimeUsernameProblemLanguageResultExecution timeMemory
743600AndrijaMEaster Eggs (info1cup17_eastereggs)C++14
100 / 100
16 ms372 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int>g[513]; vector<int>a; void dfs(int node,int par) { a.push_back(node); for(auto idx:g[node]) { if(idx!=par) dfs(idx,node); } } int findEgg (int n, vector < pair < int, int > > b) { for (int i = 1; i <= n; i++) g[i].clear(); a.clear(); for(auto idx:b) { g[idx.first].push_back(idx.second); g[idx.second].push_back(idx.first); } dfs(1,-1); int l=1; int r=n; while(l<r) { int mid=l+(r-l)/2; if(query(vector<int>(a.begin(),a.begin()+mid)))r=mid; else { l=mid+1; } } return a[l-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...