結果

問題 No.2933 Range ROT Query
コンテスト
ユーザー noya2
提出日時 2025-03-04 05:40:53
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 11,364 bytes
コンパイル時間 3,665 ms
コンパイル使用メモリ 290,572 KB
実行使用メモリ 21,392 KB
最終ジャッジ日時 2025-03-04 05:41:07
合計ジャッジ時間 12,000 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 12 WA * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

const ull mod = LLONG_MAX / 4;

ull add(ull a, ull b){
    a += b;
    if (a >= mod) a -= mod;
    return a;
}

ull mul(ull a, ull b){
    return __uint128_t(a) * b % mod;
}

ull modpow(ull a, ull n){
    ull r = 1;
    while (n){
        if (n & 1ULL){
            r = mul(r, a);
        }
        a = mul(a, a);
        n >>= 1;
    }
    return r;
}

const int mx = 200100;
ull pbs[mx], ipbs[mx];
ull base = 2, ibase = 2;
void init(){
    assert(mod == ((1ULL << 61) - 1));
    base = random_device()() + (1LL << 31);
    pbs[0] = 1;
    rep(i,mx-1){
        pbs[i+1] = mul(pbs[i], base);
    }
    ibase = modpow(base, mod-2);
    ipbs[0] = 1;
    rep(i,mx-1){
        ipbs[i+1] = mul(ipbs[i], ibase);
    }
    assert(gcd(base, mod) == 1);
    assert(mul(base, ibase) == 1);
}

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp"

namespace noya2{

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 0;
        size = 1;
        while (size < _n) size <<= 1, log++;

        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace noya2
#line 47 "c.cpp"

using ar = array<ull,2>;

ar op(ar a, ar b){
    a[0] = add(a[0], b[0]);
    a[1] = add(a[1], b[1]);
    return a;
}
ar e(){
    return {};
}

int mo(int x){
    x %= 26;
    if (x < 0) x += 26;
    return x;
}

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/data_structure/fenwick_tree.hpp"

namespace noya2{

template <class T> struct fenwick_tree {
  public:
    fenwick_tree() : _n(0) {}
    explicit fenwick_tree(int n_) : _n(n_), data(n_) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += x;
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

  private:
    int _n;
    vector<T> data;

    T sum(int r) {
        T s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

} // namespace noya2
#line 66 "c.cpp"

void solve(){
    string s, t; in(s,t);
    int n = s.size();
    int m = t.size();
    int sz = max(n,m);
    vector<int> sa(sz+2), ta(sz+2);
    rep(i,n){
        sa[i+1] = s[i] - 'a';
    }
    rep(i,m){
        ta[i+1] = t[i] - 'a';
    }
    fenwick_tree<int> sfen(sz+1), tfen(sz+1);
    segtree<ar,op,e> seg([&]{
        vector<ar> a(sz+1);
        rep(i,sz+1){
            int ds = mo(sa[i+1] - sa[i]);
            int dt = mo(ta[i+1] - ta[i]);
            sfen.add(i,ds);
            tfen.add(i,dt);
            a[i] = {mul(ds, pbs[i]), mul(dt, pbs[i])};
        }
        return a;
    }());
    auto proc = [&](int i, int adds, int addt){
        auto v = seg.get(i);
        v[0] = mul(v[0], ipbs[i]);
        v[1] = mul(v[1], ipbs[i]);
        assert(0 <= v[0] && v[0] < 26);
        assert(0 <= v[1] && v[1] < 26);
        v[0] = mul(mo(v[0] + adds), pbs[i]);
        v[1] = mul(mo(v[1] + addt), pbs[i]);
        seg.set(i,v);
        sfen.add(i,adds);
        tfen.add(i,addt);
    };
    auto say = [&](int p){
        if (p < 0){
            out("Lesser");
        }
        else if (p == 0){
            out("Equals");
        }
        else {
            out("Greater");
        }
    };
    auto getc = [&](int i) -> pii {
        int si = (i < n ? mo(-1 + sfen.sum(0,i+1)) : -1);
        int ti = (i < m ? mo(-1 + tfen.sum(0,i+1)) : -1);
        return {si, ti};
    };
    int q; in(q);
    while (q--){
        int ty; in(ty);
        if (ty == 1){
            int l, r; in(l,r); l--;
            int x; in(x);
            proc(l,x,0);
            proc(r,-x,0);
        }
        if (ty == 2){
            int l, r; in(l,r); l--;
            int x; in(x);
            proc(l,0,x);
            proc(r,0,-x);
        }
        if (ty == 3){
            int p; in(p); p--;
            auto [sp, tp] = getc(p);
            if (sp != tp){
                say(sp - tp);
                continue;
            }
            int r = seg.max_right(p+1,[&](ar x){
                return x[0] == x[1];
            });
            if (r == sz+1){
                say(0);
            }
            else {
                auto [sr, tr] = getc(r);
                assert(sr != tr);
                say(sr - tr);
            }
        }
    }
}

int main(){
    init();
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0