#1081708 (Rust) No.3134 二分探索木

• 問題: No.3134 二分探索木
• ユーザー: Moss_Local
• 提出日時: 2025-05-02 21:54:24
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 75 ms / 2,000 ms
• コード長: 5,658 bytes
• コンパイル時間: 13,550 ms
• コンパイル使用メモリ: 378,344 KB
• 実行使用メモリ: 32,156 KB
• 最終ジャッジ日時: 2025-05-02 21:54:41
• 合計ジャッジ時間: 14,980 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 5
other	AC * 15

コンパイルメッセージ

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

warning: variable does not need to be mutable
   --> src/main.rs:125:9
    |
125 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:130:9
    |
130 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:136:9
    |
136 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:141:9
    |
141 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:146:9
    |
146 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:151:9
    |
151 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:157:9
    |
157 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:176:9
    |
176 |     let mut priority: Vec<usize> = pairs.iter().map(|&(_, orig)| orig).collect();
    |         ----^^^^^^^^
    |         |
    |         help: remove this `mut`

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

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

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

//input output
#[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 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 vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn main() {
    let n = read::<usize>();
    let a = read_vec::<usize>();

    let mut pairs: Vec<(usize, usize)> = a.iter().enumerate().map(|(i, &v)| (v, i)).collect();
    pairs.sort_unstable_by_key(|&(v, _)| v);

    let mut inv = vec![0; n];
    for (j, &(_, orig)) in pairs.iter().enumerate() {
        inv[orig] = j;
    }

    let mut parent = vec![-1; n];
    let mut left = vec![-1; n];
    let mut right = vec![-1; n];
    let mut priority: Vec<usize> = pairs.iter().map(|&(_, orig)| orig).collect();

    let mut stack = Vec::new();
    for j in 0..n {
        let mut last = -1;
        while let Some(&top) = stack.last() {
            if priority[top] > priority[j] {
                stack.pop();
                last = top as i32;
            } else {
                break;
            }
        }
        if let Some(&top) = stack.last() {
            right[top] = j as i32;
            parent[j] = top as i32;
        }
        if last != -1 {
            left[j] = last;
            parent[last as usize] = j as i32;
        }
        stack.push(j);
    }

    let root = (0..n).find(|&j| parent[j] == -1).unwrap();

    let mut depth = vec![0; n];
    let mut stk = vec![(root, 0)];
    while let Some((u, d)) = stk.pop() {
        depth[u] = d;
        if right[u] != -1 {
            stk.push((right[u] as usize, d + 1));
        }
        if left[u] != -1 {
            stk.push((left[u] as usize, d + 1));
        }
    }

    let mut subtree = vec![0; n];
    let mut post = vec![(root, false)];
    while let Some((u, visited)) = post.pop() {
        if !visited {
            post.push((u, true));
            if right[u] != -1 {
                post.push((right[u] as usize, false));
            }
            if left[u] != -1 {
                post.push((left[u] as usize, false));
            }
        } else {
            let mut sz = 1;
            if left[u] != -1 {
                sz += subtree[left[u] as usize];
            }
            if right[u] != -1 {
                sz += subtree[right[u] as usize];
            }
            subtree[u] = sz;
        }
    }

    let mut rd = vec![0; n];
    let mut rc = vec![0; n];
    for i in 0..n {
        let j = inv[i];
        rd[i] = depth[j];
        rc[i] = subtree[j] - 1;
    }

    vp!(rd);
    vp!(rc);
}