結果
問題 | No.457 (^^*) |
ユーザー | McGregorsh |
提出日時 | 2022-06-25 16:23:48 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,426 bytes |
コンパイル時間 | 347 ms |
コンパイル使用メモリ | 82,356 KB |
実行使用メモリ | 933,920 KB |
最終ジャッジ日時 | 2024-11-14 15:15:15 |
合計ジャッジ時間 | 11,863 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | AC | 119 ms
83,480 KB |
testcase_02 | AC | 119 ms
83,176 KB |
testcase_03 | AC | 118 ms
83,596 KB |
testcase_04 | AC | 118 ms
83,332 KB |
testcase_05 | AC | 118 ms
83,128 KB |
testcase_06 | AC | 117 ms
83,092 KB |
testcase_07 | AC | 164 ms
90,084 KB |
testcase_08 | AC | 173 ms
91,964 KB |
testcase_09 | AC | 211 ms
99,988 KB |
testcase_10 | AC | 429 ms
152,256 KB |
testcase_11 | AC | 1,366 ms
322,428 KB |
testcase_12 | TLE | - |
testcase_13 | AC | 232 ms
89,772 KB |
testcase_14 | AC | 180 ms
89,988 KB |
testcase_15 | TLE | - |
testcase_16 | AC | 190 ms
89,760 KB |
testcase_17 | AC | 157 ms
89,636 KB |
testcase_18 | AC | 122 ms
83,592 KB |
testcase_19 | MLE | - |
ソースコード
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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): s = input() s_kakko = [] g_kakko = [] asuta = [] me = [0] * (len(s)) for i in range(len(s)): if s[i] == '(': s_kakko.append(i) elif s[i] == ')': g_kakko.append(i) elif s[i] == '*': asuta.append(i) elif s[i] == '^': me[i] += 1 total_kakko = [] for i in range(len(s_kakko)): for j in range(len(g_kakko)): if s_kakko[i] > g_kakko[j]: continue total_kakko.append([s_kakko[i], g_kakko[j]]) accumu_me = list(accumulate(me)) hidari = 0 migi = 0 for i in range(len(total_kakko)): left = total_kakko[i][0] right = total_kakko[i][1] left_asuta = bisect_right(asuta, left) if left_asuta == len(asuta): continue score = accumu_me[right] - accumu_me[asuta[left_asuta]] if score >= 2: migi += 1 for i in range(len(total_kakko)): left = total_kakko[i][0] right = total_kakko[i][1] right_asuta = bisect_left(asuta, right) if right_asuta == 0: continue score = accumu_me[asuta[right_asuta-1]] - accumu_me[left] if score >= 2: hidari += 1 print(hidari, migi) if __name__ == '__main__': main()