# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1095333 | 2024-10-02T00:47:16 Z | idiotcomputer | Easter Eggs (info1cup17_eastereggs) | C++11 | 0 ms | 0 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; #define f first #define s second #define pb push_back #define sz(x) (int) (x).size() const int mxN = 520; vector<int> adj[mxN]; vector<int> ord; void dfs(int node, int p){ ord.pb(node); for (int c : adj[node]){ if (c != p) dfs(c,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(0,-1); 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]; }