| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 155 | 53 | 48 | 42.857% |
You are given a grid of size $N \times M$. Your task is to color each cell of the grid with one of four colors: 1ドル,ドル 2ドル,ドル 3ドル,ドル or 4ドル$.
There is only one rule: any two adjacent cells must have different colors. Two cells are considered adjacent if they share a common edge.
Some cells in the grid may already be colored. These pre-colored cells are located only on the border of the grid. You must color all the remaining empty cells to create a complete grid that satisfies the rule.
The first line of the input contains a single integer $T,ドル the number of test cases.
The first line of each test case contains two integers $N$ and $M$.
The next $N$ lines describe the initial state of the grid. Each line contains $M$ space-separated integers. A value of 0ドル$ represents an empty cell, while values from 1ドル$ to 4ドル$ represent a cell colored with that specific color.
For each test case, output $N$ lines representing the completed grid.
Each line should contain $M$ space-separated integers, where each integer is a color from 1ドル$ to 4ドル$.
If multiple solutions exist, you may print any one of them.
2 5 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 7 1 0 0 2 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 2 0 0 1
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 3 2 1 2 1 2 3 1 1 2 1 2 1 4 2 4 1 2 1 2 1 4 1 2 1 2 1 2 1 2 3 2 1 2 1 2 3 1 3 2 1 2 1
University > KAIST > KAIST ICPC Mock Competition > 2025 KAIST 15th ICPC Mock Competition G번
University > MIT > The MIT Programming Contest > 2025-26 > MIT Team Contest 2 G번