結果

問題 No.404 部分門松列
ユーザー maspy
提出日時 2020-04-09 01:22:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 708 ms / 2,000 ms
コード長 2,504 bytes
コンパイル時間 195 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 176,308 KB
最終ジャッジ日時 2024-07-19 05:58:37
合計ジャッジ時間 14,425 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from bisect import bisect_right
class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)
    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data
    def __repr__(self):
        return self.data.__repr__()
    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s
    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i
    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1
N = int(readline())
A = tuple(map(int, readline().split()))
A_nums = [0] + sorted(set(A))
convert = {x: i for i, x in enumerate(A_nums)}
inds = [[] for _ in range(len(A_nums))]
for i, x in enumerate(A, 1):
    r = convert[x]
    inds[r].append(i)
filled = 0
bit = BinaryIndexedTree([0] * (N + 1))
imos = [0] * (N + 1)
count = [0] * (N + 1)
for ind in inds:
    n = len(ind)
    for m, i in enumerate(ind):
        if m < n - 1:
            imos[i + 1] += (m + 1) * (n - m - 1)
        imos[i] -= m * (n - m)
        left = bit.get_sum(i)
        right = filled - left
        count[i] = left * right
        left = i - 1 - m - left
        right = N - filled - n - left
        count[i] += left * right
    for i in ind:
        bit.add(i, 1)
    filled += n
for i in range(1, N + 1):
    imos[i] += imos[i - 1]
    count[i] -= imos[i]
num_to_cnt = [0] * len(A_nums)
for x, y in zip(A, count[1:]):
    r = convert[x]
    num_to_cnt[r] += y
for i in range(1, len(num_to_cnt)):
    num_to_cnt[i] += num_to_cnt[i - 1]
Q = int(readline())
m = map(int, read().split())
for L, H in zip(m, m):
    x = num_to_cnt[bisect_right(A_nums, H) - 1] - num_to_cnt[bisect_right(A_nums, L - 1) - 1]
    print(x)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0