# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053965 | 2024-08-12T00:01:15 Z | SulA | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; vector<int> adj[513], preorder; void dfs(int u = 1, int p = 0) { preorder.push_back(u); for (int ch : adj[u]) if (ch != p) dfs(ch, u); } int findEgg (int n, vector<pair<int,int>> bridges) { for (auto pair : bridges) { int u = pair.first, v = pair.second; adj[u].push_back(v); adj[v].push_back(u); } dfs(); int l = 0, r = n-1; while (r > l) { int mid = (l+r)/2; vector<int> myquery; for (int i = 0; i <= mid; i++) myquery.push_back(preorder[i]); bool res = query(myquery) == 1; // cout << "MY QUERY IS "; // for (int u : myquery) cout << u << " "; // cout << '\n'; if (res) r = mid; else l = mid+1; } return preorder[l]; }