codeforces-scrape

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

1462E2.md (2168B)


      1 Source: https://codeforces.com/problemset/problem/1462/E2
      2 
      3 E2. Close Tuples (hard version)
      4 
      5 time limit per test
      6 
      7 4 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 hard version of this problem. The only difference between the easy and hard versions is the constraints on $k$ and $m$. In this version of the problem, you need to output the answer by modulo $10^9+7$.
     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$ elements such that the maximum number in the tuple differs from the minimum by no more than $k$. Formally, you need to find the number of tuples of $m$ indices $i_1 \lt i_2 \lt \ldots \lt i_m$, such that
     26 
     27 $$\max(a_{i_1}, a_{i_2}, \ldots, a_{i_m}) - \min(a_{i_1}, a_{i_2}, \ldots, a_{i_m}) \le k.$$
     28 
     29 For example, if $n=4$, $m=3$, $k=2$, $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$, $m=2$, $k=1$, $a=[1,1,1,1]$, then all six possible pairs are suitable.
     30 
     31 As the result can be very large, you should print the value modulo $10^9 + 7$ (the remainder when divided by $10^9 + 7$).
     32 
     33 Input
     34 
     35 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.
     36 
     37 The first line of each test case contains three integers $n$, $m$, $k$ ($1 \le n \le 2 \cdot 10^5$, $1 \le m \le 100$, $1 \le k \le n$) — the length of the sequence $a$, number of elements in the tuples and the maximum difference of elements in the tuple.
     38 
     39 The next line contains $n$ integers $a_1, a_2,\ldots, a_n$ ($1 \le a_i \le n$) — the sequence $a$.
     40 
     41 It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$.
     42 
     43 Output
     44 
     45 Output $t$ answers to the given test cases. Each answer is the required number of tuples of $m$ elements modulo $10^9 + 7$, such that the maximum value in the tuple differs from the minimum by no more than $k$.
     46 
     47 Example
     48 
     49 Input
     50 
     51 ```
     52 4
     53 4 3 2
     54 1 2 4 3
     55 4 2 1
     56 1 1 1 1
     57 1 1 1
     58 1
     59 10 4 3
     60 5 6 1 3 2 9 8 1 2 4
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 2
     67 6
     68 1
     69 20
     70 ```