Submission #17,856

2025-09-19 20:08:48

pypy3

Accepted 75/75

70ms

23772 KiB

# UUID: 3f24804a-54bf-4e8c-9e36-3ef8d8927067
def f():
 N=int(input())
 s=input()
 T=[0]*N
 G=[-1]*N
 cur=0
 kov=-1
 for i in range(N-1,-1,-1):
  if s[i]=='T':
   cur+=1
  T[i]=cur
  if s[i]=='G':
   kov=i
  G[i]=kov
 res = 0
 for i in range(N):
  if s[i]=='A':
   if G[i]!=-1:
    res+=T[G[i]]
 print(res)

f()

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	43ms	19316 KiB
		2	Accepted	0/0	64ms	23676 KiB
		3	Accepted	3/3	39ms	19420 KiB
		4	Accepted	4/4	39ms	19348 KiB
		5	Accepted	4/4	39ms	19432 KiB
		6	Accepted	4/4	39ms	19428 KiB
		7	Accepted	4/4	43ms	19436 KiB
		8	Accepted	3/3	45ms	19468 KiB
		9	Accepted	3/3	39ms	19572 KiB
		10	Accepted	4/4	39ms	19428 KiB
		11	Accepted	4/4	43ms	19692 KiB
		12	Accepted	4/4	43ms	19564 KiB
		13	Accepted	4/4	39ms	19652 KiB
		14	Accepted	4/4	43ms	19788 KiB
		15	Accepted	3/3	57ms	23500 KiB
		16	Accepted	4/4	70ms	23524 KiB
		17	Accepted	4/4	56ms	23772 KiB
		18	Accepted	4/4	61ms	23560 KiB
		19	Accepted	4/4	57ms	23752 KiB
		20	Accepted	4/4	63ms	23612 KiB
		21	Accepted	3/3	52ms	23008 KiB
		22	Accepted	4/4	54ms	23368 KiB