Submission #3389611


Source Code Expand

n,a = map(int, input().split())
list_x = list(map(int, input().split()))
dp = [ [[0] * 2600 for i in range(100)] for j in range(100)]
for j in range(n+1):
	for k in range(n+1):
		for s in range(sum(list_x) + 1):
			if j == 0 and k == 0 and s == 0:
				dp[j][k][s] = 1
			elif j >= 1 and s < list_x[j - 1]:
				dp[j][k][s] = dp[j - 1][k][s]
			elif j >= 1 and k >= 1 and s >= list_x[j - 1]:
				dp[j][k][s] = dp[j - 1][k - 1][s - list_x[j-1]] + dp[j - 1][k][s]
			else:
				dp[j][k][s] = 0
ans = 0
for p in range(1,n+1):
	ans += dp[n][p][p*a]
print(ans)

Submission Info

Submission Time
Task C - Tak and Cards
User KFCHY
Language Python (3.4.3)
Score 200
Code Size 569 Byte
Status TLE
Exec Time 2117 ms
Memory 211952 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 4
AC × 12
AC × 16
TLE × 8
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, 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
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, 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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt AC 539 ms 206964 KB
example_02.txt AC 538 ms 206964 KB
example_03.txt AC 543 ms 206964 KB
example_04.txt AC 636 ms 206964 KB
subtask1_01.txt AC 692 ms 206964 KB
subtask1_02.txt AC 718 ms 206964 KB
subtask1_03.txt AC 736 ms 206964 KB
subtask1_04.txt AC 542 ms 206964 KB
subtask1_05.txt AC 634 ms 206964 KB
subtask1_06.txt AC 540 ms 206964 KB
subtask1_07.txt AC 539 ms 206964 KB
subtask1_08.txt AC 652 ms 209012 KB
subtask1_09.txt AC 615 ms 206964 KB
subtask2_01.txt TLE 2117 ms 208500 KB
subtask2_02.txt TLE 2117 ms 207860 KB
subtask2_03.txt TLE 2117 ms 208360 KB
subtask2_04.txt TLE 2117 ms 206964 KB
subtask2_05.txt TLE 2117 ms 206964 KB
subtask2_06.txt AC 652 ms 206964 KB
subtask2_07.txt TLE 2117 ms 207092 KB
subtask2_08.txt AC 1281 ms 209012 KB
subtask2_09.txt AC 1451 ms 208756 KB
subtask2_10.txt TLE 2116 ms 211952 KB
subtask2_11.txt TLE 2117 ms 211188 KB