# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042008 | blackslex | Easter Eggs (info1cup17_eastereggs) | C++17 | 10 ms | 600 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;
using pii = pair<int, int>;
int findEgg (int N, vector<pair<int, int>> bridges) {
int n = N;
vector<vector<int>> v(n + 5);
for (auto &[x, y]: bridges) v[x].emplace_back(y), v[y].emplace_back(x);
vector<int> ord;
queue<int> q; q.emplace(1);
vector<bool> f(n + 5);
while (!q.empty()) {
int cur = q.front(); q.pop();
if (f[cur]) continue; f[cur] = 1; ord.emplace_back(cur);
for (auto &e: v[cur]) q.emplace(e);
}
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r) >> 1;
vector<int> ask(ord.begin(), ord.begin() + mid + 1);
if (query(ask)) r = mid;
else l = mid + 1;
}
return ord[l];
}
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... |