영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
In a grid with R rows and C columns, a wolf stands at cell (1, 1) and a rabbit stands at cell (R, C). The wolf wants to move to cell (R, C), and the rabbit wants to move to cell (1, 1). However, there is a problem: if their paths cross, the wolf will follow the rabbit and chase it. Now we wonder, given the layout of the grid, can you find a path for both the rabbit and the wolf so that their paths do not cross each other? The start and end cells ((1, 1) and (R, C)) are not counted as part of the path.
Input
The first line contains two integers: R and C. In all test cases, it holds that 2 ≤ R · C ≤ 2 · 10^5.
Then follows an R × C grid. Each cell is either “.” which means an empty cell, or “#” which means an obstacle.
It is guaranteed that the cells (1,1) and (R,C) are empty.
Output
Print NO if there are no two paths that meet the requirements of the task.
Otherwise, print a line with YES. Then print a grid where you mark the rabbit's path with “K” and the wolf's path with “V”. Note that all obstacles must remain obstacles when you print the grid and that all empty cells that are not part of the paths must remain empty cells. A path must be contiguous.
If you are using C++, it may be good to use '\n' instead of endl to avoid risking Time Limit Exceeded on a working solution.
Scoring
Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 9 | There are on obstacles. |
| 2 | 10 | R · C ≤ 10 |
| 3 | 20 | R = 3 |
| 4 | 25 | R · C ≤ 1000, and there exist a solution where the wolf only walks down and right, and the rabbit only up and left. |
| 5 | 36 | No additional constraints. |
Note that some example cases are not valid in all test case groups.
예제
예제 1
2 2 .# ..
NO
예제 2
3 3 ... .#. ...
YES .VV K#V KK.
예제 3
10 10 ........## ..##.##.## #....##... ###....##. ###.##.#.. #......### #.###..### #...#..... #.#.#..... ########..
YES .VVVV...## KK##V##.## #KKKV##... ###KVVV##. ###K##V#.. #..KKKV### #.###KV### #...#KVVVV #.#.#KKKKV ########K.
예제 4
4 7 .....## ..#.... ..##... .......
YES .VVVV## KK#.VVV .K##..V .KKKKK.
예제 5
16 14 .............. .............. ############.. ...........#.. ...........#.. ..#######..#.. ..#.....#..#.. ..#.....#..#.. ..#..#.....#.. ..#..#.....#.. ..#..#######.. ..#........... ..#........... ..############ .............. ..............
YES .VVVVVVVVVVVVV KKKKKKKKKKKKKV ############KV KKKKKKKKKKK#KV KVVVVVVVVVK#KV KV#######VK#KV KV#VVVVV#VK#KV KV#VKKKV#VK#KV KV#VK#KVVVK#KV KV#VK#KKKKK#KV KV#VK#######KV KV#VKKKKKKKKKV KV#VVVVVVVVVVV KV############ KVVVVVVVVVVVVV KKKKKKKKKKKKK.