codeforces-scrape

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

1203E.md (1663B)


      1 Source: https://codeforces.com/problemset/problem/1203/E
      2 
      3 E. Boxers
      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 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 There are $n$ boxers, the weight of the $i$-th boxer is $a_i$. Each of them can change the weight by no more than $1$ before the competition (the weight cannot become equal to zero, that is, it must remain positive). Weight is always an integer number.
     22 
     23 It is necessary to choose the largest boxing team in terms of the number of people, that all the boxers' weights in the team are different (i.e. unique).
     24 
     25 Write a program that for given current values ​$a_i$ will find the maximum possible number of boxers in a team.
     26 
     27 It is possible that after some change the weight of some boxer is $150001$ (but no more).
     28 
     29 Input
     30 
     31 The first line contains an integer $n$ ($1 \le n \le 150000$) — the number of boxers. The next line contains $n$ integers $a_1, a_2, \dots, a_n$, where $a_i$ ($1 \le a_i \le 150000$) is the weight of the $i$-th boxer.
     32 
     33 Output
     34 
     35 Print a single integer — the maximum possible number of people in a team.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 4  
     43 3 2 4 1
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 4
     50 ```
     51 
     52 Input
     53 
     54 ```
     55 6  
     56 1 1 1 4 4 4
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 5
     63 ```
     64 
     65 Note
     66 
     67 In the first example, boxers should not change their weights — you can just make a team out of all of them.
     68 
     69 In the second example, one boxer with a weight of $1$ can be increased by one (get the weight of $2$), one boxer with a weight of $4$ can be reduced by one, and the other can be increased by one (resulting the boxers with a weight of $3$ and $5$, respectively). Thus, you can get a team consisting of boxers with weights of $5, 4, 3, 2, 1$.