Submission #3765938
Source Code Expand
N, A = map(int, input().split()) x = list(map(int, input().split())) X = max(max(x), A) dp = [[0 for i in range(2*N*X+1)] for j in range(N+1)] dp[0][N*X] = 1 y = [] for i in range(N): tmp = x[i]-A y.append(tmp) for i in range(N): for j in range(2*N*X+1): if j-y[i]<0 or j-y[i]>2*N*X: dp[i+1][j] = dp[i][j] else: dp[i+1][j] = dp[i][j] + dp[i][j-y[i]] print(dp[N][N*X]-1)
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | iikuni_bakuhu |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 466 Byte |
Status | AC |
Exec Time | 200 ms |
Memory | 5744 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
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 | 18 ms | 3064 KB |
example_02.txt | AC | 18 ms | 3064 KB |
example_03.txt | AC | 18 ms | 3064 KB |
example_04.txt | AC | 22 ms | 3064 KB |
subtask1_01.txt | AC | 35 ms | 3188 KB |
subtask1_02.txt | AC | 36 ms | 3188 KB |
subtask1_03.txt | AC | 36 ms | 3188 KB |
subtask1_04.txt | AC | 36 ms | 3188 KB |
subtask1_05.txt | AC | 36 ms | 3188 KB |
subtask1_06.txt | AC | 18 ms | 3064 KB |
subtask1_07.txt | AC | 17 ms | 3064 KB |
subtask1_08.txt | AC | 35 ms | 3188 KB |
subtask1_09.txt | AC | 33 ms | 3188 KB |
subtask2_01.txt | AC | 197 ms | 5488 KB |
subtask2_02.txt | AC | 187 ms | 5744 KB |
subtask2_03.txt | AC | 180 ms | 5488 KB |
subtask2_04.txt | AC | 184 ms | 5108 KB |
subtask2_05.txt | AC | 184 ms | 5108 KB |
subtask2_06.txt | AC | 200 ms | 5108 KB |
subtask2_07.txt | AC | 193 ms | 5492 KB |
subtask2_08.txt | AC | 97 ms | 4084 KB |
subtask2_09.txt | AC | 100 ms | 4084 KB |
subtask2_10.txt | AC | 136 ms | 4848 KB |
subtask2_11.txt | AC | 145 ms | 4976 KB |