|
|||
H — Forest PictureThe game “Draw a forest picture” is quite popular among younger visitors of the amusement park. The number of players in the game is virtually unlimited, and nearly everybody becomes a winner. The game is simple. At the beginning, a leader of the game describes briefly a picture of a forest which he or she had seen recently. Then the players are given some paper and crayons, and they have to reproduce the image as best as they can. Everybody who hands in at least partial image of virtually any piece of any forest anywhere on Earth depicted in any style wins a small reward in the form of a chocolate or a fruit. In this problem, you have to implement an imitation of the game. As you are much more experienced than the younger players, your drawing has to meet the specifications exactly. The image you have to reproduce depicts a glade — an open area within a woodland which is somewhat less populated by the trees than the surrounding thick forest. The image has to be printed in the “ASCII art” style. An M × M image is represented by a canvas consisting of M rows, each row containing M characters. Each pixel in the image is represented by some printable ASCII character on the canvas. The coordinates of the pixels in the image correspond to the coordinates of the characters on the canvas. The coordinates of the pixels in the bottom left corner and in the top right corner of the image are (0, 0) and (M – 1, M – 1), respectively. The x-coordinate of the pixel in the bottom right corner of the image is M – 1.
Each pixel in the image depicts either grass or a part of a standing tree or a tree stump. A
pixel depicting grass is represented by a single dot character (“
A standing tree has a positive height S and consists of four parts: the roots, the
tree trunk, the branches, and the treetop. The roots are represented by three horizontally
adjacent characters: underscore, vertical bar, underscore (“
A tree stump consists of three horizontally adjacent pixels represented by characters
underscore, lowercase letter “ Note that a standing tree or a tree stump may appear in the image only partially or may not appear in the image at all, depending on its coordinates. See the sample data below for additional illustration of this fact. Input SpecificationThere are several test cases. Each test case starts with a line containing two integers M and N separated by a space (1 ≤ M ≤ 100, 1 ≤ N ≤ 105). Next, there are N lines, each containing a triple of integers S, X, Y, separated by spaces, which describe one standing tree or one tree stump. The values of X and Y represent the coordinates of the center of either tree roots or a tree stump. In case of S = 0, the triple describes a stump. In case of S > 0, the triple describes a standing tree with height S. It holds 0 ≤ S ≤ 9, –109 ≤ X, Y ≤ 109. It is guaranteed that no parts of two different standing trees and/or tree stumps should be depicted by the same pixel. Output Specification
For each test case, print the canvas with the image of the glade. The top row of the canvas
should be the first printed row of the image. The bottom row of the canvas should be the last
printed row of the image. The printout should be decorated by a square border made of
asterisk characters (“ Sample Input
Output for Sample Input
|
|||
University of Debrecen; Faculty of Informatics; v. 09/30/2024 |