#744800 (Rust) No.1868 Teleporting Cyanmond

• 問題: No.1868 Teleporting Cyanmond
• ユーザー: Moss_Local
• 提出日時: 2022-03-11 21:26:32
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 96 ms / 2,000 ms
• コード長: 9,365 bytes
• コンパイル時間: 14,977 ms
• コンパイル使用メモリ: 382,768 KB
• 実行使用メモリ: 15,776 KB
• 最終ジャッジ日時: 2024-09-16 01:27:18
• 合計ジャッジ時間: 15,228 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	8 ms; 15,232 KB
testcase_01	AC	8 ms; 15,360 KB
testcase_02	AC	9 ms; 15,232 KB
testcase_03	AC	96 ms; 15,388 KB
testcase_04	AC	77 ms; 15,144 KB
testcase_05	AC	12 ms; 15,268 KB
testcase_06	AC	23 ms; 15,232 KB
testcase_07	AC	50 ms; 15,232 KB
testcase_08	AC	34 ms; 15,232 KB
testcase_09	AC	47 ms; 15,104 KB
testcase_10	AC	90 ms; 15,232 KB
testcase_11	AC	9 ms; 15,264 KB
testcase_12	AC	29 ms; 15,232 KB
testcase_13	AC	44 ms; 15,140 KB
testcase_14	AC	78 ms; 15,392 KB
testcase_15	AC	55 ms; 15,360 KB
testcase_16	AC	17 ms; 15,232 KB
testcase_17	AC	24 ms; 15,232 KB
testcase_18	AC	73 ms; 15,772 KB
testcase_19	AC	73 ms; 15,652 KB
testcase_20	AC	72 ms; 15,648 KB
testcase_21	AC	73 ms; 15,644 KB
testcase_22	AC	72 ms; 15,644 KB
testcase_23	AC	71 ms; 15,660 KB
testcase_24	AC	69 ms; 15,776 KB
testcase_25	AC	70 ms; 15,648 KB
testcase_26	AC	70 ms; 15,644 KB
testcase_27	AC	70 ms; 15,776 KB

コンパイルメッセージ

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

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

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::any::Any;
use std::cmp::Ordering::*;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::error::Error;
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::iter::Filter;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::RangeBounds;
use std::ops::{Add, Mul, Neg, Sub};
use std::process;
use std::slice::from_raw_parts;
use std::str;
use std::vec;

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);
    };
}

// use str::Chars;

fn main() {
    solve();
}

// 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(),
    )
}

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 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(),
    )
}

#[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(),
    )
}

trait SEGLazyImpl {
    type Monoid: Copy;
    type OperatorMonoid: Copy + PartialEq;
    fn m0() -> Self::Monoid;
    fn om0() -> Self::OperatorMonoid;
    fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid;
    fn g(x: Self::Monoid, y: Self::OperatorMonoid, weight: usize) -> Self::Monoid;
    fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid;
}

struct SEGLazy<T: SEGLazyImpl> {
    n: usize,
    data: Vec<T::Monoid>,
    lazy: Vec<T::OperatorMonoid>,
    weight: Vec<usize>,
}

impl<T: SEGLazyImpl> SEGLazy<T> {
    pub fn new(n: usize, init: T::Monoid) -> SEGLazy<T> {
        let weights = vec![1; n];
        Self::with_weight(n, init, weights)
    }
    pub fn with_weight(n: usize, init: T::Monoid, weights: Vec<usize>) -> Self {
        let mut m = 1;
        while m < n {
            m *= 2;
        }
        SEGLazy {
            n: m,
            data: vec![init; m * 2],
            lazy: vec![T::om0(); m * 2],
            weight: Self::mk_weight(&weights),
        }
    }
    fn mk_weight(xs: &[usize]) -> Vec<usize> {
        let n = xs.len();
        let mut m = 1;
        while m < n {
            m *= 2;
        }
        let mut res = vec![0; 2 * m];
        for i in 0..n {
            res[m + i] = xs[i];
        }
        for k in (1..m).rev() {
            let l = 2 * k;
            let r = 2 * k + 1;
            res[k] = res[l] + res[r];
        }
        res
    }
    fn propagate(&mut self, k: usize) {
        let weight = self.weight[k];
        if self.lazy[k] != T::om0() {
            if k < self.n {
                self.lazy[2 * k + 0] = T::h(self.lazy[2 * k + 0], self.lazy[k]);
                self.lazy[2 * k + 1] = T::h(self.lazy[2 * k + 1], self.lazy[k]);
            }
            self.data[k] = T::g(self.data[k], self.lazy[k], weight);
            self.lazy[k] = T::om0();
        }
    }
    fn do_update(
        &mut self,
        a: usize,
        b: usize,
        x: T::OperatorMonoid,
        k: usize,
        l: usize,
        r: usize,
    ) -> T::Monoid {
        self.propagate(k);
        if r <= a || b <= l {
            self.data[k]
        } else if a <= l && r <= b {
            self.lazy[k] = T::h(self.lazy[k], x);
            self.propagate(k);
            self.data[k]
        } else {
            self.data[k] = T::f(
                self.do_update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
                self.do_update(a, b, x, 2 * k + 1, (l + r) >> 1, r),
            );
            self.data[k]
        }
    }
    #[doc = "[l,r)"]
    pub fn update(&mut self, l: usize, r: usize, x: T::OperatorMonoid) -> T::Monoid {
        let n = self.n;
        self.do_update(l, r, x, 1, 0, n)
    }
    fn do_query(&mut self, a: usize, b: usize, k: usize, l: usize, r: usize) -> T::Monoid {
        self.propagate(k);
        if r <= a || b <= l {
            T::m0()
        } else if a <= l && r <= b {
            self.data[k]
        } else {
            T::f(
                self.do_query(a, b, 2 * k + 0, l, (l + r) >> 1),
                self.do_query(a, b, 2 * k + 1, (l + r) >> 1, r),
            )
        }
    }
    #[doc = "[l,r)"]
    pub fn query(&mut self, l: usize, r: usize) -> T::Monoid {
        let n = self.n;
        self.do_query(l, r, 1, 0, n)
    }
}

struct RUQ;
impl SEGLazyImpl for RUQ {
    type Monoid = i64;
    type OperatorMonoid = i64;
    fn m0() -> Self::Monoid {
        INF
    }
    fn om0() -> Self::OperatorMonoid {
        INF
    }
    fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid {
        std::cmp::min(x, y)
    }
    fn g(x: Self::Monoid, y: Self::OperatorMonoid, _: usize) -> Self::Monoid {
        min(x, y)
    }
    fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid {
        min(x, y)
    }
}
// #[test]
// fn test_MAX_RUQ() {
//     let mut seg: SEGLazy<MAX_RUQ> = SEGLazy::new(10, MAX_RUQ::m0());
//     assert_eq!(seg.query(0, 3), 0);
//     seg.update(0, 2, 10); // [10,10,0,...]
//     assert_eq!(seg.query(0, 3), 10);
//     assert_eq!(seg.query(2, 3), 0);
//     seg.update(1, 5, 20);
//     assert_eq!(seg.query(0, 3), 20);
//     assert_eq!(seg.query(0, 1), 10);
//     seg.update(0, 1, 5);
//     assert_eq!(seg.query(0, 1), 5);
// }

fn solve() {
    let mut seg: SEGLazy<RUQ> = SEGLazy::new(201010, INF);
    seg.update(0, 1, 0);
    let n: usize = read();
    let mut r: Vec<usize> = read_vec();
    for i in 0..n - 1 {
        let v = seg.query(i, i + 1);
        seg.update(i + 1, r[i], v + 1);
    }
    let res = seg.query(n - 1, n);
    p!(res);
    return;
}