codeforces-scrape

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

1527C.md (2011B)


      1 Source: https://codeforces.com/problemset/problem/1527/C
      2 
      3 C. Sequence Pair Weight
      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 The weight of a sequence is defined as the number of unordered pairs of indexes $(i,j)$ (here $i \lt j$) with same value ($a_{i} = a_{j}$). For example, the weight of sequence $a = [1, 1, 2, 2, 1]$ is $4$. The set of unordered pairs of indexes with same value are $(1, 2)$, $(1, 5)$, $(2, 5)$, and $(3, 4)$.
     22 
     23 You are given a sequence $a$ of $n$ integers. Print the sum of the weight of all subsegments of $a$.
     24 
     25 A sequence $b$ is a subsegment of a sequence $a$ if $b$ can be obtained from $a$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.
     26 
     27 Input
     28 
     29 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). 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$).
     32 
     33 The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$).
     34 
     35 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.
     36 
     37 Output
     38 
     39 For each test case, print a single integer — the sum of the weight of all subsegments of $a$.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 2
     47 4
     48 1 2 1 1
     49 4
     50 1 2 3 4
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 6
     57 0
     58 ```
     59 
     60 Note
     61 
     62 * In test case $1$, all possible subsegments of sequence $[1, 2, 1, 1]$ having size more than $1$ are:
     63   1. $[1, 2]$ having $0$ valid unordered pairs;
     64   2. $[2, 1]$ having $0$ valid unordered pairs;
     65   3. $[1, 1]$ having $1$ valid unordered pair;
     66   4. $[1, 2, 1]$ having $1$ valid unordered pairs;
     67   5. $[2, 1, 1]$ having $1$ valid unordered pair;
     68   6. $[1, 2, 1, 1]$ having $3$ valid unordered pairs.Answer is $6$.
     69 * In test case $2$, all elements of the sequence are distinct. So, there is no valid unordered pair with the same value for any subarray. Answer is $0$.