Problem:
Score : 100 points

Problem Statement

There is a directed graph G with N vertices and M edges.
The vertices are numbered 1, 2, \ldots, N, and for each i (1 \leq i \leq M), the i-th directed edge goes from Vertex x_i to y_i.
G does not contain directed cycles.

Find the length of the longest directed path in G.
Here, the length of a directed path is the number of edges in it.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq M \leq 10^5

1 \leq x_i, y_i \leq N

All pairs (x_i, y_i) are distinct.

G does not contain directed cycles.

Input

Input is given from Standard Input in the following format:

N M
x_1 y_1
x_2 y_2
:
x_M y_M

Output

Print the length of the longest directed path in G.

Sample Input 1

4 5
1 2
1 3
3 2
2 4
3 4

Sample Output 1

3

The red directed path in the following figure is the longest:

Sample Input 2

6 3
2 3
4 5
5 6

Sample Output 2

2

The red directed path in the following figure is the longest:

Sample Input 3

5 8
5 3
2 3
2 4
5 2
5 1
1 4
4 3
1 3

Sample Output 3

3

The red directed path in the following figure is one of the longest:

Solution in Rust (1.42.0) (judge verdict: Accepted)

use proconio::input;
use proconio::marker::Usize1;
use std::collections::VecDeque;
use std::cmp::max;

struct Node {
    to: Vec<usize>,
    from: Vec<usize>,
    count: usize,
    dist: u32,
}

impl Node {
    fn new() -> Self {
        Node {
            to: Vec::new(),
            from: Vec::new(),
            count: 0,
            dist: 0,
        }
    }
}

fn main()
{
    input! {
    n:usize,
    m:usize,
    edge:[(Usize1,Usize1);m],
    }

    let mut v = (0..n).map(|_| Node::new()).collect::<Vec<Node>>();
    for &(a, b) in edge.iter() {
        v[a].to.push(b);
        v[b].from.push(a);
    }

    let mut q = VecDeque::new();
    for i in 0..n {
        if v[i].to.len() == 0 {
            q.push_back(i);
        }
    }

    while let Some(idx) = q.pop_front() {
        let dist = v[idx].dist + 1;
        for i in 0..v[idx].from.len() {
            let nxt = v[idx].from[i];
            v[nxt].dist = max(v[nxt].dist, dist);
            v[nxt].count += 1;

            if v[nxt].count == v[nxt].to.len() {
                q.push_back(nxt);
            }
        }
    }

    let mut ans = 0;
    for e in v.into_iter() {
        ans = max(ans, e.dist);
    }

    println!("{}", ans);
}