codeforces-scrape

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

854B.md (1516B)


      1 Source: https://codeforces.com/problemset/problem/854/B
      2 
      3 B. Maxim Buys an Apartment
      4 
      5 time limit per test
      6 
      7 1 second
      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 Maxim wants to buy an apartment in a new house at Line Avenue of Metropolis. The house has *n* apartments that are numbered from 1 to *n* and are arranged in a row. Two apartments are adjacent if their indices differ by 1. Some of the apartments can already be inhabited, others are available for sale.
     22 
     23 Maxim often visits his neighbors, so apartment is good for him if it is available for sale and there is at least one already inhabited apartment adjacent to it. Maxim knows that there are exactly *k* already inhabited apartments, but he doesn't know their indices yet.
     24 
     25 Find out what could be the minimum possible and the maximum possible number of apartments that are good for Maxim.
     26 
     27 Input
     28 
     29 The only line of the input contains two integers: *n* and *k* (1 ≤ *n* ≤ 109, 0 ≤ *k* ≤ *n*).
     30 
     31 Output
     32 
     33 Print the minimum possible and the maximum possible number of apartments good for Maxim.
     34 
     35 Example
     36 
     37 Input
     38 
     39 ```
     40 6 3
     41 ```
     42 
     43 Output
     44 
     45 ```
     46 1 3
     47 ```
     48 
     49 Note
     50 
     51 In the sample test, the number of good apartments could be minimum possible if, for example, apartments with indices 1, 2 and 3 were inhabited. In this case only apartment 4 is good. The maximum possible number could be, for example, if apartments with indices 1, 3 and 5 were inhabited. In this case all other apartments: 2, 4 and 6 are good.