# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145991 | ivailo_ganchev | Easter Eggs (info1cup17_eastereggs) | C++20 | 8 ms | 512 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#define endl '\n'
using namespace std;
const int MAXN = 1024;
vector<int>e[MAXN];
vector<int>order;
int n;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
void dfs(int node, int parent)
{
order.push_back(node);
for(int &nb : e[node])
{
if(nb==parent)
continue;
dfs(nb, node);
}
}
bool check(int mid)
{
vector<int>q;
q.clear();
for(int i=0;i<=mid;i++)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |