Submission #61191871

---

Source Code Expand

from collections import defaultdict, deque
import bisect
import math
from heapq import *
import itertools
import sys
from functools import cache
sys.setrecursionlimit(10**8)

K = int(input())
S = input()
T = input()
s = len(S)
t = len(T)
def ld(a, b, c):
    if c > 2:
        return c
    if not s - a:
        return c
    if not t - b:
        return c
    if S[a] == T[b]:
        return ld(a+1, b+1, c)
    if c >= 1:
        return 2
    if s == t:
        return ld(a+1,b+1, 1)
    elif s > t:
        return ld(a+1,b, 1)
    else:
        return ld(a,b+1, 1)

if abs(len(S)-len(T))>1:
    print('No')
else:
    dist = ld(0, 0, 0)
    if dist <= K:
        print('Yes')
    else:
        print('No')

Submission Info

Judge Result