Submission #965478

#TimeUsernameProblemLanguageResultExecution timeMemory
965478hugsfromadictoEaster Eggs (info1cup17_eastereggs)C++14
100 / 100
12 ms1248 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; vector<int>v; vector<int>g[605]; void dfs(int node, int par) { v.push_back(node); for(int i : g[node]) { if(i != par) dfs(i,node); } } int findEgg (int n, vector<pair<int,int>>b) { v.clear(); for(int i = 0; i <= n; ++i) g[i].clear(); for(pair<int,int> i : b) { g[i.first].push_back(i.second); g[i.second].push_back(i.first); } dfs(1,1); int l = 0, r = v.size() - 1; while(l < r) { int mid = (l + r) / 2; vector<int>w; for(int i = 0; i <= mid; ++i) w.push_back(v[i]); if(query(w)) r = mid; else l = mid + 1; } return v[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...