# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61591 | FutymyClone | Easter Eggs (info1cup17_eastereggs) | C++14 | 35 ms | 608 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 = 515;
vector <int> g[N], vertices;
int n, a[N];
void dfs (int u, int p) {
vertices.push_back(u);
for (int v: g[u]) {
if (v == p) continue;
dfs(v, u);
}
}
int findEgg (int N, vector <pair <int, int> > bridges) {
n = N;
vertices.clear();
for (int i = 1; i <= n; i++) g[i].clear();
for (auto i: bridges) {
g[i.first].push_back(i.second);
g[i.second].push_back(i.first);
}
dfs(1, 1);
int l = 1;
int r = n;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |