how many numbers i (1≤i≤k) you have. An n×n matrix is called beautiful if it contains all the numbers you have, and for each 2×2 submatrix of the original matrix is satisfied: The number of occupied cells doesn't exceed 3; The numbers on each diagonal are distinct.
Correct answer only else downvoted.
Let
An n×n matrix is called beautiful if it contains all the numbers you have, and for each 2×2 submatrix of the original matrix is satisfied:
The number of occupied cells doesn't exceed 3;
The numbers on each diagonal are distinct.
Make a beautiful matrix of minimum size.
Input
The first line contains a single integer t (1≤t≤10000) — the number of test cases.
The first line of each test case contains 2 integers m and k (1≤m,k≤105) — how many numbers Nastia gave you and the length of the array a, respectively.
The second line of each test case contains k integers a1,a2,…,ak (0≤ai≤m, a1+a2+…+ak=m), where ai is how many numbers i you have.
It's guaranteed that the sum of m and k in one test doesn't exceed 2⋅105.
Output
For each t test case print a single integer n — the size of the beautiful matrix.
In the next n lines print n integers bi,j (0≤bi,j≤k; if position is empty, print bi,j=0) — the beautiful matrix b you made up.
Step by step
Solved in 4 steps with 1 images
