結果

問題 No.2697 Range LIS Query
コンテスト
ユーザー nouka28
提出日時 2024-02-03 16:26:21
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 8,440 ms / 10,000 ms
コード長 5,554 bytes
コンパイル時間 564 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 276,200 KB
最終ジャッジ日時 2024-09-28 12:36:11
合計ジャッジ時間 76,871 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing
def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

    return x

class LazySegTree:
    def __init__(
            self,
            op: typing.Callable[[typing.Any, typing.Any], typing.Any],
            e: typing.Any,
            mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],
            composition: typing.Callable[[typing.Any, typing.Any], typing.Any],
            id_: typing.Any,
            v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = id_

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)
        self._lz = [self._id] * self._size
        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def apply(self, left: int, right: typing.Optional[int] = None,
              f: typing.Optional[typing.Any] = None) -> None:
        assert f is not None

        if right is None:
            p = left
            assert 0 <= left < self._n

            p += self._size
            for i in range(self._log, 0, -1):
                self._push(p >> i)
            self._d[p] = self._mapping(f, self._d[p])
            for i in range(1, self._log + 1):
                self._update(p >> i)
        else:
            assert 0 <= left <= right <= self._n
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right - 1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log + 1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right - 1) >> i)

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

    def _all_apply(self, k: int, f: typing.Any) -> None:
        self._d[k] = self._mapping(f, self._d[k])
        if k < self._size:
            self._lz[k] = self._composition(f, self._lz[k])

    def _push(self, k: int) -> None:
        self._all_apply(2 * k, self._lz[k])
        self._all_apply(2 * k + 1, self._lz[k])
        self._lz[k] = self._id

K=4
def id(i,j):return i*K+j
def expand(z):
    for l in range(1,K):
        for i in range(K-l):
            z[id(i,i+l)]=max(z[id(i,i+l)],z[id(i+1,i+l)],z[id(i,i+l-1)])
    return z

def op(x,y):
    x=expand(x);y=expand(y)
    z=[0]*(K*K+1);z[K*K]=x[K*K]+y[K*K]
    for i in range(K):
        for j in range(i,K):
            for k in range(j,K):z[id(i,k)]=max(z[id(i,k)],x[id(i,j)]+y[id(j,k)])
    return z

def mapping(f:int,x):
    if f==-1:return x
    z=[0]*(K*K+1);z[K*K]=x[K*K]
    z[id(f,f)]=x[K*K]
    return z

def composition(f:int,g:int):
    if f==-1:return g
    return f


N=int(input())
A=list(map(int,input().split()))
D=[]
for i in range(N):
    A[i]-=1
    z=[0]*(K*K+1);z[K*K]=1
    z[id(A[i],A[i])]=1
    D.append(z)
    
seg=LazySegTree(op,[0]*(K*K+1),mapping,composition,-1,D)

Q=int(input())
ans=[]
while Q:
    Q-=1
    q=list(map(int,input().split()))
    if q[0]==1:
        l,r=q[1],q[2];l-=1
        res=seg.prod(l,r);res=expand(res)
        print(res[id(0,K-1)])
    if q[0]==2:
        l,r,x=q[1],q[2],q[3]
        l-=1;x-=1
        seg.apply(l,r,x)
0