# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128627 | sheyasutaka | Easter Eggs (info1cup17_eastereggs) | C++14 | 21 ms | 436 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 "grader.h"
#include <vector>
using std::vector;
using std::pair;
typedef pair<int, int> P;
vector<int> g[600];
vector<int> euler;
void dfs (int v, int p) {
euler.push_back(v);
for (int u : g[v]) {
if (u == p) continue;
dfs(u, v);
}
}
int findEgg (int N, vector<P> bridges) {
int i, j;
for (i = 0; i < 600; i++) {
g[i].clear();
}
euler.clear();
for (i = 0; i < N - 1; i++) {
g[bridges[i].first - 1].push_back(bridges[i].second - 1);
g[bridges[i].second - 1].push_back(bridges[i].first - 1);
}
dfs(0, N);
int l = 0, r = N;
while (l + 1 < r) {
int med = (l + r) / 2;
vector<int> v;
for (i = 0; i < med; i++) {
v.push_back(euler[i] + 1);
}
if (query(v)) {
r = med;
} else {
l = med;
}
}
return euler[l] + 1;
}
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... |