# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145955 | bbbiros | Easter Eggs (info1cup17_eastereggs) | C++20 | 8 ms | 504 KiB |
#include <vector>
#include <queue>
#include "grader.h"
#define endl '\n'
#define ll long long
using namespace std;
int n;
int used[520];
vector <int> v[520];
vector <int> mno;
bool f=1;
void dfs(int beg)
{
used[beg]=1;
mno.push_back(beg);
///cout << "-------------" << endl;
///cout<<beg<<endl;
for(int i=0; i<v[beg].size(); i++)
{
int nb=v[beg][i];
///cout << nb << endl;
if(!used[nb])
{
dfs(nb);
}
}
}
int bin()
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |