codeforces-scrape

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

915B.md (2310B)


      1 Source: https://codeforces.com/problemset/problem/915/B
      2 
      3 B. Browser
      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 Luba is surfing the Internet. She currently has *n* opened tabs in her browser, indexed from 1 to *n* from left to right. The mouse cursor is currently located at the *pos*-th tab. Luba needs to use the tabs with indices from *l* to *r* (inclusive) for her studies, and she wants to close all the tabs that don't belong to this segment as fast as possible.
     22 
     23 Each second Luba can either try moving the cursor to the left or to the right (if the cursor is currently at the tab *i*, then she can move it to the tab *max*(*i* - 1, *a*) or to the tab *min*(*i* + 1, *b*)) or try closing all the tabs to the left or to the right of the cursor (if the cursor is currently at the tab *i*, she can close all the tabs with indices from segment [*a*, *i* - 1] or from segment [*i* + 1, *b*]). In the aforementioned expressions *a* and *b* denote the minimum and maximum index of an unclosed tab, respectively. For example, if there were 7 tabs initially and tabs 1, 2 and 7 are closed, then *a* = 3, *b* = 6.
     24 
     25 What is the minimum number of seconds Luba has to spend in order to leave only the tabs with initial indices from *l* to *r* inclusive opened?
     26 
     27 Input
     28 
     29 The only line of input contains four integer numbers *n*, *pos*, *l*, *r* (1 ≤ *n* ≤ 100, 1 ≤ *pos* ≤ *n*, 1 ≤ *l* ≤ *r* ≤ *n*) — the number of the tabs, the cursor position and the segment which Luba needs to leave opened.
     30 
     31 Output
     32 
     33 Print one integer equal to the minimum number of seconds required to close all the tabs outside the segment [*l*, *r*].
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 6 3 2 4
     41 ```
     42 
     43 Output
     44 
     45 ```
     46 5
     47 ```
     48 
     49 Input
     50 
     51 ```
     52 6 3 1 3
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 1
     59 ```
     60 
     61 Input
     62 
     63 ```
     64 5 2 1 5
     65 ```
     66 
     67 Output
     68 
     69 ```
     70 0
     71 ```
     72 
     73 Note
     74 
     75 In the first test Luba can do the following operations: shift the mouse cursor to the tab 2, close all the tabs to the left of it, shift the mouse cursor to the tab 3, then to the tab 4, and then close all the tabs to the right of it.
     76 
     77 In the second test she only needs to close all the tabs to the right of the current position of the cursor.
     78 
     79 In the third test Luba doesn't need to do anything.