結果
| 問題 |
No.3198 Monotonic Query
|
| ユーザー |
 ArcAki
|
| 提出日時 | 2025-07-11 21:35:41 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 43 ms / 3,000 ms |
| コード長 | 8,872 bytes |
| コンパイル時間 | 23,779 ms |
| コンパイル使用メモリ | 377,468 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2025-07-12 10:52:33 |
| 合計ジャッジ時間 | 15,714 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {
self.sort_by(|u, v| v.cmp(&u));
} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self < rhs{ rhs } else { *self } } }
pub fn chmax<T: PartialOrd+Clone>(a: &mut T, b: &T){ if *a < *b{ *a = b.clone(); } }
pub fn chmin<T: PartialOrd+Clone>(a: &mut T, b: &T){ if *a > *b{ *a = b.clone(); } }
pub fn gcd(mut a: i64, mut b: i64)->i64{ if b==0{return a;}(a,b)=(a.abs(),b.abs());while b!=0{ let c = a;a = b;b = c%b; }a }
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
if a<b{return 0;}else if b==0 || a==b{ return 1; }
else{let x=f[a as usize].0;
let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
let mut inv = vec![0; x as usize+10];inv[1] = 1;
for i in 2..x+1{z=(z*i)%MOD;
let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
inv[i as usize] = w;
f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{
let mut res=1;let mut t=x;let mut z=p;while z > 0{
if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
#[allow(unused_imports)]
use std::{
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, RangeBounds},
str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
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, prelude::*};
#[allow(unused_imports)]
//use itertools::Itertools;
#[allow(unused_imports)]
//use ordered_float::OrderedFloat;
#[allow(unused_imports)]
//use ac_library::{*, ModInt998244353 as mint};
#[allow(dead_code)]
//type MI = StaticModInt<Mod998244353>;pub fn factorial_mint(n: usize)->(Vec<MI>, Vec<MI>){ let mut res = vec![mint::new(1); n+1];let mut inv = vec![mint::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = mint::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)}
#[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)];
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !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 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
}
}
struct SegTreeMax;
impl SegTreeMonoid for SegTreeMax{
type S = i64;
fn identity() -> Self::S {
i64::MIN
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a.max(b)
}
}
struct SegTreeMin;
impl SegTreeMonoid for SegTreeMin{
type S = i64;
fn identity() -> Self::S {
i64::MAX
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a.min(b)
}
}
struct SegTreeSum;
impl SegTreeMonoid for SegTreeSum{
type S = i64;
fn identity() -> Self::S {
0
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a+b
}
}
struct SegTreeXor;
impl SegTreeMonoid for SegTreeXor{
type S = i64;
fn identity() -> Self::S {
0
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a^b
}
}
pub const B: u128 = 127;
pub const MO: u128 = (1<<64)-59;
pub struct RollingHashMonoid;
impl SegTreeMonoid for RollingHashMonoid{
type S = (u128, u128);
fn identity() -> Self::S {
(1, 0)
}
fn op(a: &Self::S, b: &Self::S) -> Self::S {
let &(b1, h1) = a;
let &(b2, h2) = b;
((b1*b2)%MO, (b2*h1+h2)%MO)
}
}
pub fn compress<T: Copy+Ord+std::hash::Hash>(a: &Vec<T>)->Vec<usize>{
let mut b = a.clone();
b.sort();
b.dedup();
let mut dic = std::collections::HashMap::new();
for (i, &v) in b.iter().enumerate(){
dic.insert(v, i);
}
a.iter().map(|x| dic[x]).collect()
}
struct M;
impl SegTreeMonoid for M{
type S = i32;
fn identity() -> Self::S {
-1
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a.max(b)
}
}
use proconio::fastout;
#[fastout]
fn main() {
input!{
q: usize,
}
let mut segtree = SegTree::<M>::new(q);
let mut cnt = 0;
for _ in 0..q{
input!{
t: usize,
}
if t==1{
input!{
x: i32,
}
segtree.set(cnt, x);
cnt += 1;
} else {
input!{
k: usize,
}
println!("{}", segtree.prod(cnt-k, cnt));
}
}
}