Coins | 프로그래밍의 벗 PivotOJ
PivotOJ

Coins

시간 제한: 2000ms메모리 제한: 1024MB출처: LMIO 2018-2019BOJ 27349
이 문제는 본문 이미지 일부가 표시되지 않습니다. 텍스트만으로 풀이가 어려울 수 있습니다.

문제

There are coins placed on squares of a N×NN \times N grid board where NN is even. There is one coin in each square. Exactly half of the coins are silver ones, the other half are copper.

The coins are placed properly if all the copper coins are in the upper left part of the board and silver coins are placed on the lower right part of the board. To be precise, if the edge of a square is a separator between different types of coins, the copper coin is either to the left or above the silver coin.

Proper placement Improper placement
[이미지 1] [이미지 2]

Figure 1: The coins are placed properly if there are no placements as shown on the right. Black circles represent copper coins, white circles – silver ones.

You are given a set of coins placed improperly on the board. Rearrange them to get a proper placement by switching as few pairs of coins as possible.

입력

The first line of the input contains four integers – TT, NN, K1K_1, K2K_2:

  • TT – the number of the test;
  • NN – board size;
  • K1K_1, K2K_2 – values that define grading (see section Grading).

Each of the remaining NN lines contain NN integers each. They describe initial coin placement on the board. Available integers are 0 (copper coin) or 1 (silver coin).

출력

Output the board with proper placement of coins in a form of N×NN \times N board in the same format as input. Exactly one half of integers should be 0 (copper coin), the other half should be 1.

예제

예제 1

입력
0 4 1 5
0 0 1 0
0 0 0 1
0 1 1 1
1 1 0 1
출력
0 0 1 1
0 0 1 1
0 0 1 1
0 0 1 1
코드를 제출하려면 로그인하세요.