#1001253 (PyPy3) No.2771 Personal Space

• 問題: No.2771 Personal Space
• ユーザー: LyricalMaestro
• 提出日時: 2024-08-10 04:21:30
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 949 ms / 2,000 ms
• コード長: 2,321 bytes
• コンパイル時間: 407 ms
• コンパイル使用メモリ: 82,384 KB
• 実行使用メモリ: 105,996 KB
• 最終ジャッジ日時: 2024-08-10 04:21:55
• 合計ジャッジ時間: 25,172 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 24

ソースコード

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
100
101
102
103
104
105
106
107
108
109
110
111
112
## https://yukicoder.me/problems/no/2771
import heapq
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 solve(N, M):
    array = [-1] * N
    array[M - 1] = 1
    bit = BinaryIndexTree(N)
    bit.add(M, 1)
    queue = []
    if M > 1:
        heapq.heappush(queue, (-(M - 1), 1))
    if N > M:
        heapq.heappush(queue, (-(N - M), N))
    ind = 2
    while len(queue) > 0:
        _, v = heapq.heappop(queue)
        array[v - 1] = ind
        ind += 1
        # 左側計算
        l = bit.sum(v)
        if l > 0:
            left = bit.least_upper_bound(l)
            if v - left > 1:
                d = (v - left) // 2
                heapq.heappush(queue, (-d, left + d))
        
        # 右側の計算
        if l + 1 <= bit.sum(bit.size):
            right = bit.least_upper_bound(l + 1)
            if right - v > 1:
                d= (right - v) // 2
                heapq.heappush(queue, (-d, v + d))
        
        bit.add(v, 1)
    return " ".join(map(str, array))
def main():
    T = int(input())
    answers = []
    for _ in range(T):
        N, M = map(int, input().split())
        ans = solve(N, M)
        answers.append(ans)
    for ans in answers:
        print(ans)
    
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX