#873156 (Rust) No.2316 Freight Train

提出ソース
結果

問題	No.2316 Freight Train
ユーザー	cotton_fn_
提出日時	2023-05-27 18:21:27
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	39 ms / 2,000 ms
コード長	16,772 bytes
コンパイル時間	15,486 ms
コンパイル使用メモリ	378,996 KB
実行使用メモリ	7,296 KB
最終ジャッジ日時	2024-06-07 18:22:11
合計ジャッジ時間	19,608 ms
ジャッジサーバーID （参考情報）	judge3 / judge2
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	0 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	35 ms 7,040 KB
testcase_04	AC	16 ms 5,376 KB
testcase_05	AC	13 ms 5,376 KB
testcase_06	AC	3 ms 5,376 KB
testcase_07	AC	20 ms 5,376 KB
testcase_08	AC	23 ms 5,888 KB
testcase_09	AC	24 ms 5,504 KB
testcase_10	AC	23 ms 5,376 KB
testcase_11	AC	26 ms 5,888 KB
testcase_12	AC	30 ms 6,272 KB
testcase_13	AC	36 ms 7,168 KB
testcase_14	AC	36 ms 7,168 KB
testcase_15	AC	37 ms 7,168 KB
testcase_16	AC	36 ms 7,168 KB
testcase_17	AC	39 ms 7,168 KB
testcase_18	AC	36 ms 7,168 KB
testcase_19	AC	36 ms 7,040 KB
testcase_20	AC	37 ms 7,168 KB
testcase_21	AC	37 ms 7,040 KB
testcase_22	AC	39 ms 7,296 KB
testcase_23	AC	17 ms 6,400 KB
testcase_24	AC	20 ms 7,168 KB
testcase_25	AC	17 ms 6,528 KB
testcase_26	AC	15 ms 6,656 KB
testcase_27	AC	7 ms 5,376 KB
testcase_28	AC	1 ms 5,376 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#![allow(unused_imports)]
use input::*;
use std::{
    collections::*,
    io::{self, BufWriter, Read, Write},
};
fn run<I: Input, O: Write>(mut ss: I, mut out: O) {
    let t: u32 = 1;
    for _ in 0..t {
        case(&mut ss, &mut out);
    }
}
fn case<I: Input, O: Write>(mut ss: I, mut out: O) {
    let (n, q): (usize, usize) = ss.parse();
    let mut dsu = dsu::Dsu::new(n + 1);
    for (i, p) in (1..=n).zip(ss.seq::<isize>()) {
        if p >= 0 {
            dsu.unite(i, p as _);
        }
    }
    for (a, b) in ss.seq::<(usize, usize)>().take(q) {
        if dsu.is_same(a, b) {
            wln!(out, "Yes");
        } else {
            wln!(out, "No");
        }
    }
}
fn main() {
    let stdin = io::stdin();
    let ss = SplitWs::new(stdin.lock());
    let stdout = io::stdout();
    let out = BufWriter::new(stdout.lock());
    run(ss, out);
}
pub mod dsu {
    #[derive(Clone)]
    pub struct Dsu(Vec<isize>);
    impl Dsu {
        pub fn new(n: usize) -> Self {
            Self(vec![-1; n])
        }
        pub fn root(&self, mut u: usize) -> usize {
            while self.0[u] >= 0 {
                u = self.0[u] as usize;
            }
            u
        }
        pub fn is_root(&self, u: usize) -> bool {
            self.0[u] < 0
        }
        pub fn unite(&mut self, u: usize, v: usize) -> UniteResult {
            let ru = self.root(u);
            let rv = self.root(v);
            if ru == rv {
                return UniteResult {
                    root: ru,
                    united_root: None,
                    size: -self.0[ru] as _,
                };
            }
            let (r, c) = if -self.0[ru] >= -self.0[rv] {
                (ru, rv)
            } else {
                (rv, ru)
            };
            self.0[r] += self.0[c];
            self.0[c] = r as isize;
            UniteResult {
                root: r,
                united_root: Some(c),
                size: -self.0[r] as _,
            }
        }
        pub fn is_same(&self, u: usize, v: usize) -> bool {
            self.root(u) == self.root(v)
        }
        pub fn size(&self, u: usize) -> usize {
            -self.0[self.root(u)] as usize
        }
        pub fn reset(&mut self) {
            todo!();
        }
    }
    #[derive(Clone, Copy, PartialEq, Eq, Debug)]
    pub struct UniteResult {
        pub root: usize,
        pub united_root: Option<usize>,
        pub size: usize,
    }
    impl UniteResult {
        pub fn is_united(&self) -> bool {
            self.united_root.is_some()
        }
    }
    use std::mem::ManuallyDrop;
    pub struct DsuMerge<T, F> {
        inner: Dsu,
        data: Vec<ManuallyDrop<T>>,
        merge: F,
    }
    impl<T, F: FnMut(&mut T, T)> DsuMerge<T, F> {
        pub fn new(n: usize, init: T, merge: F) -> Self
        where
            T: Clone,
        {
            Self::from_iterator((0..n).map(|_| init.clone()), merge)
        }
        pub fn from_fn(n: usize, init: impl FnMut(usize) -> T, merge: F) -> Self {
            Self::from_iterator((0..n).map(init), merge)
        }
        pub fn from_iterator(iter: impl IntoIterator<Item = T>, merge: F) -> Self {
            let data: Vec<_> = iter.into_iter().map(|x| ManuallyDrop::new(x)).collect();
            Self {
                inner: Dsu::new(data.len()),
                data,
                merge,
            }
        }
        pub fn root(&self, u: usize) -> usize {
            self.inner.root(u)
        }
        pub fn is_root(&self, u: usize) -> bool {
            self.inner.is_root(u)
        }
        pub fn unite(&mut self, u: usize, v: usize) -> (UniteResult, &mut T) {
            let res = self.inner.unite(u, v);
            if let Some(c) = res.united_root {
                let taken = unsafe { ManuallyDrop::take(&mut self.data[c]) };
                (self.merge)(&mut self.data[res.root], taken);
            }
            (res, &mut self.data[res.root])
        }
        pub fn is_same(&self, u: usize, v: usize) -> bool {
            self.inner.is_same(u, v)
        }
        pub fn size(&self, u: usize) -> usize {
            self.inner.size(u)
        }
        pub fn data(&self, u: usize) -> &T {
            &self.data[self.root(u)]
        }
        pub fn data_mut(&mut self, u: usize) -> &mut T {
            &mut self.data[self.inner.root(u)]
        }
    }
    impl<T, F> Drop for DsuMerge<T, F> {
        fn drop(&mut self) {
            for (u, data) in self.data.iter_mut().enumerate() {
                if self.inner.is_root(u) {
                    unsafe {
                        ManuallyDrop::drop(data);
                    }
                }
            }
        }
    }
}
pub mod input {
    use std::{
        io::{self, prelude::*},
        marker::PhantomData,
    };
    #[macro_export]
    macro_rules ! input { ($ src : expr , $ ($ var : ident $ (($ count : expr $ (, $ map : expr) ?)) ? $ (: $ ty : ty) ?) ,* $ (,) ?) => { $ (input ! (@ $ src , $ var $ (($ count $ (, $ map) ?)) ? $ (: $ ty) ?) ;) * } ; (@ $ src : expr , $ var : ident $ (: $ ty : ty) ?) => { let $ var $ (: $ ty) ? = $ src . parse () ; } ; (@ $ src : expr , $ var : ident ($ count : expr) : $ ($ ty : ty) ?) => { let $ var $ (: $ ty) ? = $ src . seq () . take ($ count) . collect () ; } ; (@ $ src : expr , $ var : ident ($ count : expr , $ map : expr) : $ ($ ty : ty) ?) => { let $ var $ (: $ ty) ? = $ src . seq () . take ($ count) . map ($ map) . collect () ; } ; }
    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn bytes_vec(&mut self) -> Vec<u8> {
            self.bytes().to_vec()
        }
        fn str(&mut self) -> &str {
            std::str::from_utf8(self.bytes()).unwrap()
        }
        fn parse<T: Parse>(&mut self) -> T {
            self.parse_with(DefaultParser)
        }
        fn parse_with<T>(&mut self, mut parser: impl Parser<T>) -> T {
            parser.parse(self)
        }
        fn seq<T: Parse>(&mut self) -> Seq<T, Self, DefaultParser> {
            self.seq_with(DefaultParser)
        }
        fn seq_with<T, P: Parser<T>>(&mut self, parser: P) -> Seq<T, Self, P> {
            Seq {
                input: self,
                parser,
                marker: PhantomData,
            }
        }
        fn collect<T: Parse, C: std::iter::FromIterator<T>>(&mut self, n: usize) -> C {
            self.seq().take(n).collect()
        }
    }
    impl<T: Input> Input for &mut T {
        fn bytes(&mut self) -> &[u8] {
            (**self).bytes()
        }
    }
    pub trait Parser<T> {
        fn parse<I: Input + ?Sized>(&mut self, s: &mut I) -> T;
    }
    impl<T, P: Parser<T>> Parser<T> for &mut P {
        fn parse<I: Input + ?Sized>(&mut self, s: &mut I) -> T {
            (**self).parse(s)
        }
    }
    pub trait Parse {
        fn parse<I: Input + ?Sized>(s: &mut I) -> Self;
    }
    pub struct DefaultParser;
    impl<T: Parse> Parser<T> for DefaultParser {
        fn parse<I: Input + ?Sized>(&mut self, s: &mut I) -> T {
            T::parse(s)
        }
    }
    pub struct Seq<'a, T, I: ?Sized, P> {
        input: &'a mut I,
        parser: P,
        marker: PhantomData<*const T>,
    }
    impl<'a, T, I: Input + ?Sized, P: Parser<T>> Iterator for Seq<'a, T, I, P> {
        type Item = T;
        #[inline]
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.input.parse_with(&mut self.parser))
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    impl Parse for char {
        #[inline]
        fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
            let s = s.bytes();
            debug_assert_eq!(s.len(), 1);
            *s.first().expect("zero length") as char
        }
    }
    macro_rules ! tuple { ($ ($ T : ident) ,*) => { impl <$ ($ T : Parse) ,*> Parse for ($ ($ T ,) *) { # [inline] # [allow (unused_variables)] # [allow (clippy :: unused_unit)] fn parse < I : Input + ? Sized > (s : & mut I) -> Self { ($ ($ T :: parse (s) ,) *) } } } ; }
    tuple!();
    tuple!(A);
    tuple!(A, B);
    tuple!(A, B, C);
    tuple!(A, B, C, D);
    tuple!(A, B, C, D, E);
    tuple!(A, B, C, D, E, F);
    tuple!(A, B, C, D, E, F, G);
    #[cfg(feature = "newer")]
    impl<T: Parse, const N: usize> Parse for [T; N] {
        fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
            use std::{
                mem::{self, MaybeUninit},
                ptr,
            };
            struct Guard<T, const N: usize> {
                arr: [MaybeUninit<T>; N],
                i: usize,
            }
            impl<T, const N: usize> Drop for Guard<T, N> {
                fn drop(&mut self) {
                    unsafe {
                        ptr::drop_in_place(&mut self.arr[..self.i] as *mut _ as *mut [T]);
                    }
                }
            }
            let mut g = Guard::<T, N> {
                arr: unsafe { MaybeUninit::uninit().assume_init() },
                i: 0,
            };
            while g.i < N {
                g.arr[g.i] = MaybeUninit::new(s.parse());
                g.i += 1;
            }
            unsafe { mem::transmute_copy(&g.arr) }
        }
    }
    macro_rules! uint {
        ($ ty : ty) => {
            impl Parse for $ty {
                #[inline]
                fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
                    let s = s.bytes();
                    s.iter().fold(0, |x, d| 10 * x + (0xf & d) as $ty)
                }
            }
        };
    }
    macro_rules! int {
        ($ ty : ty) => {
            impl Parse for $ty {
                #[inline]
                fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
                    let f = |s: &[u8]| {
                        s.iter()
                            .fold(0 as $ty, |x, d| (10 * x).wrapping_add((0xf & d) as $ty))
                    };
                    let s = s.bytes();
                    if let Some((b'-', s)) = s.split_first() {
                        f(s).wrapping_neg()
                    } else {
                        f(s)
                    }
                }
            }
        };
    }
    macro_rules! float {
        ($ ty : ty) => {
            impl Parse for $ty {
                fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
                    const POW: [$ty; 18] = [
                        1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13,
                        1e14, 1e15, 1e16, 1e17,
                    ];
                    let s = s.bytes();
                    let (minus, s) = if let Some((b'-', s)) = s.split_first() {
                        (true, s)
                    } else {
                        (false, s)
                    };
                    let (int, fract) = if let Some(p) = s.iter().position(|c| *c == b'.') {
                        (&s[..p], &s[p + 1..])
                    } else {
                        (s, &[][..])
                    };
                    let x = int
                        .iter()
                        .chain(fract)
                        .fold(0u64, |x, d| 10 * x + (0xf & *d) as u64);
                    let x = x as $ty;
                    let x = if minus { -x } else { x };
                    let exp = fract.len();
                    if exp == 0 {
                        x
                    } else if let Some(pow) = POW.get(exp) {
                        x / pow
                    } else {
                        x / (10.0 as $ty).powi(exp as i32)
                    }
                }
            }
        };
    }
    macro_rules! from_bytes {
        ($ ty : ty) => {
            impl Parse for $ty {
                #[inline]
                fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
                    s.bytes().into()
                }
            }
        };
    }
    macro_rules! from_str {
        ($ ty : ty) => {
            impl Parse for $ty {
                #[inline]
                fn parse<I: Input + ?Sized>(s: &mut I) -> Self {
                    s.str().into()
                }
            }
        };
    }
    macro_rules ! impls { ($ m : ident , $ ($ ty : ty) ,*) => { $ ($ m ! ($ ty) ;) * } ; }
    impls!(uint, usize, u8, u16, u32, u64, u128);
    impls!(int, isize, i8, i16, i32, i64, i128);
    impls!(float, f32, f64);
    impls!(from_bytes, Vec<u8>, Box<[u8]>);
    impls!(from_str, String);
    #[derive(Clone)]
    pub struct SplitWs<T> {
        src: T,
        buf: Vec<u8>,
        pos: usize,
        len: usize,
    }
    const BUF_SIZE: usize = 1 << 26;
    impl<T: Read> SplitWs<T> {
        pub fn new(src: T) -> Self {
            Self {
                src,
                buf: vec![0; BUF_SIZE],
                pos: 0,
                len: 0,
            }
        }
        #[inline(always)]
        fn peek(&self) -> &[u8] {
            unsafe { self.buf.get_unchecked(self.pos..self.len) }
        }
        #[inline(always)]
        fn consume(&mut self, n: usize) -> &[u8] {
            let pos = self.pos;
            self.pos += n;
            unsafe { self.buf.get_unchecked(pos..self.pos) }
        }
        fn read(&mut self) -> usize {
            self.buf.copy_within(self.pos..self.len, 0);
            self.len -= self.pos;
            self.pos = 0;
            if self.len == self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            loop {
                match self.src.read(&mut self.buf[self.len..]) {
                    Ok(n) => {
                        self.len += n;
                        return n;
                    }
                    Err(e) if e.kind() == io::ErrorKind::WouldBlock => {}
                    Err(e) => panic!("io error: {:?}", e),
                }
            }
        }
    }
    impl<T: Read> Input for SplitWs<T> {
        #[inline]
        fn bytes(&mut self) -> &[u8] {
            loop {
                if let Some(del) = self.peek().iter().position(|c| c.is_ascii_whitespace()) {
                    if del > 0 {
                        let s = self.consume(del + 1);
                        return s.split_last().unwrap().1;
                    } else {
                        self.consume(1);
                    }
                } else if self.read() == 0 {
                    return self.consume(self.len - self.pos);
                }
            }
        }
    }
}
pub mod macros {
    extern "C" {
        pub fn isatty(fd: i32) -> i32;
    }
    #[macro_export]
    macro_rules ! w { ($ dst : expr , $ ($ arg : tt) *) => { if cfg ! (debug_assertions) && unsafe { $ crate :: macros :: isatty (1) } != 0 { write ! ($ dst , "\x1B[1;33m") . unwrap () ; write ! ($ dst , $ ($ arg) *) . unwrap () ; write ! ($ dst , "\x1B[0m") . unwrap () ; } else { write ! ($ dst , $ ($ arg) *) . unwrap () ; } } }
    #[macro_export]
    macro_rules ! wln { ($ dst : expr $ (, $ ($ arg : tt) *) ?) => { { if cfg ! (debug_assertions) && unsafe { $ crate :: macros :: isatty (1) } != 0 { write ! ($ dst , "\x1B[1;33m") . unwrap () ; writeln ! ($ dst $ (, $ ($ arg) *) ?) . unwrap () ; write ! ($ dst , "\x1B[0m") . unwrap () ; } else { writeln ! ($ dst $ (, $ ($ arg) *) ?) . unwrap () ; } # [cfg (debug_assertions)] $ dst . flush () . unwrap () ; } } }
    #[macro_export]
    macro_rules! w_iter {
        ($ dst : expr , $ fmt : expr , $ iter : expr , $ delim : expr) => {{
            let mut first = true;
            for elem in $iter {
                if first {
                    w!($dst, $fmt, elem);
                    first = false;
                } else {
                    w!($dst, concat!($delim, $fmt), elem);
                }
            }
        }};
        ($ dst : expr , $ fmt : expr , $ iter : expr) => {
            w_iter!($dst, $fmt, $iter, " ")
        };
    }
    #[macro_export]
    macro_rules ! w_iter_ln { ($ dst : expr , $ ($ t : tt) *) => { { w_iter ! ($ dst , $ ($ t) *) ; wln ! ($ dst) ; } } }
    #[macro_export]
    macro_rules ! e { ($ ($ t : tt) *) => { # [cfg (debug_assertions)] eprint ! ($ ($ t) *) } }
    #[macro_export]
    macro_rules ! eln { ($ ($ t : tt) *) => { # [cfg (debug_assertions)] eprintln ! ($ ($ t) *) } }
    #[macro_export]
    #[doc(hidden)]
    macro_rules ! __tstr { ($ h : expr $ (, $ t : expr) +) => { concat ! (__tstr ! ($ ($ t) ,+) , ", " , __tstr ! (@)) } ; ($ h : expr) => { concat ! (__tstr ! () , " " , __tstr ! (@)) } ; () => { "\x1B[94m[{}:{}]\x1B[0m" } ; (@) => { "\x1B[1;92m{}\x1B[0m = {:?}" } }
    #[macro_export]
    macro_rules ! d { ($ ($ a : expr) ,*) => { if std :: env :: var ("ND") . map (| v | & v == "0") . unwrap_or (true) { eln ! (__tstr ! ($ ($ a) ,*) , file ! () , line ! () , $ (stringify ! ($ a) , $ a) ,*) ; } } ; }
}
yukicoder

結果

テストケース

ソースコード
