# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146248 | kolio642 | Easter Eggs (info1cup17_eastereggs) | C++17 | 8 ms | 532 KiB |
#include <iostream>
#include <vector>
#include <set>
#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;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |