codeforces-scrape

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

1027C.md (2707B)


      1 Source: https://codeforces.com/problemset/problem/1027/C
      2 
      3 C. Minimum Value Rectangle
      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 You have $n$ sticks of the given lengths.
     22 
     23 Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be chosen multiple times. It is guaranteed that it is always possible to choose such sticks.
     24 
     25 Let $S$ be the area of the rectangle and $P$ be the perimeter of the rectangle.
     26 
     27 The chosen rectangle should have the value $\frac{P^2}{S}$ minimal possible. The value is taken without any rounding.
     28 
     29 If there are multiple answers, print any of them.
     30 
     31 Each testcase contains several lists of sticks, for each of them you are required to solve the problem separately.
     32 
     33 Input
     34 
     35 The first line contains a single integer $T$ ($T \ge 1$) — the number of lists of sticks in the testcase.
     36 
     37 Then $2T$ lines follow — lines $(2i - 1)$ and $2i$ of them describe the $i$-th list. The first line of the pair contains a single integer $n$ ($4 \le n \le 10^6$) — the number of sticks in the $i$-th list. The second line of the pair contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_j \le 10^4$) — lengths of the sticks in the $i$-th list.
     38 
     39 It is guaranteed that for each list there exists a way to choose four sticks so that they form a rectangle.
     40 
     41 The total number of sticks in all $T$ lists doesn't exceed $10^6$ in each testcase.
     42 
     43 Output
     44 
     45 Print $T$ lines. The $i$-th line should contain the answer to the $i$-th list of the input. That is the lengths of the four sticks you choose from the $i$-th list, so that they form a rectangle and the value $\frac{P^2}{S}$ of this rectangle is minimal possible. You can print these four lengths in arbitrary order.
     46 
     47 If there are multiple answers, print any of them.
     48 
     49 Example
     50 
     51 Input
     52 
     53 ```
     54 3  
     55 4  
     56 7 2 2 7  
     57 8  
     58 2 8 1 4 8 2 1 5  
     59 5  
     60 5 5 5 5 5
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 2 7 7 2  
     67 2 2 1 1  
     68 5 5 5 5
     69 ```
     70 
     71 Note
     72 
     73 There is only one way to choose four sticks in the first list, they form a rectangle with sides $2$ and $7$, its area is $2 \cdot 7 = 14$, perimeter is $2(2 + 7) = 18$. $\frac{18^2}{14} \approx 23.143$.
     74 
     75 The second list contains subsets of four sticks that can form rectangles with sides $(1, 2)$, $(2, 8)$ and $(1, 8)$. Their values are $\frac{6^2}{2} = 18$, $\frac{20^2}{16} = 25$ and $\frac{18^2}{8} = 40.5$, respectively. The minimal one of them is the rectangle $(1, 2)$.
     76 
     77 You can choose any four of the $5$ given sticks from the third list, they will form a square with side $5$, which is still a rectangle with sides $(5, 5)$.