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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

'use strict'

function dfs(root, list, memo) {
  if (memo[root]) {
    return memo[root]
  }
  if (!list[root].length) {
    return 0
  }
  var max = 0
  for (var i = 0; i < list[root].length; i++) {
    max = Math.max(max, 1 + dfs(list[root][i], list, memo))
  }
  memo[root] = max
  return max
}

function adjList(N, edges) {
  //var res = new Array(N+1).fill(0).map(e => new Array())
  //var incoming = new Array(N+1).fill(0)
  //for (var i = 0; i < edges.length; i++) {
   // res[edges[i][0]].push(edges[i][1])
  //  incoming[edges[i][1]]++
 // }
  return {
    list: [],
    incoming: []
  }
}

function solve(N, edges) {
  var adjListRes = adjList(N, edges)
  var list = adjListRes.list
  var incoming = adjListRes.incoming
  var max = 0
  var memo = new Array(N+1)
  for (var i = 1; i <= incoming.length; i++) {
    if (incoming[i] === 0) {
      max = Math.max(max, dfs(i, list, memo))
    }
  }
  return max
}

function main(input) {
  var lines = input.split("\n")
  var NM = lines[0].split(' ').map(i => parseInt(i))
  var N = NM[0]
  var edges = []
  for (var i = 1; i < lines.length; i++) {
    var e = lines[i].split(' ').map(l => parseInt(l))
    edges.push(e)
  }
  var ans = solve(N, edges)
  console.log(ans)
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));