codeforces-scrape

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

1821B.md (1964B)


      1 Source: https://codeforces.com/problemset/problem/1821/B
      2 
      3 B. Sort the Subarray
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Monocarp had an array $a$ consisting of $n$ integers. He has decided to choose two integers $l$ and $r$ such that $1 \le l \le r \le n$, and then sort the subarray $a[l..r]$ (the subarray $a[l..r]$ is the part of the array $a$ containing the elements $a_l, a_{l+1}, a_{l+2}, \dots, a_{r-1}, a_r$) in non-descending order. After sorting the subarray, Monocarp has obtained a new array, which we denote as $a'$.
     22 
     23 For example, if $a = [6, 7, 3, 4, 4, 6, 5]$, and Monocarp has chosen $l = 2, r = 5$, then $a' = [6, 3, 4, 4, 7, 6, 5]$.
     24 
     25 You are given the arrays $a$ and $a'$. Find the integers $l$ and $r$ that Monocarp could have chosen. If there are multiple pairs of values $(l, r)$, find the one which corresponds to the longest subarray.
     26 
     27 Input
     28 
     29 The first line contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases.
     30 
     31 Each test case consists of three lines:
     32 
     33 * the first line contains one integer $n$ ($2 \le n \le 2 \cdot 10^5$);
     34 * the second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$);
     35 * the third line contains $n$ integers $a'_1, a'_2, \dots, a'_n$ ($1 \le a'_i \le n$).
     36 
     37 Additional constraints on the input:
     38 
     39 * the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$;
     40 * it is possible to obtain the array $a'$ by sorting one subarray of $a$;
     41 * $a' \ne a$ (there exists at least one position in which these two arrays are different).
     42 
     43 Output
     44 
     45 For each test case, print two integers — the values of $l$ and $r$ ($1 \le l \le r \le n$). If there are multiple answers, print the values that correspond to the longest subarray. If there are still multiple answers, print any of them.
     46 
     47 Example
     48 
     49 Input
     50 
     51 ```
     52 3
     53 
     54 7
     55 
     56 6 7 3 4 4 6 5
     57 
     58 6 3 4 4 7 6 5
     59 
     60 3
     61 
     62 1 2 1
     63 
     64 1 1 2
     65 
     66 3
     67 
     68 2 2 1
     69 
     70 2 1 2
     71 ```
     72 
     73 Output
     74 
     75 ```
     76 2 5
     77 1 3
     78 2 3
     79 ```