codeforces-scrape

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

1084A.md (2511B)


      1 Source: https://codeforces.com/problemset/problem/1084/A
      2 
      3 A. The Fair Nut and Elevator
      4 
      5 time limit per test
      6 
      7 1 second
      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 Fair Nut lives in $n$ story house. $a_i$ people live on the $i$-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor where he/she lives, when he/she comes back home in the evening.
     22 
     23 It was decided that elevator, when it is not used, will stay on the $x$-th floor, but $x$ hasn't been chosen yet. When a person needs to get from floor $a$ to floor $b$, elevator follows the simple algorithm:
     24 
     25 * Moves from the $x$-th floor (initially it stays on the $x$-th floor) to the $a$-th and takes the passenger.
     26 * Moves from the $a$-th floor to the $b$-th floor and lets out the passenger (if $a$ equals $b$, elevator just opens and closes the doors, but still comes to the floor from the $x$-th floor).
     27 * Moves from the $b$-th floor back to the $x$-th.
     28 
     29 The elevator never transposes more than one person and always goes back to the floor $x$ before transposing a next passenger. The elevator spends one unit of electricity to move between neighboring floors. So moving from the $a$-th floor to the $b$-th floor requires $|a - b|$ units of electricity.
     30 
     31 Your task is to help Nut to find the minimum number of electricity units, that it would be enough for one day, by choosing an optimal the $x$-th floor. Don't forget than elevator initially stays on the $x$-th floor.
     32 
     33 Input
     34 
     35 The first line contains one integer $n$ ($1 \leq n \leq 100$) — the number of floors.
     36 
     37 The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \leq a_i \leq 100$) — the number of people on each floor.
     38 
     39 Output
     40 
     41 In a single line, print the answer to the problem — the minimum number of electricity units.
     42 
     43 Examples
     44 
     45 Input
     46 
     47 ```
     48 3  
     49 0 2 1
     50 ```
     51 
     52 Output
     53 
     54 ```
     55 16
     56 ```
     57 
     58 Input
     59 
     60 ```
     61 2  
     62 1 1
     63 ```
     64 
     65 Output
     66 
     67 ```
     68 4
     69 ```
     70 
     71 Note
     72 
     73 In the first example, the answer can be achieved by choosing the second floor as the $x$-th floor. Each person from the second floor (there are two of them) would spend $4$ units of electricity per day ($2$ to get down and $2$ to get up), and one person from the third would spend $8$ units of electricity per day ($4$ to get down and $4$ to get up). $4 \cdot 2 + 8 \cdot 1 = 16$.
     74 
     75 In the second example, the answer can be achieved by choosing the first floor as the $x$-th floor.