結果
問題 | No.1496 不思議な数え上げ |
ユーザー | penguinman |
提出日時 | 2021-04-25 07:33:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,107 ms / 3,000 ms |
コード長 | 3,482 bytes |
コンパイル時間 | 896 ms |
コンパイル使用メモリ | 87,024 KB |
実行使用メモリ | 123,924 KB |
最終ジャッジ日時 | 2023-09-23 03:33:51 |
合計ジャッジ時間 | 35,395 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,312 KB |
testcase_01 | AC | 75 ms
71,284 KB |
testcase_02 | AC | 74 ms
71,428 KB |
testcase_03 | AC | 805 ms
123,568 KB |
testcase_04 | AC | 999 ms
123,588 KB |
testcase_05 | AC | 1,006 ms
123,812 KB |
testcase_06 | AC | 492 ms
123,764 KB |
testcase_07 | AC | 500 ms
123,560 KB |
testcase_08 | AC | 490 ms
123,544 KB |
testcase_09 | AC | 475 ms
123,376 KB |
testcase_10 | AC | 469 ms
123,688 KB |
testcase_11 | AC | 466 ms
123,460 KB |
testcase_12 | AC | 783 ms
123,724 KB |
testcase_13 | AC | 605 ms
123,592 KB |
testcase_14 | AC | 572 ms
123,680 KB |
testcase_15 | AC | 661 ms
123,796 KB |
testcase_16 | AC | 651 ms
123,728 KB |
testcase_17 | AC | 941 ms
123,812 KB |
testcase_18 | AC | 1,004 ms
123,788 KB |
testcase_19 | AC | 953 ms
123,820 KB |
testcase_20 | AC | 983 ms
123,512 KB |
testcase_21 | AC | 1,038 ms
123,536 KB |
testcase_22 | AC | 981 ms
123,624 KB |
testcase_23 | AC | 1,023 ms
123,504 KB |
testcase_24 | AC | 1,016 ms
123,528 KB |
testcase_25 | AC | 779 ms
123,924 KB |
testcase_26 | AC | 799 ms
123,612 KB |
testcase_27 | AC | 1,107 ms
120,960 KB |
testcase_28 | AC | 1,075 ms
120,992 KB |
testcase_29 | AC | 1,085 ms
120,920 KB |
testcase_30 | AC | 1,088 ms
120,940 KB |
testcase_31 | AC | 1,074 ms
120,872 KB |
testcase_32 | AC | 906 ms
117,928 KB |
testcase_33 | AC | 580 ms
100,876 KB |
testcase_34 | AC | 589 ms
97,076 KB |
testcase_35 | AC | 203 ms
80,460 KB |
testcase_36 | AC | 923 ms
117,476 KB |
testcase_37 | AC | 642 ms
103,804 KB |
testcase_38 | AC | 618 ms
99,992 KB |
testcase_39 | AC | 831 ms
108,384 KB |
testcase_40 | AC | 533 ms
94,976 KB |
testcase_41 | AC | 809 ms
109,432 KB |
ソースコード
# Refernce: https://atcoder.jp/contests/practice2/submissions/16814531 class SegTree(): def __init__(self, a, func, idem): # the number of nodes is 2n - 1 self.n = 1 << len(a).bit_length() self.size = len(a) self.func = func self.idem = idem # Identity element self.node = [idem] * (2 * self.n - 1) for i in range(len(a) + self.n - 2, -1, -1): if i >= self.n - 1: self.node[i] = a[i - self.n + 1] else: self.node[i] = self.func(self.node[2 * i + 1], self.node[2 * i + 2]) def get(self, x): return self.node[x + self.n - 1] def set(self, x, val): x += self.n - 1 self.node[x] = val while x > 0: x = (x - 1) >> 1 self.node[x] = self.func(self.node[2*x+1], self.node[2*x+2]) return def prod(self, l, r): L, R = l + self.n, r + self.n s_l, s_r = self.idem, self.idem while L < R: if R & 1: R -= 1 s_r = self.func(self.node[R-1], s_r) if L & 1: s_l = s_l = self.func(s_l, self.node[L-1]) L += 1 L >>= 1 R >>= 1 return self.func(s_l, s_r) def max_right(self, l, val): if l == self.size: return self.size L = l + self.n s = self.idem while 1: while L % 2 == 0: L >>= 1 if not val(self.func(s, self.node[L - 1])): while L < self.n: L <<= 1 if val(self.func(s, self.node[L-1])): s = self.func(s, self.node[L-1]) L += 1 return L - self.n s = self.func(s, self.node[L - 1]) L += 1 if (L & -L) == L: return self.size def min_left(self, r, val): if r == 0: return 0 R = r + self.n s = self.idem while True: R -= 1 while R > 1 and R % 2: R >>= 1 if not val(self.func(self.node[R - 1], s)): while R < self.n: R = (R << 1) + 1 if val(self.func(self.node[R - 1], s)): s = self.func(self.node[R - 1], s) R -= 1 return R + 1 - self.n s = self.func(self.node[R - 1], s) if (R & -R) == R: return 0 import sys input=sys.stdin.readline import bisect inf = int(1e20) N = int(input()) P = list(map(int, input().split())) A = list(map(int, input().split())) rev = [0]*N dp = [0]*(N+1) for i in range(N): dp[i+1] = dp[i]+P[i] P[i] -= 1 rev[P[i]] = i seg = SegTree(P, min, inf) for i in range(N): ans = 0 left = seg.min_left(rev[i], lambda z: i <= z) right = seg.max_right(rev[i], lambda z: i <= z) left = max(left-1, -1) right = min(right, N) if rev[i]-left < right-rev[i]: for l in range(left+1, rev[i]+1): r = bisect.bisect_right(dp, dp[l]+A[i]) r -= 2 r = max(r, rev[i]-1) r = min(r, right-1) ans += r-rev[i]+1 else: for r in range(rev[i], right): l = bisect.bisect_left(dp, dp[r+1]-A[i]) l = max(l, left+1) l = min(l, rev[i]+1) ans += rev[i]-l+1 print(ans)