#443623 (Python3) No.833 かっこいい電車

• 問題: No.833 かっこいい電車
• ユーザー: maspy
• 提出日時: 2020-03-13 21:36:58
• 言語: Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1)
• 結果: AC
• 実行時間: 632 ms / 2,000 ms
• コード長: 2,101 bytes
• コンパイル時間: 119 ms
• コンパイル使用メモリ: 12,800 KB
• 実行使用メモリ: 30,436 KB
• 最終ジャッジ日時: 2024-11-22 19:50:36
• 合計ジャッジ時間: 11,208 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 30

ソースコード

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
#!/usr/bin/env python3.8
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# %%
N, Q = map(int, readline().split())
A = [0] + list(map(int, readline().split()))
m = map(int, read().split())
QX = tuple(zip(m, m))
# %%
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
# %%
value = BinaryIndexedTree(A)
connection = [0] * (N + 1)
right_end_count = BinaryIndexedTree([0] + [1] * N)
for q, x in QX:
    if q == 1:
        if not connection[x]:
            connection[x] = 1
            right_end_count.add(x, -1)
    elif q == 2:
        if connection[x]:
            connection[x] -= 1
            right_end_count.add(x, 1)
    elif q == 3:
        value.add(x, 1)
    elif q == 4:
        k = right_end_count.get_sum(x - 1)
        if k == 0:
            L = 1
        else:
            L = right_end_count.find_kth_element(k) + 1
        R = right_end_count.find_kth_element(k + 1)
        S = value.get_sum(R) - value.get_sum(L - 1)
        print(S)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX