1144C.md (3281B)
1 Source: https://codeforces.com/problemset/problem/1144/C 2 3 C. Two Shuffled Sequences 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 Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing. 22 23 Strictly increasing sequence is a sequence of integers $[x_1 \lt x_2 \lt \dots \lt x_k]$. And strictly decreasing sequence is a sequence of integers $[y_1 \gt y_2 \gt \dots \gt y_l]$. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing. 24 25 They were merged into one sequence $a$. After that sequence $a$ got shuffled. For example, some of the possible resulting sequences $a$ for an increasing sequence $[1, 3, 4]$ and a decreasing sequence $[10, 4, 2]$ are sequences $[1, 2, 3, 4, 4, 10]$ or $[4, 2, 1, 10, 4, 3]$. 26 27 This shuffled sequence $a$ is given in the input. 28 29 Your task is to find any two suitable initial sequences. One of them should be strictly increasing and the other one — strictly decreasing. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing. 30 31 If there is a contradiction in the input and it is impossible to split the given sequence $a$ to increasing and decreasing sequences, print "NO". 32 33 Input 34 35 The first line of the input contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of elements in $a$. 36 37 The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 2 \cdot 10^5$), where $a_i$ is the $i$-th element of $a$. 38 39 Output 40 41 If there is a contradiction in the input and it is impossible to split the given sequence $a$ to increasing and decreasing sequences, print "NO" in the first line. 42 43 Otherwise print "YES" in the first line and any two suitable sequences. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing. 44 45 In the second line print $n_i$ — the number of elements in the strictly increasing sequence. $n_i$ can be zero, in this case the increasing sequence is empty. 46 47 In the third line print $n_i$ integers $inc_1, inc_2, \dots, inc_{n_i}$ in the increasing order of its values ($inc_1 \lt inc_2 \lt \dots \lt inc_{n_i}$) — the strictly increasing sequence itself. You can keep this line empty if $n_i = 0$ (or just print the empty line). 48 49 In the fourth line print $n_d$ — the number of elements in the strictly decreasing sequence. $n_d$ can be zero, in this case the decreasing sequence is empty. 50 51 In the fifth line print $n_d$ integers $dec_1, dec_2, \dots, dec_{n_d}$ in the decreasing order of its values ($dec_1 \gt dec_2 \gt \dots \gt dec_{n_d}$) — the strictly decreasing sequence itself. You can keep this line empty if $n_d = 0$ (or just print the empty line). 52 53 $n_i + n_d$ should be equal to $n$ and the union of printed sequences should be a permutation of the given sequence (in case of "YES" answer). 54 55 Examples 56 57 Input 58 59 ``` 60 7 61 7 2 7 3 3 1 4 62 ``` 63 64 Output 65 66 ``` 67 YES 68 2 69 3 7 70 5 71 7 4 3 2 1 72 ``` 73 74 Input 75 76 ``` 77 5 78 4 3 1 5 3 79 ``` 80 81 Output 82 83 ``` 84 YES 85 1 86 3 87 4 88 5 4 3 1 89 ``` 90 91 Input 92 93 ``` 94 5 95 1 1 2 1 2 96 ``` 97 98 Output 99 100 ``` 101 NO 102 ``` 103 104 Input 105 106 ``` 107 5 108 0 1 2 3 4 109 ``` 110 111 Output 112 113 ``` 114 YES 115 0 116 117 5 118 4 3 2 1 0 119 ```