제출 #1164725

#제출 시각아이디문제언어결과실행 시간메모리
1164725adaawfEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
1 ms468 KiB
#include <iostream> #include <vector> #include "grader.h" using namespace std; vector<int> g[555]; int dd[555], z = 0, b[555]; void dfs(int x, int p) { dd[x] = ++z; b[z] = x; for (int w : g[x]) { if (w == p) continue; dfs(w, x); } } int findEgg(int n, vector<pair<int, int>> e) { for (int i = 1; i <= n; i++) g[i].clear(); z = 0; for (int i = 0; i < n - 1; i++) { g[e[i].first].push_back(e[i].second); g[e[i].second].push_back(e[i].first); } int l = 1, r = n, res; while (l <= r) { int mid = (l + r) >> 1; vector<int> v; for (int i = 1; i <= mid; i++) { v.push_back(b[i]); } if (query(v)) { res = mid; l = mid + 1; } else r = mid - 1; } return b[res]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...