結果

問題 No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー rpy3cpprpy3cpp
提出日時 2015-06-22 20:21:37
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 1,826 ms / 5,000 ms
コード長 4,551 bytes
コンパイル時間 77 ms
コンパイル使用メモリ 11,296 KB
実行使用メモリ 16,540 KB
最終ジャッジ日時 2023-09-21 23:43:20
合計ジャッジ時間 10,335 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
8,612 KB
testcase_01 AC 18 ms
8,608 KB
testcase_02 AC 18 ms
8,556 KB
testcase_03 AC 18 ms
8,672 KB
testcase_04 AC 18 ms
8,564 KB
testcase_05 AC 23 ms
8,588 KB
testcase_06 AC 81 ms
9,072 KB
testcase_07 AC 22 ms
8,624 KB
testcase_08 AC 27 ms
8,900 KB
testcase_09 AC 455 ms
12,556 KB
testcase_10 AC 353 ms
16,336 KB
testcase_11 AC 284 ms
11,028 KB
testcase_12 AC 449 ms
12,552 KB
testcase_13 AC 98 ms
9,288 KB
testcase_14 AC 692 ms
16,220 KB
testcase_15 AC 1,630 ms
16,400 KB
testcase_16 AC 1,206 ms
16,540 KB
testcase_17 AC 904 ms
16,496 KB
testcase_18 AC 1,826 ms
16,492 KB
testcase_19 AC 596 ms
13,100 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class SplayArray(object):
    def __init__(self, size):
        self.cell_capacity = 1024
        self.capacity = self._calc_capacity(size)
        self.n_cells = self.capacity // self.cell_capacity
        self.values = [0] * self.n_cells
        self.totals = [0] * (self.n_cells * 2)

    def turn_on(self, L, R):
        self._turn_on(1, self.capacity, L, R)

    def turn_off(self, L, R):
        self._turn_off(1, self.capacity, L, R)

    def count(self, L, R):
        return self._count(1, self.capacity, L, R)

    def _calc_capacity(self, size):
        cap = self.cell_capacity
        while cap < size:
            cap <<= 1
        return cap

    def _turn_on(self, idx, cap, L, R):
        '''
        idx: self.totals 等における位置
        cap: self.totals[idx] に格納できるデータの数
        mid: 二分木における分水嶺に該当する値
        L: 開始点
        R: 終了点
        '''
        if self.totals[idx] == cap:
            return
        if L == 0 and R == cap - 1:
            self.totals[idx] = cap
            return
        if cap == self.cell_capacity:
            idx_val = idx - self.n_cells
            if self.totals[idx] == 0:
                self.values[idx_val] = (1 << (R + 1)) - (1 << L)
                self.totals[idx] = R + 1 - L
                return
            self.values[idx_val] |= (1 << (R + 1)) - (1 << L)
            self.totals[idx] = bin(self.values[idx_val]).count('1')
            return
        left = idx << 1
        right = left + 1
        if self.totals[idx] == 0:
            self.totals[left] = 0
            self.totals[right] = 0
        mid = cap >> 1
        if R < mid:
            self._turn_on(left, mid, L, R)
        elif L >= mid:
            self._turn_on(right, mid, L - mid, R - mid)
        else:
            self._turn_on(left, mid, L, mid - 1)
            self._turn_on(right, mid, 0, R - mid)
        self.totals[idx] = self.totals[left] + self.totals[right]

    def _turn_off(self, idx, cap, L, R):
        if self.totals[idx] == 0:
            return
        if L == 0 and R == cap - 1:
            self.totals[idx] = 0
            return
        if cap == self.cell_capacity:
            idx_val = idx - self.n_cells
            if self.totals[idx] == cap:
                self.values[idx_val] = (1 << cap) - 1 - (1 << (R + 1)) + (1 << L)
                self.totals[idx] = cap - R - 1 + L
                return
            self.values[idx_val] &= ~((1 << (R + 1)) - (1 << L))
            self.totals[idx] = bin(self.values[idx_val]).count('1')
            return
        left = idx << 1
        right = left + 1
        mid = cap >> 1
        if self.totals[idx] == cap:
            self.totals[left] = mid
            self.totals[right] = mid
        if R < mid:
            self._turn_off(left, mid, L, R)
        elif L >= mid:
            self._turn_off(right, mid, L - mid, R - mid)
        else:
            self._turn_off(left, mid, L, mid - 1)
            self._turn_off(right, mid, 0, R - mid)
        self.totals[idx] = self.totals[left] + self.totals[right]

    def _count(self, idx, cap, L, R):
        if self.totals[idx] == 0:
            return 0
        if self.totals[idx] == cap:
            return R + 1 - L
        if L == 0 and R == cap - 1:
            return self.totals[idx]
        if cap == self.cell_capacity:
            return bin(self.values[idx - self.n_cells] & ((1 << (R + 1)) - (1 << L))).count('1')
        left = idx << 1
        right = left + 1
        mid = cap >> 1
        if R < mid:
            return self._count(left, mid, L, R)
        if L >= mid:
            return self._count(right, mid, L - mid, R - mid)
        return self._count(left, mid, L, mid - 1) + self._count(right, mid, 0, R - mid)

if __name__ == '__main__':
    import sys
    data = sys.stdin.readlines()
    N = int(data[0])
    Q = int(data[1])
    teamA = SplayArray(N)
    teamB = SplayArray(N)
    scoreA = 0
    scoreB = 0
    for line in data[2:Q + 2]:
        x, l, r = map(int, line.split())
        if x == 0:
            bonusA = teamA.count(l, r)
            bonusB = teamB.count(l, r)
            if bonusA > bonusB:
                scoreA += bonusA
            elif bonusA < bonusB:
                scoreB += bonusB
        elif x == 1:
            teamA.turn_on(l, r)
            teamB.turn_off(l, r)
        elif x == 2:
            teamA.turn_off(l, r)
            teamB.turn_on(l, r)
    scoreA += teamA.count(0, N-1)
    scoreB += teamB.count(0, N-1)
    print('{} {}'.format(scoreA, scoreB))
0