Submission #11,370

2024-08-27 22:26:47

python3

Accepted 75/75

46ms

7440 KiB

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	17ms	3216 KiB
		2	Accepted	0/0	46ms	6376 KiB
		3	Accepted	3/3	17ms	3084 KiB
		4	Accepted	4/4	17ms	3028 KiB
		5	Accepted	4/4	17ms	3048 KiB
		6	Accepted	4/4	17ms	3048 KiB
		7	Accepted	4/4	17ms	3184 KiB
		8	Accepted	3/3	16ms	3088 KiB
		9	Accepted	3/3	16ms	3152 KiB
		10	Accepted	4/4	17ms	3100 KiB
		11	Accepted	4/4	16ms	3192 KiB
		12	Accepted	4/4	16ms	3176 KiB
		13	Accepted	4/4	16ms	3104 KiB
		14	Accepted	4/4	17ms	3176 KiB
		15	Accepted	3/3	43ms	6272 KiB
		16	Accepted	4/4	45ms	5676 KiB
		17	Accepted	4/4	41ms	7440 KiB
		18	Accepted	4/4	46ms	6684 KiB
		19	Accepted	4/4	46ms	5624 KiB
		20	Accepted	4/4	45ms	7312 KiB
		21	Accepted	3/3	45ms	6476 KiB
		22	Accepted	4/4	46ms	6416 KiB