Submission #64133357

Source Code Expand

Copy
def z_algo(S):
    N = len(S)
    A = [0]*N
    i = 1; j = 0
    A[0] = l = len(S)
    while i < l:
        while i+j < l and S[j] == S[i+j]:
            j += 1
        if not j:
            i += 1
            continue
        A[i] = j
        k = 1
        while l-i > k < j - A[k]:
            A[i+k] = A[k]
            k += 1
        i += k; j -= k
    return A
N,M=map(int,input().split())
A=list(input().split())
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
def z_algo(S):
    N = len(S)
    A = [0]*N
    i = 1; j = 0
    A[0] = l = len(S)
    while i < l:
        while i+j < l and S[j] == S[i+j]:
            j += 1
        if not j:
            i += 1
            continue
        A[i] = j
        k = 1
        while l-i > k < j - A[k]:
            A[i+k] = A[k]
            k += 1
        i += k; j -= k
    return A

N,M=map(int,input().split())
A=list(input().split())
B=list(input().split())
S=B+["#"]+A

T=z_algo(S)
cnt=0
for i in range(M,len(T)):
    if T[i]==M:
        cnt+=1
        
if cnt>=2:
    print("Yes")
else:
    print("No")

Submission Info

Submission Time
Task A - Twice Subsequence
User kotafuku
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 622 Byte
Status WA
Exec Time 112 ms
Memory 137604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 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 55 ms 76540 KiB
00_sample_02.txt AC 56 ms 76352 KiB
00_sample_03.txt AC 56 ms 76672 KiB
01_handmade_01.txt AC 56 ms 76624 KiB
01_handmade_02.txt AC 112 ms 124572 KiB
01_handmade_03.txt AC 103 ms 137604 KiB
01_handmade_04.txt AC 86 ms 124816 KiB
01_handmade_05.txt AC 103 ms 137560 KiB
02_small_01.txt AC 56 ms 76248 KiB
02_small_02.txt WA 56 ms 76360 KiB
02_small_03.txt WA 56 ms 76660 KiB
02_small_04.txt WA 55 ms 76616 KiB
02_small_05.txt AC 56 ms 76608 KiB
03_medium_01.txt AC 56 ms 76828 KiB
03_medium_02.txt AC 56 ms 76464 KiB
03_medium_03.txt WA 57 ms 76556 KiB
03_medium_04.txt AC 56 ms 76468 KiB
03_medium_05.txt WA 55 ms 76220 KiB
04_large_01.txt AC 69 ms 84276 KiB
04_large_02.txt WA 99 ms 125260 KiB
04_large_03.txt AC 107 ms 119820 KiB
04_large_04.txt WA 72 ms 98292 KiB
04_large_05.txt WA 93 ms 125984 KiB
05_max_01.txt WA 111 ms 120980 KiB
05_max_02.txt WA 107 ms 120560 KiB
05_max_03.txt AC 109 ms 120948 KiB
05_max_04.txt WA 107 ms 120484 KiB
05_max_05.txt AC 103 ms 119920 KiB
06_not_emerge_01.txt AC 79 ms 105456 KiB
06_not_emerge_02.txt AC 78 ms 105024 KiB
06_not_emerge_03.txt AC 78 ms 104872 KiB
07_emerge_once_01.txt AC 93 ms 124336 KiB
07_emerge_once_02.txt AC 103 ms 120132 KiB
07_emerge_once_03.txt AC 95 ms 114172 KiB
07_emerge_once_04.txt AC 102 ms 120196 KiB
07_emerge_once_05.txt AC 79 ms 105364 KiB
08_emerge_twice_01.txt WA 83 ms 110984 KiB
08_emerge_twice_02.txt WA 99 ms 117136 KiB
08_emerge_twice_03.txt WA 94 ms 114624 KiB
08_emerge_twice_04.txt WA 93 ms 116208 KiB
08_emerge_twice_05.txt WA 98 ms 113760 KiB
09_one_two_only_01.txt AC 93 ms 121956 KiB
09_one_two_only_02.txt WA 92 ms 121764 KiB
09_one_two_only_03.txt WA 94 ms 120096 KiB
09_one_two_only_04.txt WA 93 ms 118768 KiB
09_one_two_only_05.txt AC 101 ms 127880 KiB
09_one_two_only_06.txt WA 88 ms 110332 KiB
09_one_two_only_07.txt AC 100 ms 123940 KiB
Facebook Twitter Telegram Share

2025-06-30 (Mon)
12:04:32 +09:00

More…