1042C.md (3601B)
1 Source: https://codeforces.com/problemset/problem/1042/C 2 3 C. Array Product 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 an array $a$ consisting of $n$ integers. You can perform the following operations with it: 22 23 1. Choose some positions $i$ and $j$ ($1 \le i, j \le n, i \ne j$), write the value of $a_i \cdot a_j$ into the $j$-th cell and remove the number from the $i$-th cell; 24 2. Choose some position $i$ and remove the number from the $i$-th cell (this operation can be performed no more than once and at any point of time, not necessarily in the beginning). 25 26 The number of elements decreases by one after each operation. However, the indexing of positions stays the same. Deleted numbers can't be used in the later operations. 27 28 Your task is to perform exactly $n - 1$ operations with the array in such a way that the only number that remains in the array is maximum possible. This number can be rather large, so instead of printing it you need to print any sequence of operations which leads to this maximum number. Read the output format to understand what exactly you need to print. 29 30 Input 31 32 The first line contains a single integer $n$ ($2 \le n \le 2 \cdot 10^5$) — the number of elements in the array. 33 34 The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($-10^9 \le a_i \le 10^9$) — the elements of the array. 35 36 Output 37 38 Print $n - 1$ lines. The $k$-th line should contain one of the two possible operations. 39 40 The operation of the first type should look like this: $1~ i_k~ j_k$, where $1$ is the type of operation, $i_k$ and $j_k$ are the positions of the chosen elements. 41 42 The operation of the second type should look like this: $2~ i_k$, where $2$ is the type of operation, $i_k$ is the position of the chosen element. Note that there should be no more than one such operation. 43 44 If there are multiple possible sequences of operations leading to the maximum number — print any of them. 45 46 Examples 47 48 Input 49 50 ``` 51 5 52 5 -2 0 1 -3 53 ``` 54 55 Output 56 57 ``` 58 2 3 59 1 1 2 60 1 2 4 61 1 4 5 62 ``` 63 64 Input 65 66 ``` 67 5 68 5 2 0 4 0 69 ``` 70 71 Output 72 73 ``` 74 1 3 5 75 2 5 76 1 1 2 77 1 2 4 78 ``` 79 80 Input 81 82 ``` 83 2 84 2 -1 85 ``` 86 87 Output 88 89 ``` 90 2 2 91 ``` 92 93 Input 94 95 ``` 96 4 97 0 -10 0 0 98 ``` 99 100 Output 101 102 ``` 103 1 1 2 104 1 2 3 105 1 3 4 106 ``` 107 108 Input 109 110 ``` 111 4 112 0 0 0 0 113 ``` 114 115 Output 116 117 ``` 118 1 1 2 119 1 2 3 120 1 3 4 121 ``` 122 123 Note 124 125 Let X be the removed number in the array. Let's take a look at all the examples: 126 127 The first example has, for example, the following sequence of transformations of the array: $[5, -2, 0, 1, -3] \to [5, -2, X, 1, -3] \to [X, -10, X, 1, -3] \to$ $[X, X, X, -10, -3] \to [X, X, X, X, 30]$. Thus, the maximum answer is $30$. Note, that other sequences that lead to the answer $30$ are also correct. 128 129 The second example has, for example, the following sequence of transformations of the array: $[5, 2, 0, 4, 0] \to [5, 2, X, 4, 0] \to [5, 2, X, 4, X] \to [X, 10, X, 4, X] \to$ $[X, X, X, 40, X]$. The following answer is also allowed: 130 131 ``` 132 1 5 3 133 1 4 2 134 1 2 1 135 2 3 136 ``` 137 138 Then the sequence of transformations of the array will look like this: $[5, 2, 0, 4, 0] \to [5, 2, 0, 4, X] \to [5, 8, 0, X, X] \to [40, X, 0, X, X] \to$ $[40, X, X, X, X]$. 139 140 The third example can have the following sequence of transformations of the array: $[2, -1] \to [2, X]$. 141 142 The fourth example can have the following sequence of transformations of the array: $[0, -10, 0, 0] \to [X, 0, 0, 0] \to [X, X, 0, 0] \to [X, X, X, 0]$. 143 144 The fifth example can have the following sequence of transformations of the array: $[0, 0, 0, 0] \to [X, 0, 0, 0] \to [X, X, 0, 0] \to [X, X, X, 0]$.