結果

問題 No.672 最長AB列
ユーザー McGregorshMcGregorsh
提出日時 2022-07-01 22:38:34
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,829 bytes
コンパイル時間 884 ms
コンパイル使用メモリ 82,428 KB
実行使用メモリ 103,808 KB
最終ジャッジ日時 2024-05-04 16:59:53
合計ジャッジ時間 5,599 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
83,456 KB
testcase_01 AC 103 ms
83,584 KB
testcase_02 AC 109 ms
83,584 KB
testcase_03 AC 116 ms
83,568 KB
testcase_04 AC 111 ms
83,452 KB
testcase_05 AC 122 ms
83,584 KB
testcase_06 AC 103 ms
83,560 KB
testcase_07 WA -
testcase_08 AC 103 ms
83,456 KB
testcase_09 AC 1,725 ms
102,992 KB
testcase_10 AC 130 ms
89,432 KB
testcase_11 AC 129 ms
89,472 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 158 ms
100,480 KB
testcase_18 AC 131 ms
89,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   s = input()
   
   coua = s.count('A')
   coub = s.count('B')
   que = deque()
   for i in range(len(s)):
   	  que.append(s[i])
   
   while coua != coub:
   	  if coua > coub:
   	  	  now = 'A'
   	  else:
   	  	  now = 'B'
   	  
   	  if que[0] == que[-1]:
   	  	  if que[0] == now:
   	  	  	
   	  	  	  cou1 = 0
   	  	  	  for i in range(len(que)):
   	  	  	  	  if que[i] == now:
   	  	  	  	  	  cou1 += 1
   	  	  	  	  else:
   	  	  	  	  	  break
   	  	  	  cou2 = 0
   	  	  	  for j in range(len(que)-1, -1, -1):
   	  	  	  	  if que[j] == now:
   	  	  	  	  	  cou2 += 1
   	  	  	  	  else:
   	  	  	  	  	  break
   	  	  	  if cou1 > cou2:
   	  	  	  	  for k in range(cou1):
   	  	  	  	  	  num = que.popleft()
   	  	  	  	  	  if num == 'A':
   	  	  	  	  	  	  coua -= 1
   	  	  	  	  	  else:
   	  	  	  	  	  	  coub -= 1
   	  	  	  	  	  if coua == coub:
   	  	  	  	  	  	  print(coua + coub)
   	  	  	  	  	  	  exit()
   	  	  	  else:
   	  	  	  	  for l in range(cou2):
   	  	  	  	  	  num = que.pop()
   	  	  	  	  	  if num == 'A':
   	  	  	  	  	  	  coua -= 1
   	  	  	  	  	  else:
   	  	  	  	  	  	  coub -= 1
   	  	  	  	  	  if coua == coub:
   	  	  	  	  	  	  print(coua + coub)
   	  	  	  	  	  	  exit()
   	  	  else:
   	  	  	  cou1 = 0
   	  	  	  for i in range(len(que)):
   	  	  	  	  if que[i] != now:
   	  	  	  	  	  cou1 += 1
   	  	  	  	  else:
   	  	  	  	  	  break
   	  	  	  cou2 = 0
   	  	  	  for j in range(len(que)-1, -1, -1):
   	  	  	  	  if que[j] != now:
   	  	  	  	  	  cou2 += 1
   	  	  	  	  else:
   	  	  	  	  	  break
   	  	  	  if cou1 < cou2:
   	  	  	  	  for k in range(cou1):
   	  	  	  	  	  num = que.popleft()
   	  	  	  	  	  if num == 'A':
   	  	  	  	  	  	  coua -= 1
   	  	  	  	  	  else:
   	  	  	  	  	  	  coub -= 1
   	  	  	  	  	  if coua == coub:
   	  	  	  	  	  	  print(coua + coub)
   	  	  	  	  	  	  exit()
   	  	  	  else:
   	  	  	  	  for l in range(cou2):
   	  	  	  	  	  num = que.pop()
   	  	  	  	  	  if num == 'A':
   	  	  	  	  	  	  coua -= 1
   	  	  	  	  	  else:
   	  	  	  	  	  	  coub -= 1
   	  	  	  	  	  if coua == coub:
   	  	  	  	  	  	  print(coua + coub)
   	  	  	  	  	  	  exit()
   	  else:
   	  	  if que[0] == now:
   	  	  	  num = que.popleft()
   	  	  else:
   	  	  	  num = que.pop()
   	  	  
   	  	  if num == 'A':
   	  	  	  coua -= 1
   	  	  else:
   	  	  	  coub -= 1
   	  
   	  #print(que)
   print(coua + coub)
   
   
if __name__ == '__main__':
    main()
0