codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1904D1.md (2250B)


      1 Source: https://codeforces.com/problemset/problem/1904/D1
      2 
      3 D1. Set To Max (Easy Version)
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 This is the easy version of the problem. The only differences between the two versions of this problem are the constraints on $n$ and the time limit. You can make hacks only if all versions of the problem are solved.
     22 
     23 You are given two arrays $a$ and $b$ of length $n$.
     24 
     25 You can perform the following operation some (possibly zero) times:
     26 
     27 1. choose $l$ and $r$ such that $1 \leq l \leq r \leq n$.
     28 2. let $x=\max(a_l,a_{l+1},\ldots,a_r)$.
     29 3. for all $l \leq i \leq r$, set $a_i := x$.
     30 
     31 Determine if you can make array $a$ equal to array $b$.
     32 
     33 Input
     34 
     35 Each test contains multiple test cases. The first line contains an integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases. The description of the test cases follows.
     36 
     37 The first line of each test case contains a single integer $n$ ($1 \le n \le 1000$) — the length of the arrays.
     38 
     39 The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le n$) — the elements of array $a$.
     40 
     41 The third line contains $n$ integers $b_1, b_2, \ldots, b_n$ ($1 \le b_i \le n$) — the elements of array $b$.
     42 
     43 It is guaranteed that the sum of $n^2$ over all test cases does not exceed $10^6$.
     44 
     45 Output
     46 
     47 For each test case, output "YES" (without quotes) if you can make $a$ into $b$ using any number of operations, and "NO" (without quotes) otherwise.
     48 
     49 You can output "YES" and "NO" in any case (for example, strings "yES", "yes" and "Yes" will be recognized as a positive response).
     50 
     51 Example
     52 
     53 Input
     54 
     55 ```
     56 5
     57 
     58 5
     59 
     60 1 2 3 2 4
     61 
     62 1 3 3 2 4
     63 
     64 5
     65 
     66 3 4 2 2 4
     67 
     68 3 4 3 4 4
     69 
     70 5
     71 
     72 3 2 1 1 1
     73 
     74 3 3 3 2 2
     75 
     76 2
     77 
     78 1 1
     79 
     80 1 2
     81 
     82 3
     83 
     84 1 1 2
     85 
     86 2 1 2
     87 ```
     88 
     89 Output
     90 
     91 ```
     92 YES
     93 NO
     94 YES
     95 NO
     96 NO
     97 ```
     98 
     99 Note
    100 
    101 In the first test case, we can achieve array $b$ by applying a single operation: $(l,r)=(2,3)$.
    102 
    103 In the second test case, it can be shown we cannot achieve array $b$ in any amount of operations.
    104 
    105 In the third test case, we can achieve array $b$ by applying two operations: $(l,r)=(2,5)$. followed by $(l,r)=(1,3)$.
    106 
    107 In the fourth and fifth test cases, it can be shown we cannot achieve array $b$ in any amount of operations.