# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45554 | aome | Easter Eggs (info1cup17_eastereggs) | C++17 | 21 ms | 548 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;
const int N = 555;
int T;
int arr[N];
vector<int> G[N];
void dfs(int u, int p) {
arr[++T] = u;
for (auto v : G[u]) {
if (v == p) continue; dfs(v, u);
}
}
int findEgg(int n, vector < pair <int, int> > bridges) {
T = 0;
for (int i = 1; i <= n; ++i) G[i].clear();
for (int i = 0; i < (n - 1); ++i) {
G[bridges[i].first].push_back(bridges[i].second);
G[bridges[i].second].push_back(bridges[i].first);
}
dfs(1, 1);
int l = 1, r = n;
while (l < r) {
int mid = (l + r) >> 1;
vector<int> ask;
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... |