Submission #47742870

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#ABC329_20231118_E
from collections import deque
N,M=map(int,input().split())
S=list(input())
T=list(input())
q=deque()
U=[False]*(N-M+1)
P=["#"]*M
def c_d(i):
    if(U[i]):
        return
    flg=1
    for j in range(M):
        if(S[i+j]!="#" and S[i+j]!=T[j]):
            flg=0
    if(flg):
        U[i]=True
        q.append(i)
for i in range(N-M+1):
    c_d(i)
#print(q)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#ABC329_20231118_E
from collections import deque
N,M=map(int,input().split())
S=list(input())
T=list(input())
q=deque()
U=[False]*(N-M+1)
P=["#"]*M
def c_d(i):
    if(U[i]):
        return
    flg=1
    for j in range(M):
        if(S[i+j]!="#" and S[i+j]!=T[j]):
            flg=0
    if(flg):
        U[i]=True
        q.append(i)
for i in range(N-M+1):
    c_d(i)
#print(q)
while(len(q)!=0):
    #print(q)
    i=q.popleft()
    for j in range(M):
        S[i+j]="#"
    #print(i,i-M+1,i+M-1,N-M+1)
    for j in range(max(i-M+1,0),min(i+M,N-M+1)):
        c_d(j)
    #print(S)
for i in range(N):
    if(S[i]!="#"):
        exit(print("No"))
exit(print("Yes"))

Submission Info

Judge Result