# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145953 | tisho | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 484 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include "grader.h"
#define endl '\n'
#define ll long long
vector<int>v[600];
vector<int>b;
bool used[600];
void dfs(int a)
{
used[a]=true;
b.push_back(a);
for(auto i:v[a])
{
if(!used[i])
{
dfs(i);
}
}
}
int findEgg(int n,vector<pair<int,int>>bridges)
{
memset(used,false,sizeof(used));
for(int i=1;i<=n;i++)
{
v[i].clear();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |