#706026 (Rust) No.1705 Mode of long array

• 問題: No.1705 Mode of long array
• ユーザー: Moss_Local
• 提出日時: 2021-10-08 23:00:59
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 208 ms / 3,000 ms
• コード長: 9,095 bytes
• コンパイル時間: 820 ms
• コンパイル使用メモリ: 159,540 KB
• 実行使用メモリ: 4,776 KB
• 最終ジャッジ日時: 2023-09-30 12:17:52
• 合計ジャッジ時間: 6,735 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	2 ms; 4,384 KB
testcase_04	AC	2 ms; 4,380 KB
testcase_05	AC	3 ms; 4,376 KB
testcase_06	AC	7 ms; 4,376 KB
testcase_07	AC	9 ms; 4,380 KB
testcase_08	AC	9 ms; 4,376 KB
testcase_09	AC	8 ms; 4,376 KB
testcase_10	AC	7 ms; 4,376 KB
testcase_11	AC	8 ms; 4,380 KB
testcase_12	AC	8 ms; 4,380 KB
testcase_13	AC	79 ms; 4,376 KB
testcase_14	AC	60 ms; 4,376 KB
testcase_15	AC	72 ms; 4,380 KB
testcase_16	AC	85 ms; 4,380 KB
testcase_17	AC	62 ms; 4,376 KB
testcase_18	AC	49 ms; 4,376 KB
testcase_19	AC	87 ms; 4,380 KB
testcase_20	AC	55 ms; 4,376 KB
testcase_21	AC	61 ms; 4,380 KB
testcase_22	AC	90 ms; 4,380 KB
testcase_23	AC	23 ms; 4,376 KB
testcase_24	AC	23 ms; 4,376 KB
testcase_25	AC	23 ms; 4,376 KB
testcase_26	AC	23 ms; 4,376 KB
testcase_27	AC	23 ms; 4,376 KB
testcase_28	AC	23 ms; 4,376 KB
testcase_29	AC	23 ms; 4,380 KB
testcase_30	AC	24 ms; 4,376 KB
testcase_31	AC	23 ms; 4,376 KB
testcase_32	AC	23 ms; 4,376 KB
testcase_33	AC	42 ms; 4,676 KB
testcase_34	AC	42 ms; 4,668 KB
testcase_35	AC	41 ms; 4,768 KB
testcase_36	AC	41 ms; 4,756 KB
testcase_37	AC	40 ms; 4,704 KB
testcase_38	AC	40 ms; 4,744 KB
testcase_39	AC	41 ms; 4,744 KB
testcase_40	AC	41 ms; 4,752 KB
testcase_41	AC	41 ms; 4,716 KB
testcase_42	AC	40 ms; 4,744 KB
testcase_43	AC	205 ms; 4,752 KB
testcase_44	AC	203 ms; 4,708 KB
testcase_45	AC	206 ms; 4,760 KB
testcase_46	AC	208 ms; 4,748 KB
testcase_47	AC	204 ms; 4,768 KB
testcase_48	AC	205 ms; 4,776 KB
testcase_49	AC	77 ms; 4,708 KB
testcase_50	AC	76 ms; 4,768 KB
testcase_51	AC	77 ms; 4,756 KB
testcase_52	AC	77 ms; 4,752 KB
testcase_53	AC	76 ms; 4,756 KB

コンパイルメッセージ

warning: unnecessary parentheses around type
   --> Main.rs:115:15
    |
115 | fn readi() -> (i64) {
    |               ^   ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
115 - fn readi() -> (i64) {
115 + fn readi() -> i64 {
    |

warning: unnecessary parentheses around match arm expression
   --> Main.rs:277:46
    |
277 |             std::ops::Bound::Included(&x) => (x + 1),
    |                                              ^     ^
    |
help: remove these parentheses
    |
277 -             std::ops::Bound::Included(&x) => (x + 1),
277 +             std::ops::Bound::Included(&x) => x + 1,
    |

warning: unused variable: `n`
   --> Main.rs:325:10
    |
325 |     let (n, m) = readuu();
    |          ^ help: if this is intentional, prefix it with an underscore: `_n`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `i`
   --> Main.rs:332:9
    |
332 |     for i in 0..q {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`

warning: variable does not need to be mutable
   --> Main.rs:326:9
    |
326 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: 5 warnings emitted

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::arch::x86_64::_XCR_XFEATURE_ENABLED_MASK;
use std::cmp::Ordering::*;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::f64::consts::PI;
use std::fmt::Debug;
use std::fmt::Display;
use std::fs::File;
use std::hash::Hash;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
// const FINF: f64 = 122337203685.0;
const LINF: i64 = 2147483647;
const FINF: f64 = LINF as f64;
const INF128: i128 = 1223372036854775807000000000000;
const MOD: i64 = 1000000007;
// const MOD: i64 = 998244353;

const MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}

macro_rules! chmin {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_min = min!($($cmps),+);
        if $base > cmp_min {
            $base = cmp_min;
            true
        } else {
            false
        }
    }};
}

macro_rules! chmax {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_max = max!($($cmps),+);
        if $base < cmp_max {
            $base = cmp_max;
            true
        } else {
            false
        }
    }};
}

macro_rules! min {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::min($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::min($a, min!($($rest),+))
    }};
}

macro_rules! max {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::max($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::max($a, max!($($rest),+))
    }};
}

// use str::Chars;

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

pub struct SEG<M: Monoid> {
    n: usize,
    buf: Vec<M::T>,
}

impl<M: Monoid> SEG<M> {
    #[allow(dead_code)]
    pub fn new(n: usize) -> SEG<M> {
        SEG {
            n,
            buf: vec![M::id(); 2 * n],
        }
    }

    #[allow(dead_code)]
    pub fn update(&mut self, k: usize, a: M::T) {
        let mut k = k + self.n;
        self.buf[k] = a;

        while k > 0 {
            k >>= 1;
            self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
        }
    }

    #[allow(dead_code)]
    pub fn add(&mut self, k: usize, a: &M::T) {
        let mut k = k + self.n;
        self.buf[k] = M::op(&self.buf[k], a);

        while k > 0 {
            k >>= 1;
            self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
        }
    }

    #[allow(dead_code)]
    pub fn get(&self, i: usize) -> M::T {
        self.query(i, i + 1)
    }

    #[allow(dead_code)]
    pub fn query_range<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M::T {
        let l = match range.start_bound() {
            std::ops::Bound::Excluded(&x) => {
                assert!(x > 0);
                x - 1
            }
            std::ops::Bound::Included(&x) => x,
            std::ops::Bound::Unbounded => 0,
        };
        let r = match range.end_bound() {
            std::ops::Bound::Excluded(&x) => x,
            std::ops::Bound::Included(&x) => (x + 1),
            std::ops::Bound::Unbounded => self.n,
        };

        self.query(l, r)
    }

    #[allow(dead_code)]
    pub fn query(&self, l: usize, r: usize) -> M::T {
        let mut vl = M::id();
        let mut vr = M::id();

        let mut l = l + self.n;
        let mut r = r + self.n;

        while l < r {
            if l & 1 == 1 {
                vl = M::op(&vl, &self.buf[l]);
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                vr = M::op(&self.buf[r], &vr);
            }

            l >>= 1;
            r >>= 1;
        }
        M::op(&vl, &vr)
    }
}
pub trait Monoid {
    type T: Clone;
    fn id() -> Self::T;
    fn op(a: &Self::T, b: &Self::T) -> Self::T;
}

pub enum MON {}
impl Monoid for MON {
    type T = usize;
    fn id() -> Self::T {
        0
    }
    fn op(a: &Self::T, b: &Self::T) -> Self::T {
        max(*a, *b)
    }
}
fn solve() {
    let (n, m) = readuu();
    let mut vec: Vec<usize> = read_vec();
    let mut seg: SEG<MON> = SEG::new(101010);
    for i in 0..m {
        seg.update(i + 1, vec[i]);
    }
    let q: usize = read();
    for i in 0..q {
        let (t, x, y) = readuuu();
        if t == 1 {
            let v = seg.query(x, x + 1);
            seg.update(x, v + y);
        } else if t == 2 {
            let v = seg.query(x, x + 1);
            seg.update(x, v - y);
        } else {
            let ma = seg.query(0, 101010);
            // println!("{:?}", ma);
            let f = |idx: usize| -> bool {
                return seg.query(idx, 101010) == ma;
            };

            let mut ok = 0;
            let mut ng = 101010;

            while (ng - ok) > 1 {
                let mid = (ok + ng) / 2;
                if f(mid) {
                    ok = mid;
                } else {
                    ng = mid;
                }
            }
            println!("{:?}", ok);
        }
    }
    return;
}
fn main() {
    solve();
    return;
}