結果
| 問題 |
No.2933 Range ROT Query
|
| ユーザー |
 ArcAki
|
| 提出日時 | 2025-03-05 04:58:21 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,826 bytes |
| コンパイル時間 | 16,404 ms |
| コンパイル使用メモリ | 396,904 KB |
| 実行使用メモリ | 29,132 KB |
| 最終ジャッジ日時 | 2025-03-05 04:58:52 |
| 合計ジャッジ時間 | 25,975 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 35 RE * 15 |
ソースコード
#[allow(unused_imports)]
use std::{
cell::RefCell, convert::{Infallible, TryFrom, TryInto as _},
fmt::{self, Debug, Display, Formatter,},
fs::{File}, hash::{Hash, Hasher}, iter::{Product, Sum}, marker::PhantomData,
ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, },
str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once}, collections::{*},
mem::{swap}, cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
thread::LocalKey, f64::consts::PI, time::Instant,
io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
//use ac_library::{*};
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
pub trait SegTreeMonoid{
type S: Clone;
fn identity()->Self::S;
fn op(a: &Self::S, b: &Self::S)->Self::S;
}
pub struct SegTree<M: SegTreeMonoid>{
n: usize,
data: Vec<M::S>,
}
impl<M: SegTreeMonoid> SegTree<M> {
pub fn new(n: usize)->Self{
let n = n.next_power_of_two();
let data = vec![M::identity(); 2*n];
SegTree{
n, data
}
}
pub fn build(vec: &Vec<M::S>)->Self {
let n = vec.len().next_power_of_two();
let mut data = vec![M::identity(); n<<1];
data[n..(n+vec.len())].clone_from_slice(vec);
for i in (1..n).rev(){
data[i] = M::op(&data[i*2], &data[i*2+1]);
}
SegTree{
n, data,
}
}
pub fn get(&self, p: usize)->M::S{
self.data[p+self.n].clone()
}
pub fn set(&mut self, i: usize, x: M::S){
let mut p = i+self.n;
self.data[p] = x;
while p > 0{
p /= 2;
self.data[p] = M::op(&self.data[p<<1], &self.data[(p<<1)|1]);
}
}
pub fn push(&mut self, i: usize, x: M::S){
let mut p = i+self.n;
self.data[p] = M::op(&self.data[p], &x);
while p > 0{
p /= 2;
self.data[p] = M::op(&self.data[p<<1], &self.data[(p<<1)|1]);
}
}
pub fn prod(&mut self, l: usize, r: usize)->M::S{
let mut p_l = l+self.n;
let mut p_r = r+self.n;
let mut res_l = M::identity();
let mut res_r = M::identity();
while p_l < p_r{
if p_l&1==1{
res_l = M::op(&res_l, &self.data[p_l]);
p_l += 1;
}
if p_r&1==1{
p_r -= 1;
res_r = M::op(&self.data[p_r], &res_r);
}
p_l >>= 1;
p_r >>= 1;
}
M::op(&res_l, &res_r)
}
pub fn all_prod(&mut self)->M::S{
self.data[1].clone()
}
pub fn max_right<F>(&self, mut l: usize, f: F)->usize where F: Fn(&M::S)->bool{
assert!(f(&M::identity())); // これはバグってくれないと多分デバックが悲惨
if l==self.n{return self.n}
l += self.n; let mut ac = M::identity();
while {
while l%2==0{
l >>= 1;
}
if !f(&M::op(&ac, &self.data[l])){
while l < self.n{
l <<= 1;
let res = M::op(&ac, &self.data[l]);
if f(&res){
ac = res;
l += 1;
}
}
return l-self.n;
}
ac = M::op(&ac, &self.data[l]);
l += 1;
let z = l as isize;
(z & -z) != z
} {}
self.n
}
pub fn min_left<F>(&self, mut r: usize, f: F)->usize where F: Fn(&M::S)->bool{
assert!(f(&M::identity()));r += self.n;let mut ac = M::identity();
if r==0{return 0}
while {
while r > 1 && r%2 == 1{
r >>= 1;
}
if !f(&M::op(&ac, &self.data[r])){
while r < self.n{
r = 2*r+1;
let res = M::op(&ac, &self.data[r]);
if f(&res){
ac = res;
r -= 1;
}
}
return r+1-self.n;
}
ac = M::op(&ac, &self.data[r]);
let z = r as isize;
z & -z == z
} {}
0
}
}
#[derive(Copy, Clone, Debug)]
struct S{
ac1: i64,
ac2: i64,
same: bool,
}
struct M;
impl SegTreeMonoid for M{
type S = S;
fn identity() -> Self::S {
S{ac1: 0, ac2: 0, same: true}
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
S{
ac1: a.ac1+b.ac1,
ac2: a.ac2+b.ac2,
same: a.same&&b.same
}
}
}
//use proconio::fastout;
//#[fastout]
fn main(){
input!{
s: Chars,
t: Chars,
q: usize,
}
let ss = s.iter().map(|&x| x as i64).collect::<Vec<_>>();
let ts = t.iter().map(|&x| x as i64).collect::<Vec<_>>();
let mut base = Vec::new();
let mut fs = ss[0]-'a' as i64;
let mut ft = ts[0]-'a' as i64;
for i in 0..s.len().min(t.len())-1{
let sub1 = (26+ss[i+1]-ss[i])%26;
let sub2 = (26+ts[i+1]-ts[i])%26;
base.push(S{ac1: sub1, ac2: sub2, same: sub1==sub2});
}
let mut segtree = SegTree::<M>::build(&base);
let mx = s.len().min(t.len())-1;
for _ in 0..q{
input!{ty: Usize1}
match ty{
0 => {
input!{l: Usize1, mut r: Usize1, x: i64}
r = r.min(mx);
if l==0{
fs += x;
} else {
let mut pre = segtree.get(l-1);
pre.ac1 += x;
pre.same = (pre.ac1-pre.ac2)%26==0;
segtree.set(l-1, pre);
}
if r < mx{
let mut pre = segtree.get(r);
pre.ac1 += 26-x;
pre.same = (pre.ac1-pre.ac2)%26==0;
segtree.set(r, pre);
}
},
1 => {
input!{l: Usize1, mut r: Usize1, x: i64}
r = r.min(mx);
if l==0{
ft += x;
} else {
let mut pre = segtree.get(l-1);
pre.ac2 += x;
pre.same = (pre.ac1-pre.ac2)%26==0;
segtree.set(l-1, pre);
}
if r < mx{
let mut pre = segtree.get(r);
pre.ac2 += 26-x;
pre.same = (pre.ac1-pre.ac2)%26==0;
segtree.set(r, pre);
}
},
_ => {
input!{p: Usize1}
let s1 = segtree.prod(0, p);
let c1 = (s1.ac1+fs)%26;
let c2 = (s1.ac2+ft)%26;
if c1 > c2{
println!("Greater");
} else if c1 < c2{
println!("Lesser");
} else {
let r = segtree.max_right(p, |x| x.same);
//println!("r: {}", r);
//println!("{} {}", s.len(), t.len());
if r+1>=s.len().min(t.len()){
if s.len() > t.len(){
println!("Greater");
} else if s.len() < t.len(){
println!("Lesser");
} else {
println!("Equals");
}
} else {
let x = segtree.prod(0, r+1);
let d1 = (fs+x.ac1)%26;
let d2 = (ft+x.ac2)%26;
//println!("d1: {} d2: {}", d1, d2);
if d1 > d2{
println!("Greater");
} else {
println!("Lesser");
}
}
}
}
}
/*
let mut sss = Vec::new();
let mut ttt = Vec::new();
for i in 0..=mx{
let x = segtree.prod(0, i);
sss.push((fs+x.ac1)%26);
}
for i in 0..=mx{
let x = segtree.prod(0, i);
ttt.push((ft+x.ac2)%26);
}
println!("s: {}", sss.iter().map(|&x| ((b'a'+(x as u8))as char).to_string()).collect::<String>());
println!("t: {}", ttt.iter().map(|&x| ((b'a'+(x as u8))as char).to_string()).collect::<String>());
*/
}
}