1462E1.md (1988B)
1 Source: https://codeforces.com/problemset/problem/1462/E1 2 3 E1. Close Tuples (easy version) 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 This is the easy version of this problem. The only difference between easy and hard versions is the constraints on $k$ and $m$ (in this version $k=2$ and $m=3$). Also, in this version of the problem, you DON'T NEED to output the answer by modulo. 22 23 You are given a sequence $a$ of length $n$ consisting of integers from $1$ to $n$. The sequence may contain duplicates (i.e. some elements can be equal). 24 25 Find the number of tuples of $m = 3$ elements such that the maximum number in the tuple differs from the minimum by no more than $k = 2$. Formally, you need to find the number of triples of indices $i \lt j \lt z$ such that 26 27 $$\max(a_i, a_j, a_z) - \min(a_i, a_j, a_z) \le 2.$$ 28 29 For example, if $n=4$ and $a=[1,2,4,3]$, then there are two such triples ($i=1, j=2, z=4$ and $i=2, j=3, z=4$). If $n=4$ and $a=[1,1,1,1]$, then all four possible triples are suitable. 30 31 Input 32 33 The first line contains a single integer $t$ ($1 \le t \le 2 \cdot 10^5$) — the number of test cases. Then $t$ test cases follow. 34 35 The first line of each test case contains an integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of the sequence $a$. 36 37 The next line contains $n$ integers $a_1, a_2,\ldots, a_n$ ($1 \le a_i \le n$) — the sequence $a$. 38 39 It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$. 40 41 Output 42 43 Output $t$ answers to the given test cases. Each answer is the required number of triples of elements, such that the maximum value in the triple differs from the minimum by no more than $2$. Note that in difference to the hard version of the problem, you don't need to output the answer by modulo. You must output the exact value of the answer. 44 45 Example 46 47 Input 48 49 ``` 50 4 51 4 52 1 2 4 3 53 4 54 1 1 1 1 55 1 56 1 57 10 58 5 6 1 3 2 9 8 1 2 4 59 ``` 60 61 Output 62 63 ``` 64 2 65 4 66 0 67 15 68 ```