codeforces-scrape

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

1265B.md (2679B)


      1 Source: https://codeforces.com/problemset/problem/1265/B
      2 
      3 B. Beautiful Numbers
      4 
      5 time limit per test
      6 
      7 1 second
      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 You are given a permutation $p=[p_1, p_2, \ldots, p_n]$ of integers from $1$ to $n$. Let's call the number $m$ ($1 \le m \le n$) beautiful, if there exists two indices $l, r$ ($1 \le l \le r \le n$), such that the numbers $[p_l, p_{l+1}, \ldots, p_r]$ is a permutation of numbers $1, 2, \ldots, m$.
     22 
     23 For example, let $p = [4, 5, 1, 3, 2, 6]$. In this case, the numbers $1, 3, 5, 6$ are beautiful and $2, 4$ are not. It is because:
     24 
     25 * if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;
     26 * if $l = 3$ and $r = 5$ we will have a permutation $[1, 3, 2]$ for $m = 3$;
     27 * if $l = 1$ and $r = 5$ we will have a permutation $[4, 5, 1, 3, 2]$ for $m = 5$;
     28 * if $l = 1$ and $r = 6$ we will have a permutation $[4, 5, 1, 3, 2, 6]$ for $m = 6$;
     29 * it is impossible to take some $l$ and $r$, such that $[p_l, p_{l+1}, \ldots, p_r]$ is a permutation of numbers $1, 2, \ldots, m$ for $m = 2$ and for $m = 4$.
     30 
     31 You are given a permutation $p=[p_1, p_2, \ldots, p_n]$. For all $m$ ($1 \le m \le n$) determine if it is a beautiful number or not.
     32 
     33 Input
     34 
     35 The first line contains the only integer $t$ ($1 \le t \le 1000$)  — the number of test cases in the input. The next lines contain the description of test cases.
     36 
     37 The first line of a test case contains a number $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of the given permutation $p$. The next line contains $n$ integers $p_1, p_2, \ldots, p_n$ ($1 \le p_i \le n$, all $p_i$ are different) — the given permutation $p$.
     38 
     39 It is guaranteed, that the sum of $n$ from all test cases in the input doesn't exceed $2 \cdot 10^5$.
     40 
     41 Output
     42 
     43 Print $t$ lines — the answers to test cases in the order they are given in the input.
     44 
     45 The answer to a test case is the string of length $n$, there the $i$-th character is equal to $1$ if $i$ is a beautiful number and is equal to $0$ if $i$ is not a beautiful number.
     46 
     47 Example
     48 
     49 Input
     50 
     51 ```
     52 3
     53 6
     54 4 5 1 3 2 6
     55 5
     56 5 3 1 2 4
     57 4
     58 1 4 3 2
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 101011
     65 11111
     66 1001
     67 ```
     68 
     69 Note
     70 
     71 The first test case is described in the problem statement.
     72 
     73 In the second test case all numbers from $1$ to $5$ are beautiful:
     74 
     75 * if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;
     76 * if $l = 3$ and $r = 4$ we will have a permutation $[1, 2]$ for $m = 2$;
     77 * if $l = 2$ and $r = 4$ we will have a permutation $[3, 1, 2]$ for $m = 3$;
     78 * if $l = 2$ and $r = 5$ we will have a permutation $[3, 1, 2, 4]$ for $m = 4$;
     79 * if $l = 1$ and $r = 5$ we will have a permutation $[5, 3, 1, 2, 4]$ for $m = 5$.