# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866983 | Ice_man | ICC (CEOI16_icc) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <cstring>
#define maxn 105
using namespace std;
vector <int> path;
bool used[maxn];
vector <int> v[maxn];
void dfs(int node)
{
path.push_back(node);
used[node] = true;
for(int nb : v[node]) if(used[nb] == false) dfs(nb);
}
void _set()
{
memset(used , 0 , sizeof(used));
path.clear();
}
void _fill()
{
_set();
for(int node = 0; node < v.size(); node++) if(used[node] == false) dfs(node);
}
void _add()
{
/// ne znam
/// posle she go opraq
}
void run(int n)
{
}