当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3550:Graph Generation

题目描述
You are design a graphics generator to create a graph called "GStar".
GStar is defined by recursive, the first level "GStar", the GStar(1), is a square like the graph below:
+-+
|.|
+-+
Then we divide every edge of the GStar(1) into three part, and draw a new square outward on the middle part. Thus we get the GStar(2), like the graph below:
....+-+....
....|.|....
..+-+.+-+..
..|.....|..
+-+.....+-+
|.........|
+-+.....+-+
..|.....|..
..+-+.+-+..
....|.|....
....+-+....
We can get GStar(n) from GStar(n-1) by split the outer bound of every edge on GStar(n-1) into three part and draw a square outward taking place the middle part.
The following graph is the GStar(3), pay attention that outer bound touches itself but the inner part are also "outer bound", so the edges are used in generation on the next level of GStar.
................+-+................
................|.|................
..............+-+.+-+..............
..............|.....|..............
............+-+.....+-+............
............|.........|............
..........+-+-+.....+-+-+..........
..........|.|.|.....|.|.|..........
........+-+.+-+.....+-+.+-+........
........|.................|........
......+-+.................+-+......
......|.....................|......
....+-+-+.................+-+-+....
....|.|.|.................|.|.|....
..+-+.+-+.................+-+.+-+..
..|.............................|..
+-+.............................+-+
|.................................|
+-+.............................+-+
..|.............................|..
..+-+.+-+.................+-+.+-+..
....|.|.|.................|.|.|....
....+-+-+.................+-+-+....
......|.....................|......
......+-+.................+-+......
........|.................|........
........+-+.+-+.....+-+.+-+........
..........|.|.|.....|.|.|..........
..........+-+-+.....+-+-+..........
............|.........|............
............+-+.....+-+............
..............|.....|..............
..............+-+.+-+..............
................|.|................
................+-+................

输入解释
The input contains several test cases, the first line of test case contains an integer denoting the number of test cases.
For each test cases, there are only three integers K, X, Y. Where K denoting the level of GStar. And you are to output a part of the graph from (X,Y) to (X+9,Y+9), a 10*10 matrix. Where the top-left corner is define as (0,0) and the Y-th character of X-th line is define as (X-1,Y-1). Notice that the empty cell are filled with ".". (1 <= K <= 10, 0 <= X, Y <= 30000)
输出解释
For each test cases, output the character matrix. See example for further details.
输入样例
3
1 1 1
2 1 1
5 88 72
输出样例
Case 1:
.|........
-+........
..........
..........
..........
..........
..........
..........
..........
..........
Case 2:
...|.|....
.+-+.+-+..
.|.....|..
-+.....+-+
.........|
-+.....+-+
.|.....|..
.+-+.+-+..
...|.|....
...+-+....
Case 3:
+-+.......
|.........
+-+.......
|.|.......
+-+-+.+-+.
..|.|.|.|.
..+-+-+-+.
....|.|...
..+-+-+-+.
..|.|.|.|.
来自杭电HDUOJ的附加信息
Author HyperHexagon
Recommend zhengfeng

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3550

最后修改于 2020-10-25T23:04:39+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/2000MS(Java/Others) 65535/32768K(Java/Others)