# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410451 | nichke | Easter Eggs (info1cup17_eastereggs) | C++14 | 25 ms | 472 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>
using namespace std;
vector< int > vi;
vector< int > euler;
vector< int > adj[513];
int query(vector <int> );
void dfs(int v, int p = -1) {
euler.push_back(v);
for (int u : adj[v]) {
if (u == p) continue;
dfs(u, v);
}
}
int check_query(int x) {
vi.clear();
for (int i = 0; i <= x; i++) {
vi.push_back(euler[i]);
}
return query(vi);
}
int findEgg(int N, vector< pair <int, int> > bridges) {
euler.clear();
for (int i = 1; i <= N; i++) {
adj[i].clear();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |