Submission #5067923

Source Code Expand

N, *A = map(int, open(0).read().split())
MOD = 998244353

S = sum(A)
dp0 = [0]*(S+1)
dp0[0] = 1
for a in A:
    for i in range(S, a-1, -1):
        dp0[i] = (dp0[i] + dp0[i-a]*2) % MOD
dp1 = [0]*(S+1)
dp1[0] = 1
for a in A:
    for i in range(S, a-1, -1):
        dp1[i] = (dp1[i] + dp1[i-a]) % MOD

ans = pow(3, N, MOD)
for L in range(0, S//2+1):
    ans = (ans - dp0[L]*3) % MOD
if S % 2 == 0:
    ans = (ans + dp1[S//2]*3) % MOD
print(ans)

Submission Info

Submission Time
Task D - Three Colors
User yaketake08
Language PyPy3 (2.4.0)
Score 600
Code Size 462 Byte
Status AC
Exec Time 1155 ms
Memory 44252 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 27
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, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 645 ms 41692 KiB
02.txt AC 689 ms 41692 KiB
03.txt AC 695 ms 41692 KiB
04.txt AC 682 ms 41692 KiB
05.txt AC 203 ms 39792 KiB
06.txt AC 195 ms 39792 KiB
07.txt AC 195 ms 39792 KiB
08.txt AC 194 ms 39792 KiB
09.txt AC 178 ms 39536 KiB
10.txt AC 180 ms 39536 KiB
11.txt AC 1143 ms 44252 KiB
12.txt AC 1155 ms 42460 KiB
13.txt AC 176 ms 39408 KiB
14.txt AC 1081 ms 42076 KiB
15.txt AC 1073 ms 42204 KiB
16.txt AC 1093 ms 42076 KiB
17.txt AC 179 ms 39536 KiB
18.txt AC 184 ms 39408 KiB
19.txt AC 181 ms 39408 KiB
20.txt AC 181 ms 39536 KiB
21.txt AC 174 ms 38256 KiB
22.txt AC 165 ms 38256 KiB
23.txt AC 163 ms 38256 KiB
24.txt AC 162 ms 38256 KiB
s1.txt AC 162 ms 38256 KiB
s2.txt AC 162 ms 38256 KiB
s3.txt AC 167 ms 38768 KiB