(cache)Submission #64135308 - AtCoder Regular Contest 195 (Div. 2)

Contest Duration: 2025-03-23(Sun) 21:00 - 2025-03-23(Sun) 23:00 (local time) (120 minutes) Back to Home

Submission #64135308

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def is_sub(A, B, index=0):
    N, M = len(A), len(B)
    j = 0 
    for i in range(index, N):
        if A[i] == B[j]:
            j += 1
            if j == M: 
                return i + 1  
    return -1 
def f(A, B):
   
    match = is_sub(A, B)
    if match == -1:
        return "No"
    
    s_match = is_sub(A, B, match)
    return "Yes" if s_match != -1 else "No"
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def is_sub(A, B, index=0):

    N, M = len(A), len(B)
    j = 0 
    for i in range(index, N):
        if A[i] == B[j]:
            j += 1
            if j == M: 
                return i + 1  
    return -1 

def f(A, B):
   
    match = is_sub(A, B)
    if match == -1:
        return "No"
    
    s_match = is_sub(A, B, match)
    return "Yes" if s_match != -1 else "No"



N,M=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
print(f(A, B))

Submission Info

Submission Time	2025-03-23 21:23:16
Task	A - Twice Subsequence
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	512 Byte
Status	WA
Exec Time	114 ms
Memory	137572 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 400

Status

× 3

AC	× 28
WA	× 20

Set Name	Test Cases
Sample	00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All	00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_handmade_01.txt, 01_handmade_02.txt, 01_handmade_03.txt, 01_handmade_04.txt, 01_handmade_05.txt, 02_small_01.txt, 02_small_02.txt, 02_small_03.txt, 02_small_04.txt, 02_small_05.txt, 03_medium_01.txt, 03_medium_02.txt, 03_medium_03.txt, 03_medium_04.txt, 03_medium_05.txt, 04_large_01.txt, 04_large_02.txt, 04_large_03.txt, 04_large_04.txt, 04_large_05.txt, 05_max_01.txt, 05_max_02.txt, 05_max_03.txt, 05_max_04.txt, 05_max_05.txt, 06_not_emerge_01.txt, 06_not_emerge_02.txt, 06_not_emerge_03.txt, 07_emerge_once_01.txt, 07_emerge_once_02.txt, 07_emerge_once_03.txt, 07_emerge_once_04.txt, 07_emerge_once_05.txt, 08_emerge_twice_01.txt, 08_emerge_twice_02.txt, 08_emerge_twice_03.txt, 08_emerge_twice_04.txt, 08_emerge_twice_05.txt, 09_one_two_only_01.txt, 09_one_two_only_02.txt, 09_one_two_only_03.txt, 09_one_two_only_04.txt, 09_one_two_only_05.txt, 09_one_two_only_06.txt, 09_one_two_only_07.txt

Case Name	Status	Exec Time	Memory
00_sample_01.txt	AC	62 ms	76384 KiB
00_sample_02.txt	AC	61 ms	76324 KiB
00_sample_03.txt	AC	62 ms	76320 KiB
01_handmade_01.txt	AC	62 ms	76636 KiB
01_handmade_02.txt	AC	114 ms	118452 KiB
01_handmade_03.txt	WA	97 ms	137324 KiB
01_handmade_04.txt	AC	96 ms	137572 KiB
01_handmade_05.txt	AC	100 ms	137540 KiB
02_small_01.txt	AC	62 ms	76384 KiB
02_small_02.txt	WA	64 ms	76320 KiB
02_small_03.txt	WA	64 ms	76452 KiB
02_small_04.txt	WA	62 ms	76488 KiB
02_small_05.txt	AC	63 ms	76312 KiB
03_medium_01.txt	AC	63 ms	76468 KiB
03_medium_02.txt	AC	63 ms	76500 KiB
03_medium_03.txt	WA	62 ms	76432 KiB
03_medium_04.txt	AC	64 ms	76528 KiB
03_medium_05.txt	WA	61 ms	76536 KiB
04_large_01.txt	AC	69 ms	82852 KiB
04_large_02.txt	WA	97 ms	114856 KiB
04_large_03.txt	AC	111 ms	116160 KiB
04_large_04.txt	WA	82 ms	102000 KiB
04_large_05.txt	WA	100 ms	118500 KiB
05_max_01.txt	WA	113 ms	117828 KiB
05_max_02.txt	WA	112 ms	116548 KiB
05_max_03.txt	AC	113 ms	117760 KiB
05_max_04.txt	WA	112 ms	116444 KiB
05_max_05.txt	AC	112 ms	116256 KiB
06_not_emerge_01.txt	AC	87 ms	113628 KiB
06_not_emerge_02.txt	AC	89 ms	113868 KiB
06_not_emerge_03.txt	AC	88 ms	113628 KiB
07_emerge_once_01.txt	AC	98 ms	119752 KiB
07_emerge_once_02.txt	AC	109 ms	116336 KiB
07_emerge_once_03.txt	AC	104 ms	117872 KiB
07_emerge_once_04.txt	AC	110 ms	116312 KiB
07_emerge_once_05.txt	AC	87 ms	113848 KiB
08_emerge_twice_01.txt	WA	95 ms	119668 KiB
08_emerge_twice_02.txt	WA	107 ms	115528 KiB
08_emerge_twice_03.txt	WA	106 ms	117844 KiB
08_emerge_twice_04.txt	WA	103 ms	117768 KiB
08_emerge_twice_05.txt	WA	106 ms	117968 KiB
09_one_two_only_01.txt	AC	92 ms	122292 KiB
09_one_two_only_02.txt	WA	88 ms	121884 KiB
09_one_two_only_03.txt	WA	88 ms	120348 KiB
09_one_two_only_04.txt	WA	88 ms	118964 KiB
09_one_two_only_05.txt	AC	91 ms	128172 KiB
09_one_two_only_06.txt	AC	87 ms	110844 KiB
09_one_two_only_07.txt	AC	93 ms	124236 KiB