codeforces-scrape

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

1638C.md (1985B)


      1 Source: https://codeforces.com/problemset/problem/1638/C
      2 
      3 C. Inversion Graph
      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_1, p_2, \dots, p_n$. Then, an undirected graph is constructed in the following way: add an edge between vertices $i$, $j$ such that $i \lt j$ if and only if $p_i \gt p_j$. Your task is to count the number of connected components in this graph.
     22 
     23 Two vertices $u$ and $v$ belong to the same connected component if and only if there is at least one path along edges connecting $u$ and $v$.
     24 
     25 A permutation is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ($2$ appears twice in the array) and $[1,3,4]$ is also not a permutation ($n=3$ but there is $4$ in the array).
     26 
     27 Input
     28 
     29 Each test contains multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 10^5$) — the number of test cases. Description of the test cases follows.
     30 
     31 The first line of each test case contains a single integer $n$ ($1 \le n \le 10^5$) — the length of the permutation.
     32 
     33 The second line of each test case contains $n$ integers $p_1, p_2, \dots, p_n$ ($1 \le p_i \le n$) — the elements of the permutation.
     34 
     35 It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.
     36 
     37 Output
     38 
     39 For each test case, print one integer $k$ — the number of connected components.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 6
     47 
     48 3
     49 
     50 1 2 3
     51 
     52 5
     53 
     54 2 1 4 3 5
     55 
     56 6
     57 
     58 6 1 4 2 5 3
     59 
     60 1
     61 
     62 1
     63 
     64 6
     65 
     66 3 2 1 6 5 4
     67 
     68 5
     69 
     70 3 1 5 2 4
     71 ```
     72 
     73 Output
     74 
     75 ```
     76 3
     77 3
     78 1
     79 1
     80 2
     81 1
     82 ```
     83 
     84 Note
     85 
     86 Each separate test case is depicted in the image below. The colored squares represent the elements of the permutation. For one permutation, each color represents some connected component. The number of distinct colors is the answer.
     87 
     88  ![](https://espresso.codeforces.com/87ac21177bbc2f5771daa5e84f56e114fc1bfe45.png)