# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61483 | tranxuanbach | Easter Eggs (info1cup17_eastereggs) | C++17 | 51 ms | 2808 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;
#define fi first
#define se second
const int N = 1e5 + 5;
vector <int> 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);
}
return;
}
int findEgg(int N, vector <pair <int, int> > bridges){
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... |