Submission #3778936
Source Code Expand
n = int(input()) p = list(map(int, input().split())) s = sum(p) + 1 import numpy as np dp = np.zeros((n, s)) dp[0][0] = 1 dp[0][p[0]] = 1 for i in range(1, n): for j in range(s): tmp = dp[i-1][j] if tmp: dp[i][j] = tmp if j+p[i] < s: dp[i][j+p[i]] = tmp #print(dp) print(np.sum(np.any(dp,axis=0)))
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | tomboftime |
Language | Python (3.4.3) |
Score | 2 |
Code Size | 374 Byte |
Status | AC |
Exec Time | 622 ms |
Memory | 21552 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 2 / 2 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 314 ms | 21552 KB |
01 | AC | 268 ms | 13140 KB |
02 | AC | 622 ms | 16724 KB |
90 | AC | 148 ms | 12420 KB |
91 | AC | 148 ms | 12420 KB |