COCI '08 Contest 4 #6 Periodni

View as PDF

Submit solution

Points: 30 (partial)
Time limit: 2.5s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Luka is bored in chemistry class so he is staring at a large periodic table of chemical elements hanging from a wall above the blackboard. To kill time, Luka decided to make his own table completely different from the one in the classroom.

His table consists of N columns, each with some height, aligned at the bottom (see example below).

After he draws the table he needs to fill it with elements. He first decided to enter the noble gases of which there are K. Luka must put them in the table so that no two noble gases are close to each other.

Two squares in the table are close to each other if they are in the same column or row, and all squares between them exist. In the example below, the a squares are not close, but the b squares are.


Write a program that, given N, K and the heights of the N columns, calculates the total number of ways for Luka to place the noble gases into the table. This number can be large, so output it modulo 1\,000\,000\,007.

Input Specification

The first line contains the integers N and K separated by a space (1 \leq N \leq 500, 1 \leq K \leq 500), the number of columns in Luka's table and the number of noble gases.

The next line contains N positive integers, separated by spaces. These are heights of the columns from left to right. The heights will be at most 1\,000\,000.

Output Specification

Output the number of ways for Luka to fill his table with noble gases, modulo 1\,000\,000\,007.


In test cases worth 40\% of points, all numbers in the input will be less than 15. In test cases worth 70\% of points, all numbers in the input will be less than 100.

Sample Input 1

3 3
2 1 3

Sample Output 1


Sample Input 2

4 1
1 2 3 4

Sample Output 2


Sample Input 3

5 2
2 3 1 2 4

Sample Output 3


Sample Input 4

3 2
999999 999999 999999

Sample Output 4



There are no comments at the moment.