# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61603 | IOrtroiii | Easter Eggs (info1cup17_eastereggs) | C++14 | 38 ms | 3084 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 = 1e5 + 5;
int n;
vector<int> G[N], ask;
int arr[N], tot = 0;
void dfs(int u,int p) {
arr[++tot] = u;
for (int v : G[u]) if (v != p) {
dfs(v, u);
}
}
int findEgg(int n,vector<pair<int,int>> bridges) {
for (int i = 1; i <= n; ++i) G[i].clear();
for (auto ed : bridges) {
int u = ed.first, v = ed.second;
G[u].push_back(v), G[v].push_back(u);
}
dfs(1, 1);
int l = 1, r = n;
while (l < r) {
int mid = l + r >> 1;
ask.clear();
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... |