codeforces-scrape

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

1336B.md (2451B)


      1 Source: https://codeforces.com/problemset/problem/1336/B
      2 
      3 B. Xenia and Colorful Gems
      4 
      5 time limit per test
      6 
      7 3 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 Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
     22 
     23 ![](https://espresso.codeforces.com/9009014b014bf166009f795617ac1eb6354bdf7a.png)
     24 
     25 Recently Xenia has bought $n_r$ red gems, $n_g$ green gems and $n_b$ blue gems. Each of the gems has a weight.
     26 
     27 Now, she is going to pick three gems.
     28 
     29 Xenia loves colorful things, so she will pick exactly one gem of each color.
     30 
     31 Xenia loves balance, so she will try to pick gems with little difference in weight.
     32 
     33 Specifically, supposing the weights of the picked gems are $x$, $y$ and $z$, Xenia wants to find the minimum value of $(x-y)^2+(y-z)^2+(z-x)^2$. As her dear friend, can you help her?
     34 
     35 Input
     36 
     37 The first line contains a single integer $t$ ($1\le t \le 100$)  — the number of test cases. Then $t$ test cases follow.
     38 
     39 The first line of each test case contains three integers $n_r,n_g,n_b$ ($1\le n_r,n_g,n_b\le 10^5$)  — the number of red gems, green gems and blue gems respectively.
     40 
     41 The second line of each test case contains $n_r$ integers $r_1,r_2,\ldots,r_{n_r}$ ($1\le r_i \le 10^9$)  — $r_i$ is the weight of the $i$-th red gem.
     42 
     43 The third line of each test case contains $n_g$ integers $g_1,g_2,\ldots,g_{n_g}$ ($1\le g_i \le 10^9$)  — $g_i$ is the weight of the $i$-th green gem.
     44 
     45 The fourth line of each test case contains $n_b$ integers $b_1,b_2,\ldots,b_{n_b}$ ($1\le b_i \le 10^9$)  — $b_i$ is the weight of the $i$-th blue gem.
     46 
     47 It is guaranteed that $\sum n_r \le 10^5$, $\sum n_g \le 10^5$, $\sum n_b \le 10^5$ (the sum for all test cases).
     48 
     49 Output
     50 
     51 For each test case, print a line contains one integer  — the minimum value which Xenia wants to find.
     52 
     53 Example
     54 
     55 Input
     56 
     57 ```
     58 5
     59 2 2 3
     60 7 8
     61 6 3
     62 3 1 4
     63 1 1 1
     64 1
     65 1
     66 1000000000
     67 2 2 2
     68 1 2
     69 5 4
     70 6 7
     71 2 2 2
     72 1 2
     73 3 4
     74 6 7
     75 3 4 1
     76 3 2 1
     77 7 3 3 4
     78 6
     79 ```
     80 
     81 Output
     82 
     83 ```
     84 14
     85 1999999996000000002
     86 24
     87 24
     88 14
     89 ```
     90 
     91 Note
     92 
     93 In the first test case, Xenia has the following gems:
     94 
     95 ![](https://espresso.codeforces.com/7e400036e7fb1bb1013d79825f1eb0157cb807e7.webp)
     96 
     97 If she picks the red gem with weight $7$, the green gem with weight $6$, and the blue gem with weight $4$, she will achieve the most balanced selection with $(x-y)^2+(y-z)^2+(z-x)^2=(7-6)^2+(6-4)^2+(4-7)^2=14$.