結果

問題 No.1170 Never Want to Walk
ユーザー fukafukatani
提出日時 2020-10-07 21:21:12
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 347 ms / 2,000 ms
コード長 3,264 bytes
コンパイル時間 14,516 ms
コンパイル使用メモリ 376,452 KB
実行使用メモリ 24,012 KB
最終ジャッジ日時 2024-07-20 04:07:48
合計ジャッジ時間 19,139 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
use std::ops::Bound::*;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let v = read_vec::<i64>();
    let (n, a, b) = (v[0] as usize, v[1], v[2]);
    let x = read_vec::<i64>()
        .into_iter()
        .enumerate()
        .map(|x| (x.1, x.0))
        .collect::<BTreeSet<_>>();
    let mut edges = vec![vec![]; n];

    for &xnum in &x {
        let mut left = x.range((Included((xnum.0 + a, 0)), Included((xnum.0 + b, n + 1))));
        if let Some(left) = left.next() {
            let left = left.1;
            let right = x
                .range((Included((xnum.0 + a, 0)), Included((xnum.0 + b, n + 1))))
                .rev()
                .next()
                .unwrap()
                .1;
            edges[xnum.1].push(right);
            for i in (left..right).rev() {
                if !edges[i].is_empty() {
                    break;
                }
                edges[i].push(right);
            }
        }
    }
    let mut uft = UnionFindTree::new(n);
    for (i, toes) in edges.into_iter().enumerate() {
        for to in toes {
            if to == std::usize::MAX {
                continue;
            }
            uft.unite(i, to);
        }
    }
    for i in 0..n {
        println!("{}", uft.get_size(i));
    }
}

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

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}
0