제출 #1178300

#제출 시각아이디문제언어결과실행 시간메모리
1178300perchutsEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms472 KiB
#include <bits/stdc++.h> #include "grader.h" int findEgg(int n, vector<pair<int, int>> edg) { vector<vector<int>> g(n+1); for (auto [x, y] : edg) g[x].push_back(y), g[y].push_back(x); vector<int> in(n+1); int tt = 1; auto dfs = [&] (auto&& self, int u, int p) -> void { if (tt > n) while (true) {} in[tt] = u; tt++; for (auto v : g[u]) { if (v == p) continue; self(self, v, u); } }; dfs(dfs, 1, 1); int l = 1, r = n, ans = n; while (l <= r) { int md = l + (r-l+1)/2; vector<int> qq; for (int i = 1; i <= md; ++i) qq.push_back(in[i]); if (query(qq)) ans = md, l = md+1; else r = md-1; } return in[ans]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...