## COCI '18 Contest 6 #2 Konj

View as PDF

Points: 7 (partial)
Time limit: 1.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Domagoj loves drawing horses at leisure. For a long time, he's been a proud member of social groups dealing with this subject. But Domagoj is a very special boy, so because of his drawing technique most people do not understand his masterpieces.

One of his most famous drawings is #define HORSE 42-42, also known as Ordinary Horse.

 15 2 2 6 2 2 2 2 6 6 2 6 4 6 4 6 6 2 6 6 6 6 2 8 2 8 2 10 2 10 2 12 2 12 2 12 4 12 4 6 4 6 2 6 1 8 2 8 0 10 2 10 1 12 2 12 0 42 42 42 43 2 2

You must be wondering "Where is that horse?" and "Is everything all right with Domagoj?" because you only see some numbers on the drawing. The first question will be answered in the next section, while the answer to the second question also interests the author of this task.

In order to understand the drawing, you need to understand Domagoj's drawing technique. The first number in the drawing is the number denoting the number of line segments that may have been drawn. Thereafter, the following lines have four numbers, , , and , which describe the line segment extending from the point to the point . In the last line of the drawing there are two numbers, and , the coordinates of point . Domagoj will draw all the line segments that contain the point and all that are directly or indirectly connected to a line segment that contains point . For two line segments and we say that they are directly connected if they have a common end point, and they are indirectly connected if there is a sequence of line segments such that the line segments and are directly connected, and are directly connected, …, and are directly connected.

Your task is to print a rectangular matrix of characters that displays Domagoj's drawing. The value of should be set to # if the point with the coordinates is part of some line segment drawn, otherwise this value should be set to .. Coordinate in the matrix rises from left to right, while coordinate rises from bottom up. Matrix should contain all points that are part of a drawn lines and should not contain any single row or column that contains only characters ., i.e. it should be minimal in size.

#### Input

In the first line of the input there is a positive integer . In the next lines there four non-negative integers and . For each line segment it will hold either or . No two line segments will intersect, but some might have common end point. All the lines will be parallel to the coordinate axes.

In the last line of the input there will be two non-negative integers and , coordinates of the point . Point will be part of at least one of the given line segments.

#### Output

Print required matrix from the task.

#### Scoring

In the test samples totally worth 30% of the points you should draw all line segments.

#### Sample Input 1

15
2 2 6 2
2 2 2 6
6 2 6 4
6 4 6 6
2 6 6 6
6 2 8 2
8 2 10 2
10 2 12 2
12 2 12 4
12 4 6 4
6 2 6 1
8 2 8 0
10 2 10 1
12 2 12 0
42 42 42 43
2 2

#### Sample Output 1

#####......
#...#......
#...#######
#...#.....#
###########
....#.#.#.#
......#...#

#### Explanation for Sample Input 1

In the first example all the line segments should be drawn except the last.

#### Sample Input 2

6
1 1 10 1
10 1 10 3
10 3 1 3
1 3 1 1
10 3 11 3
11 3 11 6
2 1

#### Sample Output 2

..........#
..........#
..........#
###########
#........#.
##########.

#### Explanation for Sample Input 2

In the second example all the line segments should be drawn to get the drawing of the name "Summarized horse".