Submission #559223


Source Code Expand

import sys

N , M = map(int, raw_input().split())
table = [[[0 for x in range(M + 1)] for x in range(N + 1)] for x in range(N + 1)]
s = list(raw_input())
ans = 0

def dp(i):
	if s[i] == '?':
		for x in range(N):
			for y in range(M + 1):
				if x % 2 == 1:
					table[i + 1][1][y] += table[i][x][y]
					if y + (x + 1) / 2 > M:
						table[i + 1][x + 1][M] += table[i][x][y]
					else:
						table[i + 1][x + 1][y + (x + 1) /2] += table[i][x][y]
					table[i + 1][0][y] += table[i][x][y] * 8
				else:
					table[i + 1][x + 1][y] += table[i][x][y]
					table[i + 1][0][y] += table[i][x][y] * 9
	else:
		if s[i] == '2':
			for x in range(N):
				for y in range(M + 1):
					if x % 2 == 0:
						table[i + 1][x + 1][y] += table[i][x][y]
					else:
						table[i + 1][1][y] += table[i][x][y]
		elif s[i] == '5':
			for x in range(N):
				for y in range(M + 1):
					if x % 2 == 1:
						if y + (x + 1) / 2 > M:
							table[i + 1][x + 1][M] += table[i][x][y]
						else:
							table[i + 1][x + 1][y + (x + 1) / 2] += table[i][x][y]
					else:
						table[i + 1][0][y] += table[i][x][y]
		else:
			for x in range(N):
				for y in range(M + 1):
					table[i + 1][0][y] += table[i][x][y]
table[0][0][0] = 1
for x in range(N):
	dp(x)

for x in range(N):
	for y in range(M + 1):
		if y >= M: ans += table[N][x][y]

mod = 1000000007
ans = ans % mod
print str(ans)

Submission Info

Submission Time
Task A - ニコニコ文字列2
User banban
Language Python (2.7.3)
Score 0
Code Size 1408 Byte
Status WA
Exec Time 2064 ms
Memory 142788 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 20
Status
AC × 2
AC × 7
WA × 7
TLE × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
Case Name Status Exec Time Memory
sample_01.txt AC 76 ms 3648 KB
sample_02.txt AC 72 ms 3648 KB
subtask1_01.txt AC 72 ms 3640 KB
subtask1_02.txt WA 65 ms 3640 KB
subtask1_03.txt AC 63 ms 3708 KB
subtask1_04.txt WA 62 ms 3656 KB
subtask1_05.txt AC 259 ms 8824 KB
subtask1_06.txt AC 1202 ms 16756 KB
subtask1_07.txt WA 496 ms 9916 KB
subtask1_08.txt WA 1240 ms 15184 KB
subtask1_09.txt AC 429 ms 7496 KB
subtask1_10.txt WA 156 ms 4660 KB
subtask1_11.txt AC 759 ms 17932 KB
subtask1_12.txt TLE 2062 ms 140792 KB
subtask1_13.txt AC 798 ms 17912 KB
subtask1_14.txt TLE 2061 ms 140356 KB
subtask1_15.txt TLE 2061 ms 141944 KB
subtask1_16.txt TLE 2064 ms 141908 KB
subtask1_17.txt TLE 2064 ms 142452 KB
subtask1_18.txt TLE 2061 ms 140864 KB
subtask1_19.txt TLE 2061 ms 142788 KB
subtask1_20.txt TLE 2063 ms 141636 KB
subtask1_21.txt WA 263 ms 13892 KB
subtask1_22.txt WA 213 ms 11776 KB