Submission #272199

#TimeUsernameProblemLanguageResultExecution timeMemory
272199errayEaster Eggs (info1cup17_eastereggs)C++17
100 / 100
24 ms760 KiB
// author: erray #include<bits/stdc++.h> #include"grader.h" using namespace std; //int query(vector<int> asd) { return true; } const int N = 515; vector<int> g[N], ask; void dfs(int v, int pr = -1) { ask.push_back(v); for (auto u : g[v]) { if (pr == u) continue; dfs(u, v); } } int findEgg(int n, vector<pair<int, int>> edges) { bool ok = true; for (int i = 0; i < 512; ++i) ok &= g[i].empty(); for (auto e : edges) { if (ok) { g[e.first].push_back(e.second); g[e.second].push_back(e.first); } } dfs(1); int s = 0, e = n - 1; while (s != e) { int mid = (s + e) >> 1; if (query(vector<int>(ask.begin(), ask.begin() + mid + 1))) e = mid; else s = mid + 1; } return ask[s]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...