#652877 (PyPy3) No.1496 不思議な数え上げ

• 問題: No.1496 不思議な数え上げ
• ユーザー: shotoyoo
• 提出日時: 2021-04-30 22:58:14
• 言語: PyPy3 (7.3.15)
• 結果: TLE
• 実行時間: -
• コード長: 2,417 bytes
• コンパイル時間: 258 ms
• コンパイル使用メモリ: 82,188 KB
• 実行使用メモリ: 136,264 KB
• 最終ジャッジ日時: 2024-07-19 02:44:07
• 合計ジャッジ時間: 7,992 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 3 TLE * 1 -- * 35

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
class BIT:
    ### BIT binary
    def __init__(self, n, values=None):
        self.bit = [0]*(n+1)
        self.n = n
        self.total = 0
        if values is not None:
            for i,v in enumerate(values):
                self.add(i,v)
                self.total += v
    def check(self):
        l = []
        prv = 0
        for i in range(1,self.n+1):
            val = self.query(i)
            l.append(val-prv)
            prv = val
        print(" ".join(map(str, l)))
    #a1 ~ aiまでの和 O(logn)
    def query(self,i):
        res = 0
        while i > 0:
            res += self.bit[i]
            # res %= M
            i -= i&(-i)
        return res
    def get(self,i):
        return self.query(i+1) - self.query(i)
    #ai += x(logN)
    def add(self,i,x):
        i += 1
        if i==0:
            raise RuntimeError
        self.total += x
        while i <= self.n:
            self.bit[i] += x
            # self.bit[i] %= M
            i += i&(-i)
    def index(self, v):
        """a0,...,aiの和がv以上になる最小のindexを求める
        存在しないとき配列サイズを返す
        """
        if v <= 0:
            return 0
        if self.total<v:
            return self.n
        x = 0
        r = 1
        while r < self.n:
            r = r << 1;
        ll = r
        while ll>0:
            if x+ll<self.n and self.bit[x+ll]<v:
                v -= self.bit[x+ll]
                x += ll
            ll = ll>>1
        return x
n = int(input())
p = list(map(lambda i: int(i), input().split()))
A = list(map(int, input().split()))
cum = [0]
for v in p:
    cum.append(cum[-1]+v)
index = [-1]*(n+1)
for i,v in enumerate(p):
    index[v] = i
bit = BIT(n)
ans = []
for i in range(1,n+1):
    a = A[i-1]
    ind = index[i]
    if a==0:
        bit.add(ind, 1)
        ans.append(0)
        continue
    v = bit.query(ind)
    l = bit.index(v)
    if v==0:
        l = -1
    r = bit.index(v+1)
#     print(i,ind,l,r,a)
    j = ind+1
    val = 0
    for ii in range(l+1, ind+1):
        while j+1<=r and cum[j+1]-cum[ii]<=a:
            j += 1
        if cum[j]-cum[ii]<=a:
            val += (j-ind)
    bit.add(ind, 1)
    ans.append(val)
write("\n".join(map(str, ans)))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX