| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 2048 MB | 64 | 37 | 34 | 57.627% |
Bessie is learning to code using a simple programming language. She first defines a valid program, then executes it to produce some output sequence.
Defining:
Executing:
An example of a program that Bessie knows how to write is as follows.
REP 3 PRINT 1 REP 2 PRINT 2 END END
The program outputs the sequence $[1,2,2,1,2,2,1,2,2]$.
Bessie wants to output a sequence of $N$ (1ドル \le N \le 100$) positive integers. Elsie challenges her to use no more than $K$ (1ドル \le K \le 3$) "PRINT" statements. Note that Bessie can use as many "REP" statements as she wants. Also note that each positive integer in the sequence is no greater than $K$.
For each of $T$ (1ドル \le T \le 100$) independent test cases, determine whether Bessie can write a program that outputs some given sequence using at most $K$ "PRINT" statements.
The first line contains $T$.
The first line of each test case contains two space-separated integers, $N$ and $K$.
The second line of each test case contains a sequence of $N$ space-separated positive integers, each at most $K,ドル which is the sequence that Bessie wants to produce.
For each test case, output "YES" or "NO" (case sensitive) on a separate line.
2 1 1 1 4 1 1 1 1 1
YES YES
For the second test case, the following code outputs the sequence $[1,1,1,1]$ with 1ドル$ "PRINT" statement.
REP 4 PRINT 1 END
11 4 2 1 2 2 2 4 2 1 1 2 1 4 2 1 1 2 2 6 2 1 1 2 2 1 1 10 2 1 1 1 2 2 1 1 1 2 2 8 3 3 3 1 2 2 1 2 2 9 3 1 1 2 2 2 3 3 3 3 16 3 2 2 3 2 2 3 1 1 2 2 3 2 2 3 1 1 24 3 1 1 2 2 3 3 3 2 2 3 3 3 1 1 2 2 3 3 3 2 2 3 3 3 9 3 1 2 2 1 3 3 1 2 2 6 3 1 2 1 2 2 3
YES NO YES NO YES YES YES YES YES NO NO
For the first test case, the following code outputs the sequence $[1,2,2,2]$ with 2ドル$ "PRINT" statements.
PRINT 1 REP 3 PRINT 2 END
For the second test case, the answer is "NO" because it is impossible to output the sequence $[1,1,2,1]$ using at most 2ドル$ "PRINT" statements.
For the sixth test case, the following code outputs the sequence $[3,3,1,2,2,1,2,2]$ with 3ドル$ "PRINT" statements.
REP 2 PRINT 3 END REP 2 PRINT 1 REP 2 PRINT 2 END END