Problem:
Score : 300 points

Problem Statement

There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.
He can climb up one or two steps at a time.

However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.

How many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?
Find the count modulo 1\ 000\ 000\ 007.

Constraints

1 \leq N \leq 10^5

0 \leq M \leq N-1

1 \leq a_1 < a_2 < ... < a_M \leq N-1

Input

Input is given from Standard Input in the following format:

N M
a_1
a_2
.
.
.
a_M

Output

Print the number of ways to climb up the stairs under the condition, modulo 1\ 000\ 000\ 007.

Sample Input 1

6 1
3

Sample Output 1

4

There are four ways to climb up the stairs, as follows:

0 \to 1 \to 2 \to 4 \to 5 \to 6

0 \to 1 \to 2 \to 4 \to 6

0 \to 2 \to 4 \to 5 \to 6

0 \to 2 \to 4 \to 6

Sample Input 2

10 2
4
5

Sample Output 2

0

There may be no way to climb up the stairs without setting foot on the broken steps.

Sample Input 3

100 5
1
23
45
67
89

Sample Output 3

608200469

Be sure to print the count modulo 1\ 000\ 000\ 007.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::*;

const SP: u8 = b' ';
const LF: u8 = b'\n';

struct CharacterInput<'a> {
    locked_stdin: StdinLock<'a>,
    bytes_buffer: Vec<u8>,
}

impl<'a> CharacterInput<'a> {
    fn read(&mut self, delimiter: u8) -> &[u8] {
        self.bytes_buffer.clear();

        let len = self
            .locked_stdin
            .read_until(delimiter, &mut self.bytes_buffer)
            .unwrap();

        if len > 0 {
            let len = len - 1;
            if self.bytes_buffer[len] == delimiter {
                self.bytes_buffer.truncate(len);
            }
        }

        &self.bytes_buffer
    }

    fn scan_u(&mut self, delimiter: u8) -> u32 {
        self.read(delimiter)
            .into_iter()
            .fold(0, |accumulator, byte| {
                (byte - b'0') as u32 + accumulator * 10
            })
    }

    fn scan_u_vec(&mut self, n: usize, separator: u8, delimiter: u8) -> Vec<u32> {
        let mut vector = Vec::with_capacity(n as usize);
        for _i in 0..n - 1 {
            vector.push(self.scan_u(separator));
        }
        vector.push(self.scan_u(delimiter));
        vector
    }

    fn scan_u_pair(&mut self, separator: u8, delimiter: u8) -> (u32, u32) {
        (self.scan_u(separator), self.scan_u(delimiter))
    }

    fn scan_u_triple(&mut self, separator: u8, delimiter: u8) -> (u32, u32, u32) {
        (
            self.scan_u(separator),
            self.scan_u(separator),
            self.scan_u(delimiter),
        )
    }

    fn scan_s(&mut self, delimiter: u8) -> &str {
        unsafe { std::str::from_utf8_unchecked(self.read(delimiter)) }
    }
}

fn create_cin<'a>(input: StdinLock<'a>, buffer_capacity: usize) -> CharacterInput {
    CharacterInput {
        locked_stdin: input,
        bytes_buffer: Vec::with_capacity(buffer_capacity),
    }
}

struct CharacterOutput {
    string_buffer: String,
}

impl CharacterOutput {
    fn push_s(&mut self, s: &str) {
        self.string_buffer += s;
    }

    fn add_s(&mut self, s: &str, separator: char) {
        self.push_s(s);
        self.string_buffer.push(separator);
    }

    fn push<T: ToString>(&mut self, n: T) {
        self.push_s(&n.to_string());
    }

    fn add<T: ToString>(&mut self, n: T, separator: char) {
        self.push(n);
        self.string_buffer.push(separator);
    }

    fn add_from_iterator<T: ToString, I>(
        &mut self,
        iterator: &mut I,
        length: usize,
        separator: char,
        delimiter: char,
    ) where
        I: Iterator<Item = T>,
    {
        for element in iterator.by_ref().take(length - 1) {
            self.add(element, separator);
        }
        self.add(iterator.next().unwrap(), delimiter);
    }

    fn flush(&mut self) {
        let out = stdout();
        let mut out = out.lock();
        out.write_all(self.string_buffer.as_bytes()).unwrap();
        self.string_buffer.clear();
    }
}

fn create_cout(capacity: usize) -> CharacterOutput {
    CharacterOutput {
        string_buffer: String::with_capacity(capacity),
    }
}

// easy
fn println<T: std::string::ToString>(s: T) {
    println!("{}", s.to_string());
}

fn print_from_iterator<T: ToString, I>(
    iterator: &mut I,
    length: usize,
    separator: &str,
    buffer_capacity: usize
) where
    I: Iterator<Item = T>,
{
    println!(
        "{}",
        iterator
            .map(|e| e.to_string())
            .collect::<Vec<String>>()
            .join(separator),
    );
}

// ------------------------------------------------------------------------

fn get_count(n: usize, table: &mut Vec<Option<u64>>, broken: &Vec<bool>) -> u64 {
    match table[n] {
        Some(val) => val,
        None => {
            if broken[n] { 0 } else {
                match n {
                    0 => 1,
                    1 => 1,
                    _ => {
                        let c = get_count(n - 2, table, broken) + get_count(n - 1, table, broken);
                        table[n] = Some(c);
                        c
                    }
                }
            }
        }
    }
}

fn main() {
    let cin = stdin();
    let cin = &mut create_cin(cin.lock(), 64);
    let cout = &mut create_cout(0);

    let n = cin.scan_u(SP) as usize;
    let m = cin.scan_u(LF) as usize;
    
    let mut broken = vec!(false; n + 1);
    for _ in 0..m {
        broken[cin.scan_u(LF) as usize] = true;
    }

    let mut table = vec!(None as Option<u64>; n + 1);

    cout.add(
        get_count(n, &mut table, &broken) % 1000000007,
        '\n'
    );

    cout.flush();
}