Logo
(追記) (追記ここまで)

26538번 - Scarecrows 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 1024 MB35231872.000%

문제

After having your field picked apart by crows time and time again, you’ve decided to employ a system of scarecrows. In order to determine how effective your scarecrow network is, and which areas need more protection, create a graph to display which areas of the field are protected. Each of your scarecrows has a unique range in which it works. Any location within P distance from a scarecrow with a range of P will be protected.

입력

The first line will contain a single integer n that indicates the number of data sets that follow. Each data set will start with a single integer w, h, and q, denoting the width and height of your field, and the number of scarecrows you have. the next q lines consist of 3 space separated integers, r, c, and p, representing the horizontal and vertical position of each scarecrow and its range. 0≤r

출력

For each test case, output h lines of w characters each, where character w of line h is an ‘*’ if point (w,h) is protected, an ‘x’ if it is a scarecrow, and a ‘.’ Otherwise. Leave a blank line between test cases.

제한

예제 입력 1

2
5 5 1
2 2 2
5 5 2
1 1 1
3 3 1

예제 출력 1

..*..
.***.
**x**
.***.
..*..
.*...
*x*..
.*.*.
..*x*
...*.

힌트

출처

School > PLU High School Programming Contest > PLU 2017 > Advanced 5번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /