結果

問題 No.2933 Range ROT Query
ユーザー loop0919loop0919
提出日時 2024-09-06 11:25:32
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,477 ms / 3,000 ms
コード長 9,185 bytes
コンパイル時間 950 ms
コンパイル使用メモリ 82,260 KB
実行使用メモリ 104,132 KB
最終ジャッジ日時 2024-10-02 00:27:28
合計ジャッジ時間 51,518 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
55,716 KB
testcase_01 AC 42 ms
55,120 KB
testcase_02 AC 42 ms
55,512 KB
testcase_03 AC 42 ms
55,656 KB
testcase_04 AC 47 ms
57,332 KB
testcase_05 AC 46 ms
57,184 KB
testcase_06 AC 50 ms
63,820 KB
testcase_07 AC 49 ms
58,844 KB
testcase_08 AC 42 ms
55,204 KB
testcase_09 AC 43 ms
55,828 KB
testcase_10 AC 52 ms
63,748 KB
testcase_11 AC 46 ms
56,784 KB
testcase_12 AC 1,077 ms
103,756 KB
testcase_13 AC 1,091 ms
103,660 KB
testcase_14 AC 1,114 ms
103,956 KB
testcase_15 AC 1,071 ms
103,868 KB
testcase_16 AC 1,139 ms
103,732 KB
testcase_17 AC 1,269 ms
103,864 KB
testcase_18 AC 1,319 ms
103,512 KB
testcase_19 AC 1,278 ms
103,856 KB
testcase_20 AC 1,238 ms
103,736 KB
testcase_21 AC 773 ms
103,996 KB
testcase_22 AC 776 ms
103,852 KB
testcase_23 AC 776 ms
103,880 KB
testcase_24 AC 778 ms
103,664 KB
testcase_25 AC 830 ms
103,768 KB
testcase_26 AC 1,306 ms
103,876 KB
testcase_27 AC 1,296 ms
104,064 KB
testcase_28 AC 1,300 ms
103,960 KB
testcase_29 AC 1,294 ms
103,584 KB
testcase_30 AC 1,299 ms
104,132 KB
testcase_31 AC 1,277 ms
103,616 KB
testcase_32 AC 1,234 ms
100,768 KB
testcase_33 AC 1,292 ms
94,236 KB
testcase_34 AC 1,350 ms
93,620 KB
testcase_35 AC 1,067 ms
93,024 KB
testcase_36 AC 1,477 ms
93,284 KB
testcase_37 AC 1,070 ms
92,764 KB
testcase_38 AC 1,091 ms
99,340 KB
testcase_39 AC 1,204 ms
93,704 KB
testcase_40 AC 1,271 ms
94,296 KB
testcase_41 AC 1,247 ms
100,380 KB
testcase_42 AC 1,067 ms
90,812 KB
testcase_43 AC 1,129 ms
90,392 KB
testcase_44 AC 1,351 ms
92,800 KB
testcase_45 AC 1,272 ms
100,348 KB
testcase_46 AC 1,420 ms
93,176 KB
testcase_47 AC 1,185 ms
92,144 KB
testcase_48 AC 1,009 ms
100,440 KB
testcase_49 AC 1,198 ms
100,376 KB
testcase_50 AC 1,057 ms
93,044 KB
testcase_51 AC 1,293 ms
98,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

sigma = 26

# 遅延セグメント木
class lazy_segtree:
    def update(self, k):
        self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])

    def all_apply(self, k, f):
        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):
        self.all_apply(2 * k, self.lz[k])
        self.all_apply(2 * k + 1, self.lz[k])
        self.lz[k] = self.identity

    def __init__(self, V, OP, E, MAPPING, COMPOSITION, ID):
        self.n = len(V)
        self.log = (self.n - 1).bit_length()
        self.size = 1 << self.log
        self.d = [E for i in range(2 * self.size)]
        self.lz = [ID for i in range(self.size)]
        self.e = E
        self.op = OP
        self.mapping = MAPPING
        self.composition = COMPOSITION
        self.identity = ID
        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, x):
        assert 0 <= p and 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):
        assert 0 <= p and 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, l, r):
        assert 0 <= l and l <= r and r <= self.n
        if l == r:
            return self.e
        l += self.size
        r += self.size
        for i in range(self.log, 0, -1):
            if ((l >> i) << i) != l:
                self.push(l >> i)
            if ((r >> i) << i) != r:
                self.push(r >> i)
        sml, smr = self.e, self.e
        while l < r:
            if l & 1:
                sml = self.op(sml, self.d[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.d[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        return self.d[1]

    def apply_point(self, p, f):
        assert 0 <= p and p < 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)

    def apply(self, l, r, f):
        assert 0 <= l and l <= r and r <= self.n
        if l == r:
            return
        l += self.size
        r += self.size
        for i in range(self.log, 0, -1):
            if ((l >> i) << i) != l:
                self.push(l >> i)
            if ((r >> i) << i) != r:
                self.push((r - 1) >> i)
        l2, r2 = l, r
        while l < r:
            if l & 1:
                self.all_apply(l, f)
                l += 1
            if r & 1:
                r -= 1
                self.all_apply(r, f)
            l >>= 1
            r >>= 1
        l, r = l2, r2
        for i in range(1, self.log + 1):
            if ((l >> i) << i) != l:
                self.update(l >> i)
            if ((r >> i) << i) != r:
                self.update((r - 1) >> i)

    def max_right(self, l, g):
        assert 0 <= l and l <= self.n
        assert g(self.e)
        if l == self.n:
            return self.n
        l += self.size
        for i in range(self.log, 0, -1):
            self.push(l >> i)
        sm = self.e
        while 1:
            while l % 2 == 0:
                l >>= 1
            if not (g(self.op(sm, self.d[l]))):
                while l < self.size:
                    self.push(l)
                    l = 2 * l
                    if g(self.op(sm, self.d[l])):
                        sm = self.op(sm, self.d[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.d[l])
            l += 1
            if (l & -l) == l:
                break
        return self.n

    def min_left(self, r, g):
        assert 0 <= r and r <= self.n
        assert g(self.e)
        if r == 0:
            return 0
        r += self.size
        for i in range(self.log, 0, -1):
            self.push((r - 1) >> i)
        sm = self.e
        while 1:
            r -= 1
            while r > 1 and (r % 2):
                r >>= 1
            if not (g(self.op(self.d[r], sm))):
                while r < self.size:
                    self.push(r)
                    r = 2 * r + 1
                    if g(self.op(self.d[r], sm)):
                        sm = self.op(self.d[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.d[r], sm)
            if (r & -r) == r:
                break
        return 0


# セグメント木
class segtree:
    n = 1
    size = 1
    log = 2
    d = [0]
    op = None
    e = 10**15

    def __init__(self, V, OP, E):
        self.n = len(V)
        self.op = OP
        self.e = E
        self.log = (self.n - 1).bit_length()
        self.size = 1 << self.log
        self.d = [E for i in range(2 * 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, x):
        assert 0 <= p and p < self.n
        p += self.size
        self.d[p] = x
        for i in range(1, self.log + 1):
            self.update(p >> i)

    def get(self, p):
        assert 0 <= p and p < self.n
        return self.d[p + self.size]

    def prod(self, l, r):
        assert 0 <= l and l <= r and r <= self.n
        sml = self.e
        smr = self.e
        l += self.size
        r += self.size
        while l < r:
            if l & 1:
                sml = self.op(sml, self.d[l])
                l += 1
            if r & 1:
                smr = self.op(self.d[r - 1], smr)
                r -= 1
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        return self.d[1]

    def max_right(self, l, f):
        assert 0 <= l and l <= self.n
        assert f(self.e)
        if l == self.n:
            return self.n
        l += self.size
        sm = self.e
        while 1:
            while l % 2 == 0:
                l >>= 1
            if not (f(self.op(sm, self.d[l]))):
                while l < self.size:
                    l = 2 * l
                    if f(self.op(sm, self.d[l])):
                        sm = self.op(sm, self.d[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.d[l])
            l += 1
            if (l & -l) == l:
                break
        return self.n

    def min_left(self, r, f):
        assert 0 <= r and r <= self.n
        assert f(self.e)
        if r == 0:
            return 0
        r += self.size
        sm = self.e
        while 1:
            r -= 1
            while r > 1 and (r % 2):
                r >>= 1
            if not (f(self.op(self.d[r], sm))):
                while r < self.size:
                    r = 2 * r + 1
                    if f(self.op(self.d[r], sm)):
                        sm = self.op(self.d[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.d[r], sm)
            if (r & -r) == r:
                break
        return 0

    def update(self, k):
        self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])

    def __str__(self):
        return str([self.get(i) for i in range(self.n)])


def op(x, y):
    return x & y

e = (1 << sigma) - 1

def mapping(f, x):
    return ((x << f) & e) | (x >> (sigma - f))

def composition(f, g):
    return (f + g) % sigma

id_ = 0


S = input()
T = input()

diff = []

for s, t in zip(S, T):
    diff.append(1 << ((ord(s) - ord(t)) % sigma))

seg = lazy_segtree(diff, op, e, mapping, composition, id_)

s_imos = segtree([0] * (len(S) + 1), lambda x, y: (x + y) % sigma, 0)
t_imos = segtree([0] * (len(T) + 1), lambda x, y: (x + y) % sigma, 0)

Q = int(input())

for _ in range(Q):
    cmd, *query = list(map(int, input().split()))

    if cmd == 1:
        l, r, x = query

        seg.apply(min(l - 1, len(S), len(T)), min(r, len(S), len(T)), x)
        s_imos.set(l - 1, s_imos.get(l - 1) + x)
        s_imos.set(r, s_imos.get(r) - x)

    elif cmd == 2:
        l, r, x = query

        seg.apply(min(l - 1, len(S), len(T)), min(r, len(S), len(T)), -x % sigma)
        t_imos.set(l - 1, t_imos.get(l - 1) + x)
        t_imos.set(r, t_imos.get(r) - x)

    else:
        p = query[0]

        idx = seg.max_right(p - 1, lambda x: x & 1 == 1)

        if idx < min(len(S), len(T)):
            s = (s_imos.prod(0, idx + 1) + ord(S[idx]) - ord("a")) % sigma
            t = (t_imos.prod(0, idx + 1) + ord(T[idx]) - ord("a")) % sigma

            if s > t:
                print("Greater")
            elif s < t:
                print("Lesser")

        else:
            if len(S) > len(T):
                print("Greater")
            elif len(S) < len(T):
                print("Lesser")
            else:
                print("Equals")
0