|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|2 초||256 MB||9||6||6||75.000%|
I really need to paint my floor! My floor is rectangular and has some furniture on it. Instead of hiring someone to paint it for me, I decided to do it myself. So I went out the local paint store, Antonio’s Colourful Masterpieces, and asked for some paint. The man behind the counter asked me if I would like to try some experimental paint. Curious as to what could be experimental about paint, I said, “Yes!” I then purchased 1 000 paint cans and went home (it was on a very good sale).
When I got home, I opened the instruction manual for the paint and was extremely surprised:
“When you pour the whole can of paint onto the ground, it will fill in the 1 × 1 block of floor it is in and then will expand out and fill every square that is in the same row or same column as the original 1 × 1 block so long as there is not an obstacle in the way.”
For example, in the left room, the paint is poured in the third row and second column and it fills in coloured squares. In the right room, the paint is poured in the same square, but it only goes until it hits the black obstacle (piece of furniture).
You may not pour paint onto any of the furniture (obviously!). The goal is to paint every square in the room that is not furniture. Painted squares do not become obstacles for future pours of paint and it is okay to paint squares multiple times.
For small rooms, I can easily figure out how to paint the rooms with this experimental paint, but for large rooms, I’m worried that I will run out of paint before I finish the floor! Can you tell me where to pour the paint? You do not need to give me an optimal solution, but you must give me a solution that uses no more than the 1 000 paint cans that I purchased. It is guaranteed that 1 000 paint cans are enough to paint the floor.
The input contains one test case.
The first line will contain two integers m and n (1 ≤ m, n ≤ 500) being the dimensions of my room in metres. The next m lines will contain n characters each. These lines will show the layout of my room. The map of the rooms will only contain the characters ‘.’ and ‘x’. An ‘x’ denotes an obstacle in the room and a ‘.’ denotes no obstacle. There will be at most 500 x’s in the input.
The output will consist of several lines. In each line, output two integers: the row and the column of where to pour the ith can of paint. The rows and columns are 1-based from the top-left corner. The number of lines of output must be no more than 1 000. The lines need not be in any particular order. Any valid output will be considered correct.
5 5 ..... ..... ..... ..... .....
1 1 2 2 3 3 4 4 5 5
7 7 ....... .xxxxx. .xx.xx. .x...x. .xx.xx. .xxxxx. .......
1 1 4 4 7 7
ICPC > Regionals > South Pacific > South Pacific Region > ACM South Pacific Western Division > ACM South Pacific Western Division 2015 D번
ICPC > Regionals > South Pacific > South Pacific Region > ACM South Pacific Eastern Division > ACM South Pacific Eastern Division 2015 J번
ICPC > Regionals > South Pacific > South Pacific Region > ACM South Pacific Central Division > ACM South Pacific Central Division 2015 J번