# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45971 | minhtung0404 | Easter Eggs (info1cup17_eastereggs) | C++17 | 25 ms | 2952 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.
//https://oj.uz/problem/view/info1cup17_eastereggs
#include <bits/stdc++.h>
#include "grader.h"
const int N = 1e5 + 5;
using namespace std;
typedef pair <int, int> ii;
typedef vector <int> vi;
vi adj[N], ans;
int n, num, cur, cnt;
bool ck[N], nw[N];
void dfs(int u, int p){
if (cur == num) return;
if (ck[u]) cur++;
ans.push_back(u);
for (int i = 0; i < adj[u].size(); i++){
int v = adj[u][i];
if (v == p) continue;
dfs(v, u);
}
}
int findEgg (int N, vector <ii> bridges) {
n = N;
for (int i = 1; i <= n; i++) ck[i] = 1; cnt = n;
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... |