Submission #7089000

---

Source Code Expand

from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**7)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7
mo=998244353
input=sys.stdin.readline
n=I()
s=input()+' '
b='ABXY'
com=[i+j for i in b for j in b]
ans=10**10
for l in com:
    for r in com:
        c=0
        i=0
        if l==r:
            continue
        while i<n:
            c+=1
            if s[i:i+2] in (l,r):
                i+=2
            else:
                i+=1
        ans=min(ans,c)
print(ans)

Submission Info

Judge Result