# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146430 | ReLice | Easter Eggs (info1cup17_eastereggs) | C++20 | 290 ms | 196608 KiB |
#include "grader.h"
#include <bits/stdc++.h>
#define ll int
#define ld double
#define pb push_back
#define pf push_front
#define ins insert
#define fr first
#define sc second
#define endl "\n"
#define all(x) x.begin(), x.end()
using namespace std;
const ll M = 1e3 + 5;
vector<vector<ll>> d(M), g(M);
ll mx = 0;
void dfs(ll v, ll p, ll dd){
d[dd].pb(v);
mx = max(mx, dd);
for(auto i : g[v]){
if(i == p) continue;
dfs(i, v, dd + 1);
}
}
int findEgg (int n, vector <pair<int, int>> bridges){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |