Submission #2560757


Source Code Expand

N,M,Q=map(int,input().split())
A=[int(i) for i in input().split()]
data=[]
asum = sum(A)
for i in range(Q):
    k,x = map(int,input().split())
    if M-x > asum-A[k-1]:
        data.append('0')
        continue
    B = []
    B = B+A[:k-1]+A[k:]
    dp = [[0]*(M+1) for i in range(N)]
    dp[0][0]=1
    for n in range(1,N):
        for m in range(M+1):
            dp[n][m] = sum(dp[n-1][i] for i in range(max(0,m-B[n-1]),max(m+1,M)))
    data.append(str(dp[N-1][M-x]))
print('\n'.join(data))

Submission Info

Submission Time
Task D - 注文の多い高橋商店
User okumura
Language Python (3.4.3)
Score 0
Code Size 510 Byte
Status WA
Exec Time 2106 ms
Memory 36596 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 Subtask4
Score / Max Score 0 / 0 0 / 10 0 / 20 0 / 50 0 / 20
Status
AC × 2
AC × 4
WA × 2
TLE × 4
AC × 4
WA × 2
TLE × 7
AC × 4
WA × 2
TLE × 7
AC × 5
WA × 2
TLE × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.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
Subtask2 sample_01.txt, sample_02.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt
Subtask3 sample_01.txt, sample_02.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, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt
Subtask4 sample_01.txt, sample_02.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask4_01.txt, subtask4_02.txt, subtask4_03.txt, subtask4_04.txt, subtask4_05.txt, subtask4_06.txt, subtask4_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB
subtask1_01.txt AC 17 ms 3064 KB
subtask1_02.txt WA 17 ms 3064 KB
subtask1_03.txt AC 18 ms 3064 KB
subtask1_04.txt WA 189 ms 3188 KB
subtask1_05.txt TLE 2104 ms 4144 KB
subtask1_06.txt TLE 2104 ms 3932 KB
subtask1_07.txt TLE 2104 ms 3296 KB
subtask1_08.txt TLE 2104 ms 3924 KB
subtask2_01.txt TLE 2103 ms 3188 KB
subtask2_02.txt TLE 2104 ms 3908 KB
subtask2_03.txt TLE 2104 ms 3948 KB
subtask3_01.txt TLE 2104 ms 17296 KB
subtask3_02.txt TLE 2104 ms 36596 KB
subtask3_03.txt TLE 2105 ms 34880 KB
subtask4_01.txt TLE 2105 ms 24764 KB
subtask4_02.txt TLE 2106 ms 34752 KB
subtask4_03.txt TLE 2104 ms 3700 KB
subtask4_04.txt AC 1363 ms 10004 KB
subtask4_05.txt TLE 2105 ms 34752 KB
subtask4_06.txt TLE 2105 ms 36596 KB
subtask4_07.txt TLE 2105 ms 34752 KB