# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164584 | daoquanglinh2007 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 484 KiB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define isz(a) (int)(a).size()
const int NM = 512;
int N, timer, tin[NM+5], tout[NM+5];
vector <int> adj[NM+5];
vector <int> arr;
void dfs(int u, int p){
arr.push_back(tin[u]);
for (int v : adj[u]){
if (v == p) continue;
dfs(v, u);
}
}
int findEgg(int _N, vector <pii> bridges){
N = _N;
for (int i = 1; i <= N; i++) adj[i].clear();
for (pii p : bridges){
adj[p.fi].push_back(p.se);
adj[p.se].push_back(p.fi);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |