結果

問題 No.2933 Range ROT Query
ユーザー ponjuiceponjuice
提出日時 2024-10-12 17:00:24
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,073 bytes
コンパイル時間 5,336 ms
コンパイル使用メモリ 329,508 KB
実行使用メモリ 160,684 KB
最終ジャッジ日時 2024-10-12 17:03:32
合計ジャッジ時間 53,414 ms
ジャッジサーバーID
（参考情報） 		judge / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 1 ms
6,816 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 AC 1,488 ms
160,476 KB
testcase_13 AC 1,483 ms
160,528 KB
testcase_14 AC 1,398 ms
160,536 KB
testcase_15 AC 1,489 ms
160,620 KB
testcase_16 AC 1,422 ms
160,676 KB
testcase_17 AC 1,580 ms
160,480 KB
testcase_18 AC 1,628 ms
160,532 KB
testcase_19 AC 1,654 ms
160,600 KB
testcase_20 AC 1,628 ms
160,588 KB
testcase_21 AC 1,374 ms
160,680 KB
testcase_22 AC 1,373 ms
160,580 KB
testcase_23 AC 1,349 ms
160,480 KB
testcase_24 AC 1,364 ms
160,616 KB
testcase_25 AC 1,323 ms
160,636 KB
testcase_26 AC 1,794 ms
160,532 KB
testcase_27 AC 1,847 ms
160,664 KB
testcase_28 AC 1,792 ms
160,588 KB
testcase_29 AC 1,816 ms
160,536 KB
testcase_30 AC 1,826 ms
160,684 KB
testcase_31 AC 1,828 ms
160,540 KB
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

//高速化 
struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);}}PonJuice;
//#define endl '\n' //インタラクティブ問題の時は消す

//型
using ll = long long;
using ld = long double;
using mint = modint998244353;//1000000007;
template<class T>using vc = vector<T>; template<class T>using vvc = vc<vc<T>>; template<class T>using vvvc = vvc<vc<T>>;
using vi = vc<int>;  using vvi = vvc<int>;  using vvvi = vvvc<int>;
using vl = vc<ll>;   using vvl = vvc<ll>;   using vvvl = vvvc<ll>;
using pi = pair<int, int>;  using pl = pair<ll, ll>;
using ull = unsigned ll;
template<class T>using priq = priority_queue<T>;
template<class T>using priqg = priority_queue<T, vc<T>, greater<T>>;

// for文
#define overload4(a, b, c, d, e, ...) e
#define rep1(n)             for(ll i = 0; i < n; i++)
#define rep2(i, n)          for(ll i = 0; i < n; i++)
#define rep3(i, a, b)       for(ll i = a; i < b; i++)
#define rep4(i, a, b, step) for(ll i = a; i < b; i+= step)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n)             for(ll i = n-1; i >= 0; i--)
#define per2(i, n)          for(ll i = n-1; i >= 0; i--)
#define per3(i, a, b)       for(ll i = b-1; i >= a; i--)
#define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step)
#define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__)
#define fore1(a)       for(auto&& i : a)	
#define fore2(i,a)     for(auto&& i : a)
#define fore3(x,y,a)   for(auto&& [x, y] : a)
#define fore4(x,y,z,a) for(auto&& [x, y, z] : a)
#define fore(...) overload4(__VA_ARGS__, fore4, fore3, fore2, fore1)(__VA_ARGS__)

//関数
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define si(x) (ll)(x).size()
template<class S, class T>inline bool chmax(S& a, T b){return a < b && ( a = b , true);}
template<class S, class T>inline bool chmin(S& a, T b){return a > b && ( a = b , true);}
template<class T>void uniq(vc<T>&a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<class T>vc<T> operator++(vc<T>&v,signed){auto res = v;fore(e,v)e++;return res;}
template<class T>vc<T> operator--(vc<T>&v,signed){auto res = v;fore(e,v)e--;return res;}
template<class T>vc<T> operator++(vc<T>&v){fore(e,v)e++;return v;}
template<class T>vc<T> operator--(vc<T>&v){fore(e,v)e--;return v;}

//入出力(operator)
template<int T>istream&operator>>(istream&is,static_modint<T>&a){ll v;is>>v;a=v;return is;}
istream&operator>>(istream&is,modint&a){ll v;cin>>v;a=v;return is;}
template<class S,class T>istream&operator>>(istream&is,pair<S,T>&a){is>>a.a>>a.b;return is;}
template<class T>istream&operator>>(istream&is,vc<T>&a){fore(e,a)is>>e;return is;}

template<int T>ostream&operator<<(ostream&os,static_modint<T>a){return os<<a.val();}
ostream&operator<<(ostream&os,modint a){return os<<a.val();}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>&a){return os<<a.a<<" "<<a.b;}
template<class T>ostream&operator<<(ostream&os,set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class T>ostream&operator<<(ostream&os,multiset<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,unordered_set<T>&a){fore(it,a){os<<it<<" ";}return os;}
template<class S,class T>ostream&operator<<(ostream&os,unordered_map<S,T>&a){fore(x,y,a){os<<x<<" "<<y<<"\n";}return os;}
template<class T>ostream&operator<<(ostream&os,vc<T>&a){fore(e,a)os<<e<<" ";return os;}
template<class T>ostream&operator<<(ostream&os,vvc<T>&a){fore(e,a)os<<e<<"\n";return os;}

//入出力(関数)
vi readvi(ll n){vi a(n);cin>>a;return a;}
vl readvl(ll n){vl a(n);cin>>a;return a;}
vvi readg(ll n,ll m,bool bidirected=true){vvi g(n);rep(i,m){ll a,b;cin>>a>>b;a--;b--;g[a].emplace_back(b);if(bidirected)g[b].emplace_back(a);}return g;}
vvc<pi>readgc(ll n,ll m,bool bidirected=true){vvc<pi> g(n);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;g[a].emplace_back(b,c);if(bidirected)g[b].emplace_back(a,c);}return g;}
vvi readt(ll n,bool bidirected=true){return readg(n,n-1,bidirected);}
vvc<pi> readtc(ll n,bool bidirected=true){return readgc(n,n-1,bidirected);}

inline void yes(){cout << "Yes\n";}
inline void no(){cout << "No\n";}
inline void yesno(bool y = true){if(y)yes();else no();}
inline void print(){cout<<endl;}
template<class T>inline void print(T a){cout<<a<<endl;}
template<class T,class... Ts>inline void print(T a,Ts ...b){cout<<a;(cout<<...<<(cout<<' ',b));cout<<endl;}

//定数
constexpr ll mod = 998244353;
constexpr ll minf=-(1<<29);
constexpr ll inf=(1<<29);
constexpr ll MINF=-(1LL<<60);
constexpr ll INF=(1LL<<60);
constexpr ld EPS = 1e-8;
const ld PI = acosl(-1);
#define equals(a, b) (abs((a) - (b)) < EPS)
const int dx[4] ={-1, 0, 1, 0};
const int dy[4] ={ 0, 1, 0,-1};
const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0};
const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1};

void solve();
int main() {
	int t = 1;
    // cin >>t;
    while(t--)solve();
}


using S=array<ll,27>;
using F=array<ll,2>;
const S Inf = {0};
const F ID = {0,0};
S op(S a, S b){
    S res;
    rep(i,27) res[i] = a[i]+b[i];
    return res;
}
S e(){ return Inf; }
S mapping(F f, S x){
    S res;
    res[0] = (x[0]+f[0]) % 26;
    rep(i,1,27) res[i] = x[(i - 1 + f[1])%26 + 1];
    return res;
}
F composition(F f, F g){
    F res;
    res[0] = (f[0]+g[0]) % 26;
    res[1] = (f[1]+g[1]) % 26;
    return res; 
}
F id(){ return ID; }

void solve(){
    string s,t;
    cin >> s >> t;
    int n = min(si(s),si(t));
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(n);
    rep(i, n){
        S a = {0};
        a[0] = s[i]-'a';
        a[(t[i] - s[i] + 26) % 26 + 1] = 1;
        seg.set(i,a);
    }

    int q;
    cin >> q;
    rep(i,q){
        int T;
        cin >> T;
        if(T == 1 || T == 2){
            int l,r,x;
            cin >> l >> r >> x;
            l--;
            r = min(r,n);
            seg.apply(l, r, {T == 1 ? x: 0, T == 1 ? x : 26-x});
        }else{
            int p;
            cin >> p;
            p--;
            int r = seg.max_right(p, [&](S x){rep(i,1,26) if(x[i+1])return false; return true;});
            if(r == n){
                if(si(s) == si(t)){
                    cout << "Equals" << endl;
                }
                if(si(s) < si(t)){
                    cout << "Lesser" << endl;
                }
                if(si(s) > si(t)){
                    cout << "Greater" << endl;
                }
            }else{
                S res = seg.get(r);
                ll st = res[0];
                rep(i,26){
                    if(res[i+1]){
                        st = (st + i) % 26;
                    }
                }
                if(res[0] < st){
                    cout << "Lesser" << endl;
                }
                if(res[0] > st){
                    cout << "Greater" << endl;
                }
            }
        }

    }
}
0