#4901. 构造一个 𝑛∗𝑛n∗n 的矩阵
构造一个 𝑛∗𝑛n∗n 的矩阵
感谢 杨乐多,杨老师提供的题单
Not Adjacent Matrix
题面翻译
构造一个 的矩阵,使得相邻的两个格子填的数不能相邻。
输入
输入包含多组数据。第一行一个正整数 ,表示数据组数。
接下来 行,每行一个正整数,表示每组数据的 。
输出
输出这个矩阵,如无解输出。
题目描述
We will consider the numbers and as adjacent if they differ by exactly one, that is, .
We will consider cells of a square matrix as adjacent if they have a common side, that is, for cell cells , , and are adjacent to it.
For a given number , construct a square matrix such that:
- Each integer from to occurs in this matrix exactly once;
- If and are adjacent cells, then the numbers written in them must not be adjacent.
输入格式
The first line contains one integer ( ). Then test cases follow.
Each test case is characterized by one integer ( ).
输出格式
For each test case, output:
- -1, if the required matrix does not exist;
- the required matrix, otherwise (any such matrix if many of them exist).
The matrix should be outputted as lines, where each line contains integers.
样例 #1
样例输入 #1
3
1
2
3
样例输出 #1
1
-1
2 9 7
4 6 3
1 8 5
题意翻译
构造一个 n∗n 的矩阵,使得相邻的两个格子填的数不能相邻。
输入
输入包含多组数据。第一行一个正整数 𝑡t,表示数据组数。
接下来 𝑡t 行,每行一个正整数,表示每组数据的 𝑛n。
输出
输出这个矩阵,如无解输出−1−1。
输入输出样例
输入 #1复制
3
1
2
3
输出 #1复制
1
-1
2 9 7
4 6 3
1 8 5
Limitation
1s, 1024KiB for each test case.
统计
相关
在以下作业中: