# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
851969 | 2023-09-21T02:30:49 Z | AtabayRajabli | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; vector<vector<int>> g; vector<int> order; void dfs(int v, int prev) { order.push_back(v); for(int i : g[v]) { if(i == prev)continue; dfs(i, v); } } int findEgg(int n, vector<pair<int, int>> bridges) { g.clear(); order.clear(); g.resize(n+1); for(auto &[u, v] : bridges) { g[u].push_back(v); g[v].push_back(u); } dfs(1, 0); int l = 0, r = n-1; while(l <= r) { int mid = (l + r) >> 1; if(query(vector<int> (order.begin(), order.begin() + mid))) r = mid; else l = mid + 1; } return order[l]; }