Problem:
Score : 500 points

Problem Statement

N players will participate in a tennis tournament. We will call them Player 1, Player 2, \ldots, Player N.

The tournament is round-robin format, and there will be N(N-1)/2 matches in total.
Is it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.

Each player plays at most one matches in a day.

Each player i (1 \leq i \leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \ldots, A_{i, N-1} in this order.

Constraints

3 \leq N \leq 1000

1 \leq A_{i, j} \leq N

A_{i, j} \neq i

A_{i, 1}, A_{i, 2}, \ldots, A_{i, N-1} are all different.

Input

Input is given from Standard Input in the following format:

N
A_{1, 1} A_{1, 2} \ldots A_{1, N-1}
A_{2, 1} A_{2, 2} \ldots A_{2, N-1}
:
A_{N, 1} A_{N, 2} \ldots A_{N, N-1}

Output

If it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.

Sample Input 1

3
2 3
1 3
1 2

Sample Output 1

3

All the conditions can be satisfied if the matches are scheduled for three days as follows:

Day 1: Player 1 vs Player 2

Day 2: Player 1 vs Player 3

Day 3: Player 2 vs Player 3

This is the minimum number of days required.

Sample Input 2

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

Sample Output 2

4

All the conditions can be satisfied if the matches are scheduled for four days as follows:

Day 1: Player 1 vs Player 2, Player 3 vs Player 4

Day 2: Player 1 vs Player 3

Day 3: Player 1 vs Player 4, Player 2 vs Player 3

Day 4: Player 2 vs Player 4

This is the minimum number of days required.

Sample Input 3

3
2 3
3 1
1 2

Sample Output 3

-1

Any scheduling of the matches violates some condition.

Solution in Scala (2.11.7) (judge verdict: Wrong Answer)

import java.io._
import java.util.StringTokenizer
import scala.util.control.Breaks.{breakable,break}
import scala.collection.mutable.{Map, Stack, Queue, PriorityQueue, Set}

object Main extends App {
  val in = new InputReader(System.in)
  val pw = new PrintWriter(System.out)

  val N = in.next().toInt
  val A = Array.ofDim[Int](N+1, N)
  for (i <- 1 to N) {
    for (k <- 1 until N) {
      A(i)(k) = in.next().toInt
    }
  }

  def hash(_a: Int, _b: Int): Int = {
    val a = _a min _b
    val b = _a max _b

    ((a-1) * (2*N - a)) / 2 + (b-a) - 1
  }

  // 
  val nodeNum = (N*(N-1)) / 2

  val inDegree = new Array[Int](nodeNum)

  val graph = Array.fill[List[Int]](nodeNum)(Nil)

  for (a <- 1 to N; k <- 2 until N) {
    val from = hash(a, A(a)(k-1))
    val b = A(a)(k)

    graph(from) =
      hash(a, b) :: graph(from)
    inDegree(hash(a, b)) += 1
  }

  println(inDegree.deep)

  val dp = new Array[Boolean](nodeNum)
  val ans = new Array[Int](nodeNum)
  val q = new Queue[(Int, Int)]()
  for (i <- 0 until nodeNum) {
    if (!dp(i) && inDegree(i) == 0) {
      q.enqueue((i, 1))
      while (!q.isEmpty) {
        val (now, cnt) = q.dequeue()

        ans(now) = Math.max(ans(now), cnt)
        if (inDegree(now) == 0) {
          dp(now) = true

          val nextCnt = ans(now) + 1
          for (e <- graph(now)) {
            inDegree(e) -= 1
            q.enqueue((e, nextCnt))
          }
        }
      }
    }
  }

  val hoge = ans.max
  if (hoge == 0)
    println(-1)
  else
    println(hoge)
}

object Sub {
  def print2DimArray[A](mat: Array[Array[A]]): Unit = {
    mat.foreach(lin => println(lin.deep))
  }
}

class InputReader(stream: InputStream) {
  private[this] val reader = new BufferedReader(new InputStreamReader(stream))
  private[this] var tokenizer: StringTokenizer = new StringTokenizer(reader.readLine())
  def next(): String = {
    while (!tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(reader.readLine())
    }
    tokenizer.nextToken()
  }
}