제출 #722114

#제출 시각아이디문제언어결과실행 시간메모리
722114viwlesxqEaster Eggs (info1cup17_eastereggs)C++17
100 / 100
24 ms376 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; typedef int64_t ll; typedef string str; int findEgg(int n, vector <pair <int, int>> edges) { vector <int> g[n + 1]; vector <int> path; for (auto [a, b] : edges) { g[a].push_back(b); g[b].push_back(a); } function <void(int, int)> dfs = [&](int v, int p) { path.push_back(v); for (int to : g[v]) { if (to == p) { continue; } dfs(to, v); } }; dfs(1, -1); int l = 0, r = n - 1; while (l < r) { int mid = (l + r) >> 1; vector <int> nodes; for (int i = 0; i <= mid; ++i) { nodes.push_back(path[i]); } if (query(nodes)) { r = mid; } else { l = mid + 1; } } return path[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...