# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
734742 | 2023-05-03T03:27:56 Z | enkhochir | Easter Eggs (info1cup17_eastereggs) | C++14 | 0 ms | 0 KB |
//#include "grader.h" #include <bits/stdc++.h> using namespace std; vector<int> graph[513], ord; void dfs(int node = 1, int parent = 0) { ord.push_back(node); for (int i : graph[node]) if (i != parent) dfs(i, node); } int findEgg(int N, vector<pair<int, int>> bridges) { for (int i = 1; i <= N; i++) graph[i].clear(); ord.clear(); for (pair<int, int> i : bridges) { graph[i.first].push_back(i.second); graph[i.second].push_back(i.first); } dfs(); int l = 0, r = N - 1; while (l != r) { int mid = (l + r + 1) / 2; if (query(vector<int>(ord.begin(), ord.begin() + mid))) r = mid - 1; else l = mid; } return ord[l]; }