codeforces-scrape

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

1478C.md (1876B)


      1 Source: https://codeforces.com/problemset/problem/1478/C
      2 
      3 C. Nezzar and Symmetric Array
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Long time ago there was a symmetric array $a_1,a_2,\ldots,a_{2n}$ consisting of $2n$ distinct integers. Array $a_1,a_2,\ldots,a_{2n}$ is called symmetric if for each integer $1 \le i \le 2n$, there exists an integer $1 \le j \le 2n$ such that $a_i = -a_j$.
     22 
     23 For each integer $1 \le i \le 2n$, Nezzar wrote down an integer $d_i$ equal to the sum of absolute differences from $a_i$ to all integers in $a$, i. e. $d_i = \sum_{j = 1}^{2n} {|a_i - a_j|}$.
     24 
     25 Now a million years has passed and Nezzar can barely remember the array $d$ and totally forget $a$. Nezzar wonders if there exists any symmetric array $a$ consisting of $2n$ distinct integers that generates the array $d$.
     26 
     27 Input
     28 
     29 The first line contains a single integer $t$ ($1 \le t \le 10^5$) — the number of test cases.
     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 $2n$ integers $d_1, d_2, \ldots, d_{2n}$ ($0 \le d_i \le 10^{12}$).
     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 "YES" in a single line if there exists a possible array $a$. Otherwise, print "NO".
     40 
     41 You can print letters in any case (upper or lower).
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 6
     49 2
     50 8 12 8 12
     51 2
     52 7 7 9 11
     53 2
     54 7 11 7 11
     55 1
     56 1 1
     57 4
     58 40 56 48 40 80 56 80 48
     59 6
     60 240 154 210 162 174 154 186 240 174 186 162 210
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 YES
     67 NO
     68 NO
     69 NO
     70 NO
     71 YES
     72 ```
     73 
     74 Note
     75 
     76 In the first test case, $a=[1,-3,-1,3]$ is one possible symmetric array that generates the array $d=[8,12,8,12]$.
     77 
     78 In the second test case, it can be shown that there is no symmetric array consisting of distinct integers that can generate array $d$.