Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <iostream>#include <cstring>#include <vector>#include <queue>#include <string>#include <stack>#include <deque>using namespace std;typedef long long ll;int root[100001] = {0};bool vi[100001] = {0};int find(int x, int dep){// cout << x << " " << dep << endl;if(!vi[x]){vi[x] = true;return find(root[x], dep + 1);}return dep;}int main(){int n;cin >> n;for(int i = 1; i <= n; i++){