| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 37 | 22 | 21 | 65.625% |
Little Maja has always loved puzzles. And since everyone knew that for a long time now, it is no wonder that one sunny day, Maja received an odd puzzle as a gift..
This puzzle has $n$ pieces. Each piece has rectangular shape and is of a certain color. Also, each piece has 2ドル$ numbers written on its back: $u$ and $d$. After a period of skillfully combining pieces and trying to fit them together, Maja figured out the meaning of those numbers.
She found out that number $u$ represents "direction", in other words, does the next piece of the puzzle connect with the current one from the upper or from the right side of the current piece. Number $d$ specifies the starting column/row where we connect the next piece of the puzzle with current one. In more detail:
Let’s demonstrate this for pieces colored in colors "a" and "b". Picture 1 shows the case where $u = 0,ドル and $d = 3$. Picture 2 shows case when $u = 1$ and $d = 3$. (In both cases, numbers $u$ and $d$ represent numbers written on the back of piece colored "a").
. . b b b b b . . b b b b b a a a a . . . a a a a . . . a a a a . . .
a a a a . . . . . a a a a b b b b b a a a a b b b b b
Maja has grown tired of this puzzling puzzle, but her curiosity knows no bounds! That’s why she’s asking for your help. She’s interested in knowing, for a given description of every piece of the puzzle and the sequence of their placement, what will the completed puzzle look like? Write a program that prints the dimensions (height and width) of the completed puzzle, as well as its final appearance within a rectangle of the same height and width, where "." represents places where there is no part of the puzzle.
In first row, there is $n$ (1ドル ≤ n ≤ 20$), number of puzzle pieces.
In the $i$-th of next $n$ rows there are per 1ドル$ character and 4ドル$ integers, in order: $b_i,ドル $r_i,ドル $s_i,ドル $u_i,ドル $d_i$ - description of $i$-th piece:
In the last row of input there are $n$ integers, order in which pieces are connected, where number $i$ (1ドル ≤ i ≤ n$) represents $i$-th puzzle piece in input. Each puzzle piece will appear in the sequence exactly once.
Print the height and width of the completed puzzle. After that, print the appearance of the puzzle within a rectangle of the same height and width. In the places within the rectangle where there is no part of the puzzle, print ".".
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 17 | The order of connecting the puzzle pieces will be identical to the order of inputting them. |
| 2 | 12 | For each puzzle piece: $u = 0$. |
| 3 | 12 | For each puzzle piece: $u = 1$. |
| 4 | 9 | No additional constraints. |
2 a 3 4 0 3 b 2 5 1 1 1 2
5 7 ..bbbbb ..bbbbb aaaa... aaaa... aaaa...
2 a 3 4 0 3 b 2 5 1 1 2 1
4 9 .....aaaa .....aaaa bbbbbaaaa bbbbb....
4 g 9 5 0 2 a 3 2 1 1 c 5 10 0 2 p 8 7 1 6 4 3 2 1
18 17 ..........ggggg.. ..........ggggg.. ..........ggggg.. ..........ggggg.. ..........ggggg.. ..........ggggg.. ..........ggggg.. ..........ggggg.. ........aaggggg.. ........aa....... ppppppp.aa....... pppppppcccccccccc pppppppcccccccccc pppppppcccccccccc pppppppcccccccccc pppppppcccccccccc ppppppp.......... ppppppp..........