結果
問題 | No.672 最長AB列 |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 23:49:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 401 ms / 2,000 ms |
コード長 | 1,964 bytes |
コンパイル時間 | 1,493 ms |
コンパイル使用メモリ | 86,788 KB |
実行使用メモリ | 173,992 KB |
最終ジャッジ日時 | 2023-08-21 10:52:02 |
合計ジャッジ時間 | 8,993 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
91,792 KB |
testcase_01 | AC | 247 ms
91,848 KB |
testcase_02 | AC | 233 ms
91,724 KB |
testcase_03 | AC | 246 ms
92,028 KB |
testcase_04 | AC | 237 ms
91,892 KB |
testcase_05 | AC | 246 ms
92,028 KB |
testcase_06 | AC | 240 ms
92,032 KB |
testcase_07 | AC | 251 ms
91,924 KB |
testcase_08 | AC | 238 ms
92,032 KB |
testcase_09 | AC | 401 ms
173,992 KB |
testcase_10 | AC | 332 ms
132,408 KB |
testcase_11 | AC | 324 ms
132,356 KB |
testcase_12 | AC | 284 ms
108,680 KB |
testcase_13 | AC | 277 ms
108,916 KB |
testcase_14 | AC | 280 ms
108,816 KB |
testcase_15 | AC | 284 ms
108,720 KB |
testcase_16 | AC | 280 ms
108,708 KB |
testcase_17 | AC | 330 ms
136,076 KB |
testcase_18 | AC | 279 ms
120,324 KB |
ソースコード
import sys, re from fractions import Fraction 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, ROUND_HALF_UP 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() N = len(S) count = [0] * N for i in range(N): if S[i] == 'A': count[i] += 1 else: count[i] -= 1 AC = list(accumulate(count)) P = defaultdict(list) Pcou = defaultdict(int) for i in range(N): P[AC[i]].append(i) Pcou[AC[i]] += 1 for key, value in P.items(): P[key].sort() now = 0 ans = 0 for i in range(N): if Pcou[now] > 0: point = P[now][-1] cost = point - i + 1 ans = max(ans, cost) if S[i] == 'A': now += 1 else: now -= 1 print(ans) if __name__ == '__main__': main()