Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Users Search
Help Dashboard Sign In Sign Up
Challenges Q&A Sandbox Meta
Challenges
Posts Tags Edits
Post Challenge

Post History

66%
+2 −0
Challenges Mark my beacons

Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1. For example, here are some grids with a single beacon: Size 1:...

0 answers  ·  posted 2y ago by Razetime‭  ·  last activity 2y ago by Moshi‭

Question code-golf matrix
#4: Post edited by user avatar Razetime‭ · 2022-09-20T10:06:13Z (about 2 years ago)
add to overlapping
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • **Test 3:** [JSON Array](https://dzaima.github.io/paste#0i@aKNtBBgbE6OIWMiVKFpJKAKjxCXLEA#JS)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 3 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 3 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 0 0
  • All possible outputs:
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 1 1 1 1 1 0
  • 1 2 1 2 2 2 1 0
  • 1 1 1 2 3 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
  • ---
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 3 2 1 1 1 0
  • 1 2 2 2 1 2 1 0
  • 1 1 1 1 1 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one full beacon over the other. You can choose which beacon takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • **Test 3:** [JSON Array](https://dzaima.github.io/paste#0i@aKNtBBgbE6OIWMiVKFpJKAKjxCXLEA#JS)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 3 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 3 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 0 0
  • All possible outputs:
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 1 1 1 1 1 0
  • 1 2 1 2 2 2 1 0
  • 1 1 1 2 3 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
  • ---
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 3 2 1 1 1 0
  • 1 2 2 2 1 2 1 0
  • 1 1 1 1 1 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
#3: Post edited by user avatar Razetime‭ · 2022-09-20T10:04:58Z (about 2 years ago)
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • **Test 3:** [JSON Array](https://dzaima.github.io/paste#0i@aKNtBBgbE6OIWMiVKFpJKAKjxCXLEA#JS)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 3 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 3 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 0 0
  • One possible output:
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 1 1 1 1 1 0
  • 1 2 1 2 2 2 1 0
  • 1 1 1 2 3 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • **Test 3:** [JSON Array](https://dzaima.github.io/paste#0i@aKNtBBgbE6OIWMiVKFpJKAKjxCXLEA#JS)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 3 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 3 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 0 0
  • All possible outputs:
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 1 1 1 1 1 0
  • 1 2 1 2 2 2 1 0
  • 1 1 1 2 3 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
  • ---
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 3 2 1 1 1 0
  • 1 2 2 2 1 2 1 0
  • 1 1 1 1 1 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
#2: Post edited by user avatar Razetime‭ · 2022-09-13T12:30:59Z (about 2 years ago)
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.
  • For example, here are some grids with a single beacon:
  • Size 1:
  • ```
  • 0 0 0 0 0 0
  • 0 1 0 -> 0 1 0
  • 0 0 0 0 0 0
  • ```
  • Size 2:
  • ```
  • 0 0 0 1 1 1
  • 0 2 0 -> 1 2 1
  • 0 0 0 1 1 1
  • ```
  • Size 3:
  • ```
  • 0 0 0 0 0 1 1 1 1 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 3 0 0 -> 1 2 3 2 1
  • 0 0 0 0 0 1 2 2 2 1
  • 0 0 0 0 0 1 1 1 1 1
  • ```
  • ## I/O
  • Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.
  • - Your output can have multiple beacons of various sizes.
  • - If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
  • - beacons can be on the edges of the grid. they will not wrap around.
  • ## Tests
  • Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 4
  • 0 0 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 2 0 0 0 0 0 0 0 0 0
  • 0 0 0 2 0 0 1 0 0 0
  • 0 0 0 0 0 0 0 0 0 0
  • 0 1 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 0 0 0
  • Output:
  • 0 0 0 0 0 0 1 2 3 3
  • 0 0 0 0 0 0 1 2 3 4
  • 0 0 0 0 0 0 1 2 3 3
  • 1 1 0 0 0 0 1 2 2 2
  • 2 1 1 1 1 0 1 1 1 1
  • 1 1 1 2 1 0 1 0 0 0
  • 0 0 1 1 1 0 0 0 0 0
  • 0 1 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 0 0 0
  • ```
  • Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
  • ```
  • Input:
  • 1 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 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
  • 0 0 4 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 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 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
  • 0 0 3 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 0 0
  • Output:
  • 1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
  • 2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
  • 2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
  • 2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
  • 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
  • 1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
  • ```
  • **Test 3:** [JSON Array](https://dzaima.github.io/paste#0i@aKNtBBgbE6OIWMiVKFpJKAKjxCXLEA#JS)
  • ```
  • Input:
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 3 0 0 0 0 0
  • 0 0 0 0 0 0 0 0
  • 0 0 0 0 3 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 0 0
  • One possible output:
  • 1 1 1 1 1 0 0 0
  • 1 2 2 2 1 0 0 0
  • 1 2 1 1 1 1 1 0
  • 1 2 1 2 2 2 1 0
  • 1 1 1 2 3 2 1 0
  • 0 0 1 2 2 2 1 0
  • 0 0 1 1 1 1 1 0
  • 0 0 0 0 0 0 0 0
#1: Initial revision by user avatar Razetime‭ · 2022-09-12T13:40:50Z (about 2 years ago) 
Mark my beacons
Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1.

For example, here are some grids with a single beacon:

Size 1:
```
0 0 0    0 0 0
0 1 0 -> 0 1 0
0 0 0    0 0 0
```
Size 2:
```
0 0 0    1 1 1
0 2 0 -> 1 2 1
0 0 0    1 1 1
```

Size 3:
```
0 0 0 0 0    1 1 1 1 1
0 0 0 0 0    1 2 2 2 1
0 0 3 0 0 -> 1 2 3 2 1
0 0 0 0 0    1 2 2 2 1
0 0 0 0 0    1 1 1 1 1
```

## I/O

Your input is in the form of a 2D grid of integers. You can take the dimensions if needed.

- Your output can have multiple beacons of various sizes.
- If beacons overlap, you can overwrite one over the other. You can choose which one takes priority.
- beacons can be on the edges of the grid. they will not wrap around.

## Tests

Test 1: [JSON Array](https://dzaima.github.io/paste#0i@aKNtDBgLE62IRNsAsb4BE2wqcaImlI0BC4GqKsxCbMFQsA)
```
Input:
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 4
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0
0 0 0 2 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 1 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 0 0 0
Output:
0 0 0 0 0 0 1 2 3 3
0 0 0 0 0 0 1 2 3 4
0 0 0 0 0 0 1 2 3 3
1 1 0 0 0 0 1 2 2 2
2 1 1 1 1 0 1 1 1 1
1 1 1 2 1 0 1 0 0 0
0 0 1 1 1 0 0 0 0 0
0 1 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 0 0 0
```

Test 2: [JSON Array](https://dzaima.github.io/paste#0i@aKNtQxwA1jdbiiDchRYIKuwITqVtBAgTH5JnDFAgA)
```
Input:
1 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 0 0 0 0
0 0 0 0 0 0 0 0 0 0 4 0 0 0 0
0 0 4 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 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 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 3 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 0 0
Output:
1 1 1 1 1 1 0 1 2 2 2 2 2 1 0
2 2 2 2 2 1 0 1 2 3 3 3 2 1 0
2 3 3 3 2 1 0 1 2 3 4 3 2 1 0
2 3 4 3 2 1 0 1 2 3 3 3 2 1 0
2 3 3 3 2 1 0 1 2 2 2 2 2 1 0
2 2 2 2 2 1 0 1 1 1 1 1 1 1 0
1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
1 2 3 2 1 0 0 0 0 0 0 0 0 0 0
1 2 2 2 1 0 0 0 0 0 0 0 0 0 0
```
code-golf matrix