|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
You have a chessboard with N rows and N columns. Initially you have N rooks placed in various squares of the chessboard. Two rooks attack each other if they are on the same cell or in the same column or in the same row. In each step you can move a rook one cell up/down/left/right. You cannot move it diagonally. You have to move these N rooks into N different squares with minimum steps so that none of them attack each other.
The first line of the input gives an integer T, which is the number of test cases. Each test case starts with N. Each of the next line contains 2 integers (between 1 and N inclusive) in each line denoting the row and column of the rook. N can be as big as 20000.
For each test case, the output contains a line in the format Case #x: M, where x is the case number (starting from 1) and M is the minimum number of steps needed to move the rooks.
2 3 1 1 1 1 1 1 4 1 1 1 1 1 3 3 1
Case #1: 6 Case #2: 8