Submission #1074393

---

Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second

using namespace std;
//using namespace __gnu_pbds;

//typedef tree<int, nuint_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 31;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MAX_int = (1 << 31) - 1;
const double eps = 1e-6;
const double pi = atan2(0, -1);

struct dsu
{
    map<int, int> p;
    dsu() {}
    void add(int x)
    {
        p[x] = x;
    }
    int get(int x)
    {
        if (p[x] != x)
            p[x] = get(p[x]);
        return p[x];
    }
};

vector<vector<int> > g;

int dfs(int u)
{
    if (sz(g[u]) == 0)
        return 0;
    set<int> s;
    dsu d;
    for (int v : g[u])
    {
        int x = dfs(v);
        if (d.p.find(x) == d.p.end())
            d.add(x);
        else
        {
            int y = d.get(x);
            d.add(y + 1);
            d.p[y] = y + 1;
        }
    }
    return d.p.rbegin()->fi + 1;
}

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("battleship.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //int TL = 0.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n;
    cin >> n;
    g.resize(n);
    rep(i, 1, n)
    {
        int x;
        cin >> x;
        x--;
        g[x].push_back(i);
    }
    cout << dfs(0);
    return 0;
}

Submission Info

Compile Error

./Main.cpp:27:31: warning: integer overflow in expression [-Woverflow]
 const int MAX_int = (1 << 31) - 1;
                               ^

Judge Result