# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330460 | Falcon | Easter Eggs (info1cup17_eastereggs) | C++17 | 28 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg (int N, vector<pair<int, int>> bridges) {
vector<vector<int>> adj(N + 1);
for(const auto& [u, v] : bridges)
adj[u].push_back(v), adj[v].push_back(u);
vector<bool> vis(N + 1);
vector<int> order{1}; order.reserve(N);
for(int i = 0; i < int(order.size()); ++i) {
int u{order[i]}; vis[u] = true;
for(int v : adj[u])
if(!vis[v]) order.push_back(v);
}
assert(order.size() == N);
int i{};
for(int t = 1 << __lg(N); t > 0; t >>= 1)
if(i + t < N
&& !query(vector<int>(order.begin(), order.begin() + i + t)))
i += t;
return order[i];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |