Submission #31255286

Source Code Expand

MOD = 10 ** 9 + 7
n, m = map(int, input().split())
is_dangerous = [0] * (n + 1)
for i in range(m):
    a_i = int(input())
    is_dangerous[a_i] = 1
dp = [0] * (n + 1)
dp[0] = 1
if is_dangerous[1] == 0:
    dp[1] = 1
for i in range(2, n + 1):
    dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
    if is_dangerous[i] == 1:
        dp[i] = 0
print(dp[n])

Submission Info

Submission Time
Task C - Typical Stairs
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 300
Code Size 357 Byte
Status AC
Exec Time 208 ms
Memory 76116 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 36
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 208 ms 61464 KiB
02.txt AC 50 ms 61616 KiB
03.txt AC 52 ms 61720 KiB
04.txt AC 52 ms 61728 KiB
05.txt AC 53 ms 61640 KiB
06.txt AC 48 ms 61744 KiB
07.txt AC 49 ms 61720 KiB
08.txt AC 50 ms 61748 KiB
09.txt AC 48 ms 61772 KiB
10.txt AC 54 ms 61828 KiB
11.txt AC 51 ms 61580 KiB
12.txt AC 50 ms 61888 KiB
13.txt AC 50 ms 61756 KiB
14.txt AC 49 ms 61472 KiB
15.txt AC 52 ms 61736 KiB
16.txt AC 152 ms 75568 KiB
17.txt AC 88 ms 74344 KiB
18.txt AC 103 ms 75440 KiB
19.txt AC 103 ms 75432 KiB
20.txt AC 66 ms 67556 KiB
21.txt AC 99 ms 74588 KiB
22.txt AC 59 ms 64044 KiB
23.txt AC 111 ms 75696 KiB
24.txt AC 97 ms 75072 KiB
25.txt AC 93 ms 75168 KiB
26.txt AC 55 ms 65024 KiB
27.txt AC 74 ms 73228 KiB
28.txt AC 162 ms 76104 KiB
29.txt AC 126 ms 76036 KiB
30.txt AC 88 ms 75940 KiB
31.txt AC 110 ms 76116 KiB
32.txt AC 115 ms 76112 KiB
33.txt AC 118 ms 75924 KiB
s1.txt AC 54 ms 61816 KiB
s2.txt AC 50 ms 61820 KiB
s3.txt AC 53 ms 61760 KiB