結果
問題 | No.1496 不思議な数え上げ |
ユーザー | penguinman |
提出日時 | 2021-04-25 03:56:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 988 ms / 3,000 ms |
コード長 | 3,477 bytes |
コンパイル時間 | 1,596 ms |
コンパイル使用メモリ | 86,828 KB |
実行使用メモリ | 123,668 KB |
最終ジャッジ日時 | 2023-09-23 03:32:06 |
合計ジャッジ時間 | 34,116 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
70,748 KB |
testcase_01 | AC | 75 ms
70,704 KB |
testcase_02 | AC | 74 ms
70,708 KB |
testcase_03 | AC | 799 ms
120,864 KB |
testcase_04 | AC | 973 ms
123,160 KB |
testcase_05 | AC | 976 ms
123,076 KB |
testcase_06 | AC | 460 ms
123,192 KB |
testcase_07 | AC | 471 ms
123,340 KB |
testcase_08 | AC | 454 ms
123,044 KB |
testcase_09 | AC | 448 ms
123,424 KB |
testcase_10 | AC | 444 ms
123,392 KB |
testcase_11 | AC | 443 ms
123,352 KB |
testcase_12 | AC | 767 ms
123,272 KB |
testcase_13 | AC | 581 ms
123,172 KB |
testcase_14 | AC | 529 ms
123,156 KB |
testcase_15 | AC | 621 ms
123,172 KB |
testcase_16 | AC | 626 ms
122,936 KB |
testcase_17 | AC | 878 ms
123,284 KB |
testcase_18 | AC | 897 ms
123,440 KB |
testcase_19 | AC | 838 ms
123,620 KB |
testcase_20 | AC | 861 ms
123,064 KB |
testcase_21 | AC | 928 ms
123,000 KB |
testcase_22 | AC | 898 ms
123,180 KB |
testcase_23 | AC | 946 ms
123,280 KB |
testcase_24 | AC | 950 ms
123,196 KB |
testcase_25 | AC | 708 ms
123,668 KB |
testcase_26 | AC | 707 ms
123,316 KB |
testcase_27 | AC | 988 ms
120,756 KB |
testcase_28 | AC | 968 ms
120,376 KB |
testcase_29 | AC | 958 ms
120,752 KB |
testcase_30 | AC | 955 ms
120,588 KB |
testcase_31 | AC | 961 ms
120,544 KB |
testcase_32 | AC | 780 ms
117,684 KB |
testcase_33 | AC | 517 ms
100,152 KB |
testcase_34 | AC | 535 ms
96,228 KB |
testcase_35 | AC | 198 ms
79,992 KB |
testcase_36 | AC | 800 ms
117,352 KB |
testcase_37 | AC | 566 ms
102,360 KB |
testcase_38 | AC | 566 ms
99,484 KB |
testcase_39 | AC | 744 ms
109,272 KB |
testcase_40 | AC | 494 ms
94,588 KB |
testcase_41 | AC | 734 ms
109,648 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 = 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)