結果
問題 | No.1031 いたずら好きなお姉ちゃん |
ユーザー | maspy |
提出日時 | 2020-04-17 23:09:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 758 ms / 3,500 ms |
コード長 | 2,100 bytes |
コンパイル時間 | 159 ms |
コンパイル使用メモリ | 82,100 KB |
実行使用メモリ | 116,468 KB |
最終ジャッジ日時 | 2024-04-14 15:27:39 |
合計ジャッジ時間 | 23,711 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
54,060 KB |
testcase_01 | AC | 41 ms
53,144 KB |
testcase_02 | AC | 42 ms
53,204 KB |
testcase_03 | AC | 121 ms
77,896 KB |
testcase_04 | AC | 121 ms
77,720 KB |
testcase_05 | AC | 120 ms
77,928 KB |
testcase_06 | AC | 122 ms
77,544 KB |
testcase_07 | AC | 118 ms
77,932 KB |
testcase_08 | AC | 117 ms
77,656 KB |
testcase_09 | AC | 123 ms
77,976 KB |
testcase_10 | AC | 120 ms
77,292 KB |
testcase_11 | AC | 343 ms
107,316 KB |
testcase_12 | AC | 334 ms
104,488 KB |
testcase_13 | AC | 383 ms
113,224 KB |
testcase_14 | AC | 355 ms
108,244 KB |
testcase_15 | AC | 377 ms
110,820 KB |
testcase_16 | AC | 332 ms
106,816 KB |
testcase_17 | AC | 370 ms
112,156 KB |
testcase_18 | AC | 384 ms
110,536 KB |
testcase_19 | AC | 406 ms
111,936 KB |
testcase_20 | AC | 384 ms
113,388 KB |
testcase_21 | AC | 388 ms
110,892 KB |
testcase_22 | AC | 354 ms
106,584 KB |
testcase_23 | AC | 343 ms
107,520 KB |
testcase_24 | AC | 404 ms
111,428 KB |
testcase_25 | AC | 387 ms
113,260 KB |
testcase_26 | AC | 365 ms
110,680 KB |
testcase_27 | AC | 345 ms
109,476 KB |
testcase_28 | AC | 385 ms
113,540 KB |
testcase_29 | AC | 404 ms
113,628 KB |
testcase_30 | AC | 394 ms
111,108 KB |
testcase_31 | AC | 414 ms
112,916 KB |
testcase_32 | AC | 428 ms
113,660 KB |
testcase_33 | AC | 424 ms
112,664 KB |
testcase_34 | AC | 363 ms
116,468 KB |
testcase_35 | AC | 592 ms
113,876 KB |
testcase_36 | AC | 528 ms
114,000 KB |
testcase_37 | AC | 555 ms
113,936 KB |
testcase_38 | AC | 719 ms
110,872 KB |
testcase_39 | AC | 598 ms
112,892 KB |
testcase_40 | AC | 677 ms
113,272 KB |
testcase_41 | AC | 633 ms
111,160 KB |
testcase_42 | AC | 644 ms
113,176 KB |
testcase_43 | AC | 620 ms
113,368 KB |
testcase_44 | AC | 602 ms
112,784 KB |
testcase_45 | AC | 641 ms
111,476 KB |
testcase_46 | AC | 741 ms
113,504 KB |
testcase_47 | AC | 547 ms
113,492 KB |
testcase_48 | AC | 559 ms
115,480 KB |
testcase_49 | AC | 715 ms
113,516 KB |
testcase_50 | AC | 758 ms
113,724 KB |
testcase_51 | AC | 348 ms
114,696 KB |
testcase_52 | AC | 323 ms
114,768 KB |
testcase_53 | AC | 326 ms
115,404 KB |
testcase_54 | AC | 40 ms
52,804 KB |
testcase_55 | AC | 39 ms
53,576 KB |
ソースコード
#!/usr/bin/ python3.8 import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines class SegTree: """ segment tree with point modification and range product access. """ data_unit = 1 << 30 data_f = min def __init__(self, N): self.N = N self.data = [self.data_unit] * (N + N) def build(self, raw_data): data = self.data f = self.data_f N = self.N data[N:] = raw_data[:] for i in range(N - 1, 0, -1): data[i] = f(data[i << 1], data[i << 1 | 1]) def set_val(self, i, x): data = self.data f = self.data_f i += self.N data[i] = x while i > 1: i >>= 1 data[i] = f(data[i << 1], data[i << 1 | 1]) def fold(self, L, R): """ compute for [L, R) """ vL = vR = self.data_unit data = self.data f = self.data_f L += self.N R += self.N while L < R: if L & 1: vL = f(vL, data[L]) L += 1 if R & 1: R -= 1 vR = f(data[R], vR) L >>= 1 R >>= 1 return f(vL, vR) N, *A = map(int, read().split()) def solve(A): # 小・大の順 A = [0] + A + [N + 1] stack = [N + 1] seg = SegTree(len(A)) seg.build(A) next_high = [N + 1] * (N + 2) for n in range(N, -1, -1): x = A[n] while x > A[stack[-1]]: stack.pop() next_high[n] = stack[-1] stack.append(n) dp = [None] * 17 dp[0] = next_high for n in range(1, 17): prev = dp[n - 1] dp[n] = [prev[prev[i]] for i in range(N + 2)] def bin_search(i): a = A[i] R = len(A) - 2 ret = 0 for n in range(16, -1, -1): m = dp[n][i] if m <= R and seg.fold(i + 1, m) >= a: ret += 1 << n i = m return ret return sum(bin_search(i) for i in range(1, N + 1)) print(solve(A) + solve(A[::-1]))