#1023510 (PyPy3) No.2796 Small Matryoshka

• 問題: No.2796 Small Matryoshka
• ユーザー: LyricalMaestro
• 提出日時: 2024-10-30 00:36:02
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 911 ms / 2,000 ms
• コード長: 1,993 bytes
• コンパイル時間: 748 ms
• コンパイル使用メモリ: 82,328 KB
• 実行使用メモリ: 203,636 KB
• 最終ジャッジ日時: 2024-10-30 00:36:12
• 合計ジャッジ時間: 10,144 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

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
## https://yukicoder.me/problems/no/2796
MAX_INT = 10 ** 18
class BinaryIndexTree:
    """
    フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス
    """
    def __init__(self, size):
        self.size = size
        self.array = [0] * (size + 1)
    
    def add(self, x, a):
        index = x
        while index <= self.size:
            self.array[index] += a
            index += index & (-index)
    
    def sum(self, x):
        index = x
        ans = 0
        while index > 0:
            ans += self.array[index]
            index -= index & (-index)
        return ans
    def least_upper_bound(self, value):
        if self.sum(self.size) < value:
            return -1
        elif value <= 0:
            return 0
        m = 1
        while m < self.size:
            m *= 2
        k = 0
        k_sum = 0
        while m > 0:
            k0 = k + m
            if k0 < self.size:
                if k_sum + self.array[k0] < value:
                    k_sum += self.array[k0]
                    k += m
            m //= 2
        if k < self.size:
            return k + 1
        else:
            return -1
def main():
    N = int(input())
    rR = []
    for _ in range(N):
        r, R = map(int, input().split())
        rR.append((r, R))
    rR.sort(key=lambda x : x[0], reverse=True)
    # 座標圧縮
    r_set = set()
    for r, R in rR:
        r_set.add(r)
        r_set.add(R)
    r_list = list(r_set)
    r_list.sort()
    r_map = {}
    for i, r in enumerate(r_list):
        r_map[r] = i + 1
    # BinaryIndexTree
    bit = BinaryIndexTree(len(r_list))
    for r, R in rR:
        x = bit.sum(bit.size) - bit.sum(r_map[R] - 1)
        if x == 0:
            bit.add(r_map[r], 1)
        else:
            r_ = bit.least_upper_bound(bit.sum(r_map[R] - 1) + 1)
            bit.add(r_, -1)
            bit.add(r_map[r], 1)
    
    a = bit.sum(bit.size)
    print(a - 1)
    
if __name__ == "__main__":
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX