#543170 (Rust) No.1170 Never Want to Walk

• 問題: No.1170 Never Want to Walk
• ユーザー: koba-e964
• 提出日時: 2020-08-29 16:58:23
• 言語: Rust (1.77.0 + proconio)
• 結果: TLE
• 実行時間: -
• コード長: 5,098 bytes
• コンパイル時間: 21,623 ms
• コンパイル使用メモリ: 391,940 KB
• 実行使用メモリ: 13,764 KB
• 最終ジャッジ日時: 2024-11-14 14:15:20
• 合計ジャッジ時間: 38,143 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 13,764 KB
testcase_01	AC	1 ms; 13,220 KB
testcase_02	AC	1 ms; 13,760 KB
testcase_03	AC	1 ms; 13,216 KB
testcase_04	AC	1 ms; 13,344 KB
testcase_05	AC	1 ms; 13,344 KB
testcase_06	AC	1 ms; 13,476 KB
testcase_07	AC	1 ms; 13,476 KB
testcase_08	AC	1 ms; 13,348 KB
testcase_09	AC	1 ms; 13,224 KB
testcase_10	AC	1 ms; 13,216 KB
testcase_11	AC	1 ms; 13,764 KB
testcase_12	AC	1 ms; 13,764 KB
testcase_13	AC	1 ms; 6,820 KB
testcase_14	AC	2 ms; 6,816 KB
testcase_15	AC	1 ms; 6,820 KB
testcase_16	AC	2 ms; 6,816 KB
testcase_17	AC	1 ms; 6,820 KB
testcase_18	AC	2 ms; 6,816 KB
testcase_19	AC	1 ms; 6,820 KB
testcase_20	AC	2 ms; 6,820 KB
testcase_21	AC	1 ms; 6,820 KB
testcase_22	AC	12 ms; 6,816 KB
testcase_23	AC	5 ms; 6,820 KB
testcase_24	AC	12 ms; 6,816 KB
testcase_25	AC	12 ms; 6,820 KB
testcase_26	AC	8 ms; 6,820 KB
testcase_27	AC	98 ms; 6,816 KB
testcase_28	AC	97 ms; 6,820 KB
testcase_29	AC	97 ms; 7,296 KB
testcase_30	AC	99 ms; 7,040 KB
testcase_31	AC	96 ms; 6,820 KB
testcase_32	TLE	-
testcase_33	TLE	-
testcase_34	TLE	-
testcase_35	TLE	-
testcase_36	TLE	-
testcase_37	TLE	-
testcase_38	TLE	-

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/**
 * Union-Find tree.
 * Verified by https://atcoder.jp/contests/pakencamp-2019-day3/submissions/9253305
 */
struct UnionFind { disj: Vec<usize>, rank: Vec<usize> }

impl UnionFind {
    fn new(n: usize) -> Self {
        let disj = (0..n).collect();
        UnionFind { disj: disj, rank: vec![1; n] }
    }
    fn root(&mut self, x: usize) -> usize {
        if x != self.disj[x] {
            let par = self.disj[x];
            let r = self.root(par);
            self.disj[x] = r;
        }
        self.disj[x]
    }
    fn unite(&mut self, x: usize, y: usize) {
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y { return }
        if self.rank[x] > self.rank[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.disj[x] = y;
        self.rank[y] += self.rank[x];
    }
    #[allow(unused)]
    fn is_same_set(&mut self, x: usize, y: usize) -> bool {
        self.root(x) == self.root(y)
    }
    #[allow(unused)]
    fn size(&mut self, x: usize) -> usize {
        let x = self.root(x);
        self.rank[x]
    }
}

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, a: i64, b: i64,
        x: [i64; n],
    }
    let mut uf = UnionFind::new(n);
    for i in 0..n {
        let idx1 = x.lower_bound(&(x[i] + a));
        let idx2 = x.upper_bound(&(x[i] + b));
        if idx1 < idx2 {
            uf.unite(i, idx1);
            for j in idx1..idx2 - 1 {
                uf.unite(j, j + 1);
            }
        }
        let idx1 = x.lower_bound(&(x[i] - b));
        let idx2 = x.upper_bound(&(x[i] - a));
        if idx1 < idx2 {
            uf.unite(i, idx1);
            for j in idx1..idx2 - 1 {
                uf.unite(j, j + 1);
            }
        }
    }
    let mut cnt = vec![0; n];
    for i in 0..n {
        cnt[uf.root(i)] += 1;
    }
    for i in 0..n {
        puts!("{}\n", cnt[uf.root(i)]);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}