제출 #1200902

#제출 시각아이디문제언어결과실행 시간메모리
1200902BehruzbekXEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
0 ms472 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; int findEgg (int N, vector < pair < int, int > > bridges) { vector<vector<int>> a(N); for (auto &[x, y] : bridges) --x, --y, a[x].emplace_back(y), a[y].emplace_back(x); vector<int> g; auto dfs = [&](auto &dfs, int v, int p) -> void{ g.emplace_back(v); for (int u : a[v]) if (u != p) dfs(dfs, u, v); }; dfs(dfs, 0, -1); int l = 0, r = g.size() - 1, ans = -1; while (l <= r) { int mid = (l + r) >> 1; if (query(vector<int>(g.begin(), g.begin() + mid))) ans = mid, r = mid - 1; else l = mid + 1; } return g[ans]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...