CF1360G.A/B Matrix

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given four positive integers nn , mm , aa , bb ( 1bn501 \le b \le n \le 50 ; 1am501 \le a \le m \le 50 ). Find any such rectangular matrix of size n×mn \times m that satisfies all of the following conditions:

  • each row of the matrix contains exactly aa ones;
  • each column of the matrix contains exactly bb ones;
  • all other elements are zeros.

If the desired matrix does not exist, indicate this.

For example, for n=3n=3 , m=6m=6 , a=2a=2 , b=1b=1 , there exists a matrix satisfying the conditions above:

$$ \begin{vmatrix} 0 & 1 & 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 0 \end{vmatrix} $$

输入格式

The first line contains an integer tt ( 1t10001 \le t \le 1000 ) — the number of test cases. Then tt test cases follow.

Each test case is described by four positive integers nn , mm , aa , bb ( 1bn501 \le b \le n \le 50 ; 1am501 \le a \le m \le 50 ), where nn and mm are the sizes of the matrix, and aa and bb are the number of ones for rows and columns, respectively.

输出格式

For each test case print:

  • "YES" (without quotes) and the required matrix (if there are several answers, print any) if it exists, or
  • "NO" (without quotes) if it does not exist.

To print the matrix n×mn \times m , print nn rows, each of which consists of mm numbers 00 or 11 describing a row of the matrix. Numbers must be printed without spaces.

输入输出样例

  • 输入#1

    5
    3 6 2 1
    2 2 2 1
    2 2 2 2
    4 4 2 2
    2 1 1 2

    输出#1

    YES
    010001
    100100
    001010
    NO
    YES
    11
    11
    YES
    1100
    1100
    0011
    0011
    YES
    1
    1
首页