|Online Judge||Problem Set||Authors||Online Contests||User|
Given a board of N × N cells, each cell may contain at most one piece. For the purpose of this problem, two pieces A and B are directly connected if their cells share a common edge. Two pieces A and B are connected indirectly if there exists another piece C such that A and C are connected (indirectly or directly) and B and C are connected (indirectly or directly). Write a program to use no more than 50000 instructions to make all pieces connected (indirectly or directly) with each other.
Each instruction can move one piece to an empty cell, which shares a common edge.
The first line of input contains two integers N, M, denoting the size of board and the number of pieces on the board. 1 ≤ N ≤ 100, 1 ≤ M ≤ N × N
The first line of output contains one integer C denoting the number of instructions.
4 4 1 1 2 2 3 3 4 4
4 1 1 2 1 4 4 3 4 3 4 2 4 2 4 2 3
POJ Founder Monthly Contest – 2008.10.05, Lou Tiancheng
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator