# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515432 | blue | Wells (CEOI21_wells) | C++17 | 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 <algorithm>
#include <queue>
using namespace std;
const int maxN = 200;
#define sz(x) int(x.size())
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const ll mod = 1'000'000'007;
vi edge[1+maxN];
vvi new_edge;
int dep(int u, int p, int d)
{
int ans = d;
for(int v: edge[u])
{
if(v == p) continue;
ans = max(ans, dep(v, u, d+1));
}
return ans;
}
vvi dist;
void dfs(int src, int u, int p)