(cache)Submission #64135758 - 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 #64135758

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]:
            if j == 0:
                first = i  
            j += 1
            if j == M:
                return first
    return -1  
def f(A, B):
    
    first = is_sub(A, B)  
    if first == -1:
        return "No"
    
    second = is_sub(A, B, first + 1) 
    return "Yes" if second != -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]:
            if j == 0:
                first = i  
            j += 1
            if j == M:
                return first
    return -1  

def f(A, B):
    
    first = is_sub(A, B)  
    if first == -1:
        return "No"
    
    second = is_sub(A, B, first + 1) 
    return "Yes" if second != -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:28:02
Task	A - Twice Subsequence
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	568 Byte
Status	WA
Exec Time	108 ms
Memory	138112 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 400

Status

× 3

AC	× 32
WA	× 16

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	57 ms	76276 KiB
00_sample_02.txt	AC	56 ms	76328 KiB
00_sample_03.txt	AC	57 ms	76548 KiB
01_handmade_01.txt	AC	56 ms	76576 KiB
01_handmade_02.txt	AC	107 ms	118260 KiB
01_handmade_03.txt	AC	94 ms	138112 KiB
01_handmade_04.txt	AC	91 ms	137204 KiB
01_handmade_05.txt	AC	91 ms	137100 KiB
02_small_01.txt	AC	56 ms	76328 KiB
02_small_02.txt	WA	56 ms	76368 KiB
02_small_03.txt	WA	55 ms	76244 KiB
02_small_04.txt	WA	56 ms	76348 KiB
02_small_05.txt	AC	56 ms	76468 KiB
03_medium_01.txt	AC	56 ms	76608 KiB
03_medium_02.txt	AC	55 ms	76220 KiB
03_medium_03.txt	WA	55 ms	76556 KiB
03_medium_04.txt	AC	56 ms	76560 KiB
03_medium_05.txt	WA	55 ms	76696 KiB
04_large_01.txt	AC	63 ms	83132 KiB
04_large_02.txt	WA	94 ms	114544 KiB
04_large_03.txt	AC	106 ms	116388 KiB
04_large_04.txt	WA	75 ms	102116 KiB
04_large_05.txt	WA	93 ms	118428 KiB
05_max_01.txt	WA	108 ms	117572 KiB
05_max_02.txt	WA	107 ms	116744 KiB
05_max_03.txt	AC	107 ms	117828 KiB
05_max_04.txt	WA	106 ms	116708 KiB
05_max_05.txt	AC	106 ms	116416 KiB
06_not_emerge_01.txt	AC	82 ms	113924 KiB
06_not_emerge_02.txt	AC	83 ms	113576 KiB
06_not_emerge_03.txt	AC	81 ms	113616 KiB
07_emerge_once_01.txt	AC	92 ms	119508 KiB
07_emerge_once_02.txt	AC	106 ms	116332 KiB
07_emerge_once_03.txt	AC	100 ms	117672 KiB
07_emerge_once_04.txt	AC	105 ms	116236 KiB
07_emerge_once_05.txt	AC	85 ms	114328 KiB
08_emerge_twice_01.txt	WA	91 ms	119512 KiB
08_emerge_twice_02.txt	WA	106 ms	115792 KiB
08_emerge_twice_03.txt	WA	100 ms	117892 KiB
08_emerge_twice_04.txt	WA	99 ms	117904 KiB
08_emerge_twice_05.txt	WA	104 ms	117852 KiB
09_one_two_only_01.txt	AC	89 ms	122676 KiB
09_one_two_only_02.txt	AC	90 ms	122948 KiB
09_one_two_only_03.txt	AC	89 ms	120864 KiB
09_one_two_only_04.txt	AC	86 ms	119116 KiB
09_one_two_only_05.txt	AC	87 ms	128396 KiB
09_one_two_only_06.txt	AC	79 ms	111252 KiB
09_one_two_only_07.txt	AC	86 ms	124028 KiB