Submission #334428

#TimeUsernameProblemLanguageResultExecution timeMemory
334428limabeansEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
2 ms620 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> g[600]; vector<int> w; void dfs(int at, int p) { w.push_back(at); for (int to: g[at]) { if (to == p) continue; dfs(to, at); } } int findEgg (int n, vector < pair < int, int > > edges) { for (int i=0; i<=n; i++) { g[i].clear(); } for (auto ed: edges) { int u = ed.first; int v = ed.second; g[u].push_back(v); g[v].push_back(u); } w.clear(); dfs(1,0); assert((int)w.size()==n); int lo = 0; int hi = n; while (hi-lo>1) { int mid = (lo+hi)/2; vector<int> v; for (int i=0; i<=mid; i++) v.push_back(w[i]); if (query(v)) { lo = mid; } else { hi = mid; } } return w[lo]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...