Submission #5992960


Source Code Expand

Copy
import numpy as np
MOD = 10**9 + 7
N,M = map(int,input().split())
S = np.array(input().split(), dtype=np.int32)
T = np.array(input().split(), dtype=np.int32)

# (n,m) 以前で作れている列
dp = np.zeros((N+1, M+1), dtype = np.int64)
dp[0] = 1

for n in range(1, N+1):
  same = (T == S[n-1])
  dp[n,1:][same] = dp[n-1,:-1][same] # ちょうど(n,m)で終わる
  dp[n] = (dp[n].cumsum() + dp[n-1]) % MOD # cumsumに直す

answer = dp[N,M]
print(answer)

Submission Info

Submission Time
Task E - Common Subsequence
User maspy
Language Python (3.4.3)
Score 500
Code Size 476 Byte
Status AC
Exec Time 293 ms
Memory 43972 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 5
AC × 33
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt, s5.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, 25.txt, 26.txt, 27.txt, 28.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
Case Name Status Exec Time Memory
01.txt AC 148 ms 12400 KB
02.txt AC 148 ms 12500 KB
03.txt AC 149 ms 12500 KB
04.txt AC 150 ms 12500 KB
05.txt AC 149 ms 12500 KB
06.txt AC 275 ms 42180 KB
07.txt AC 277 ms 43332 KB
08.txt AC 271 ms 41412 KB
09.txt AC 273 ms 41924 KB
10.txt AC 267 ms 41156 KB
11.txt AC 277 ms 42564 KB
12.txt AC 273 ms 42308 KB
13.txt AC 283 ms 42816 KB
14.txt AC 271 ms 42948 KB
15.txt AC 269 ms 41924 KB
16.txt AC 291 ms 40900 KB
17.txt AC 293 ms 43332 KB
18.txt AC 280 ms 41156 KB
19.txt AC 278 ms 41664 KB
20.txt AC 277 ms 41540 KB
21.txt AC 280 ms 42820 KB
22.txt AC 279 ms 43972 KB
23.txt AC 161 ms 13380 KB
24.txt AC 257 ms 39876 KB
25.txt AC 188 ms 13764 KB
26.txt AC 156 ms 13764 KB
27.txt AC 276 ms 43720 KB
28.txt AC 278 ms 43716 KB
s1.txt AC 148 ms 12400 KB
s2.txt AC 149 ms 12500 KB
s3.txt AC 150 ms 12500 KB
s4.txt AC 148 ms 12500 KB
s5.txt AC 148 ms 12500 KB