Submission #5993117


Source Code Expand

Copy
import numpy as np
N,M = map(int,input().split())
S = input().split()
T = np.array(input().split(), dtype = np.int32)
dp = np.ones(M+1, dtype = np.int64)
for s in S:
  dp[1:] = ((dp[:-1] * (T == int(s))).cumsum() + dp[1:]) % (10**9 + 7)
print(dp[M])

Submission Info

Submission Time
Task E - Common Subsequence
User maspy
Language Python (3.4.3)
Score 500
Code Size 256 Byte
Status AC
Exec Time 265 ms
Memory 12484 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 149 ms 12228 KB
02.txt AC 149 ms 12484 KB
03.txt AC 148 ms 12484 KB
04.txt AC 148 ms 12484 KB
05.txt AC 149 ms 12256 KB
06.txt AC 260 ms 12484 KB
07.txt AC 261 ms 12368 KB
08.txt AC 258 ms 12484 KB
09.txt AC 258 ms 12484 KB
10.txt AC 259 ms 12484 KB
11.txt AC 260 ms 12468 KB
12.txt AC 260 ms 12468 KB
13.txt AC 262 ms 12464 KB
14.txt AC 262 ms 12368 KB
15.txt AC 259 ms 12484 KB
16.txt AC 257 ms 12480 KB
17.txt AC 262 ms 12484 KB
18.txt AC 256 ms 12484 KB
19.txt AC 257 ms 12468 KB
20.txt AC 258 ms 12484 KB
21.txt AC 265 ms 12484 KB
22.txt AC 259 ms 12484 KB
23.txt AC 162 ms 12340 KB
24.txt AC 259 ms 12384 KB
25.txt AC 189 ms 12484 KB
26.txt AC 155 ms 12484 KB
27.txt AC 264 ms 12484 KB
28.txt AC 263 ms 12484 KB
s1.txt AC 148 ms 12356 KB
s2.txt AC 148 ms 12356 KB
s3.txt AC 148 ms 12484 KB
s4.txt AC 147 ms 12484 KB
s5.txt AC 150 ms 12484 KB