#611605 (Rust) No.1370 置換門松列

• 問題: No.1370 置換門松列
• ユーザー: cotton_fn_
• 提出日時: 2021-01-30 05:59:15
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 14 ms / 2,000 ms
• コード長: 10,826 bytes
• コンパイル時間: 13,820 ms
• コンパイル使用メモリ: 380,248 KB
• 実行使用メモリ: 7,552 KB
• 最終ジャッジ日時: 2024-09-14 19:23:59
• 合計ジャッジ時間: 15,435 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	11 ms; 7,552 KB
testcase_22	AC	7 ms; 6,656 KB
testcase_23	AC	11 ms; 7,552 KB
testcase_24	AC	5 ms; 5,376 KB
testcase_25	AC	14 ms; 7,552 KB
testcase_26	AC	14 ms; 7,552 KB
testcase_27	AC	10 ms; 6,784 KB
testcase_28	AC	10 ms; 6,784 KB
testcase_29	AC	6 ms; 5,376 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter, mem,
};

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    let (n, m): (usize, usize) = kin.input();
    let mut g = Graph::builder(m);
    let mut prev = !0;
    let mut prev_prev = !0;
    for (i, a) in kin.iter::<usize>().take(n).enumerate() {
        let a = a - 1;
        if a == prev_prev {
            outln!(out, "No");
            return;
        }
        if i > 0 {
            if i % 2 == 0 {
                g.edge(prev, a);
            } else {
                g.edge(a, prev);
            }
        }
        prev_prev = prev;
        prev = a;
    }
    let g = g.build();
    /*
    for u in 0..m {
        eout!("{} -> {:?}", u, &g[u]);
    }
    */
    if let Some(v) = tsort(&g) {
        eout!("{:?}", v);
        let mut x = vec![0; m];
        for (i, v) in v.into_iter().enumerate() {
            x[v] = i + 1;
        }
        outln!(out, "Yes");
        for x in x {
            out!(out, "{} ", x);
        }
        outln!(out);
    } else {
        outln!(out, "No");
    }
}

pub fn tsort(g: &Graph) -> Option<Vec<usize>> {
    let mut res = vec![0; g.len()];
    let mut i = res.len();
    let mut stack = Vec::new();
    let mut state = vec![0u8; g.len()];
    for u in (0..g.len()).rev() {
        debug_assert!(stack.is_empty());
        if state[u] != 0 {
            debug_assert_eq!(state[u], 2);
            continue;
        }
        stack.push(u);
        while let Some(u) = stack.pop() {
            if u as isize >= 0 {
                if state[u] != 0 {
                    continue;
                }
                state[u] = 1;
                stack.push(!u);
                for &v in g[u].iter().rev() {
                    match state[v] {
                        0 => stack.push(v),
                        1 => return None,
                        _ => {},
                    }
                }
            } else {
                let u = !u;
                state[u] = 2;
                i -= 1;
                res[i] = u;
            }
        }
    }
    debug_assert_eq!(i, 0);
    Some(res)
}

use std::ops;
pub struct Graph(LabeledGraph<()>);
impl Graph {
    pub fn builder(n: usize) -> GraphBuilder {
        GraphBuilder(LabeledGraph::builder(n))
    }
    pub fn len(&self) -> usize {
        self.0.len()
    }
}
impl ops::Index<usize> for Graph {
    type Output = [usize];
    fn index(&self, u: usize) -> &Self::Output {
        // https://rust-lang.github.io/unsafe-code-guidelines/layout/structs-and-tuples.html#structs-with-1-zst-fields
        unsafe { &*(self.0.index(u) as *const _ as *const _) }
    }
}
impl ops::IndexMut<usize> for Graph {
    fn index_mut(&mut self, u: usize) -> &mut Self::Output {
        unsafe { &mut *(self.0.index_mut(u) as *mut _ as *mut _) }
    }
}
pub struct GraphBuilder(LabeledGraphBuilder<()>);
impl GraphBuilder {
    pub fn edge(&mut self, u: usize, v: usize) {
        self.0.edge(u, v, ());
    }
    pub fn bi_edge(&mut self, u: usize, v: usize) {
        self.0.bi_edge(u, v, ());
    }
    pub fn build(&mut self) -> Graph {
        Graph(self.0.build())
    }
}
pub struct LabeledGraph<T> {
    edges: Box<[(usize, T)]>,
    heads: Box<[usize]>,
}
impl<T: Clone> LabeledGraph<T> {
    pub fn builder(n: usize) -> LabeledGraphBuilder<T> {
        LabeledGraphBuilder {
            nodes: Vec::new(),
            heads: vec![!0; n],
        }
    }
    pub fn len(&self) -> usize {
        self.heads.len() - 1
    }
}
impl<T> ops::Index<usize> for LabeledGraph<T> {
    type Output = [(usize, T)];
    fn index(&self, u: usize) -> &Self::Output {
        &self.edges[self.heads[u]..self.heads[u + 1]]
    }
}
impl<T> ops::IndexMut<usize> for LabeledGraph<T> {
    fn index_mut(&mut self, u: usize) -> &mut Self::Output {
        &mut self.edges[self.heads[u]..self.heads[u + 1]]
    }
}
pub struct LabeledGraphBuilder<T> {
    nodes: Vec<((usize, T), usize)>,
    heads: Vec<usize>,
}
impl<T: Clone> LabeledGraphBuilder<T> {
    pub fn edge(&mut self, u: usize, v: usize, l: T) {
        self.nodes.push(((v, l), self.heads[u]));
        self.heads[u] = self.nodes.len() - 1;
    }
    pub fn bi_edge(&mut self, u: usize, v: usize, l: T) {
        self.edge(u, v, l.clone());
        self.edge(v, u, l);
    }
    pub fn build(&mut self) -> LabeledGraph<T> {
        let mut edges = Vec::with_capacity(self.nodes.len());
        let mut heads = Vec::with_capacity(self.heads.len() + 1);
        for &(mut h) in &self.heads {
            heads.push(edges.len());
            while let Some((e, next)) = self.nodes.get(h) {
                edges.push(e.clone());
                h = *next;
            }
        }
        heads.push(edges.len());
        LabeledGraph {
            edges: edges.into(),
            heads: heads.into(),
        }
    }
}


// -----------------------------------------------------------------------------
fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(1 << 26)
        .spawn(|| {
            run(
                KInput::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

#[macro_export]
macro_rules! out {
    ($($arg:tt)*) => { write!($($arg)*).unwrap(); }
}
#[macro_export]
macro_rules! outln {
    ($dst:expr $(, $($arg:tt)*)?) => {{
        writeln!($dst $(, $($arg)*)?).unwrap();
        if cfg!(debug_assertions) { $dst.flush().unwrap(); }
    }}
}
#[macro_export]
macro_rules! eout {
    ($($arg:tt)*) => { if cfg!(debug_assertions) { eprintln!($($arg)*); } }
}
#[macro_export]
macro_rules! kdbg {
    ($($v:expr),*) => { if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) } }
}

pub mod kyoproio {
    use std::{
        io::prelude::*,
        iter::FromIterator,
        marker::PhantomData,
        mem::{self, MaybeUninit},
        str,
    };

    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            str::from_utf8(self.bytes()).unwrap()
        }
        fn input<T: InputItem>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputItem>(&mut self) -> Iter<T, Self> {
            Iter(self, PhantomData)
        }
        fn collect<T: InputItem, B: FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
        fn map<T: InputItem, U, F: FnMut(T) -> U, B: FromIterator<U>>(
            &mut self,
            n: usize,
            f: F,
        ) -> B {
            self.iter().take(n).map(f).collect()
        }
    }
    impl<I: Input> Input for &mut I {
        fn bytes(&mut self) -> &[u8] {
            (**self).bytes()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: Vec<u8>,
        pos: usize,
        len: usize,
    }
    impl<R: Read> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: vec![0; 1 << 16],
                pos: 0,
                len: 0,
            }
        }
        fn read(&mut self) -> usize {
            if self.pos > 0 {
                self.buf.copy_within(self.pos..self.len, 0);
                self.len -= self.pos;
                self.pos = 0;
            } else if self.len >= self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            let n = self.src.read(&mut self.buf[self.len..]).unwrap();
            self.len += n;
            n
        }
    }
    impl<R: Read> Input for KInput<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(d) = self.buf[self.pos..self.len]
                    .iter()
                    .position(u8::is_ascii_whitespace)
                {
                    let p = self.pos;
                    self.pos += d + 1;
                    if d > 0 {
                        return &self.buf[p..p + d];
                    }
                }
                if self.read() == 0 {
                    return &self.buf[mem::replace(&mut self.pos, self.len)..self.len];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, PhantomData<*const T>);
    impl<'a, T: InputItem, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    pub trait InputItem: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputItem for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.bytes().to_owned()
        }
    }
    macro_rules! from_str {
        ($($T:ty)*) => {$(
            impl InputItem for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().unwrap()
                }
            }
        )*}
    }
    from_str!(String char bool f32 f64);
    macro_rules! parse_int {
        ($($I:ty: $U:ty)*) => {$(
            impl InputItem for $I {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let f = |s: &[u8]| s.iter().fold(0, |x, b| 10 * x + (b & 0xf) as $I);
                    let s = src.bytes();
                    if let Some((&b'-', t)) = s.split_first() { -f(t) } else { f(s) }
                }
            }
            impl InputItem for $U {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().iter().fold(0, |x, b| 10 * x + (b & 0xf) as $U)
                }
            }
        )*}
    }
    parse_int!(isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128);
    macro_rules! tuple {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputItem, $($T: InputItem),*> InputItem for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple!($($T)*);
        };
        () => {}
    }
    tuple!(A B C D E F G);
    macro_rules! array {
        ($($N:literal)*) => {$(
            impl<T: InputItem> InputItem for [T; $N] {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    unsafe {
                        let mut arr: [MaybeUninit<T>; $N] = MaybeUninit::uninit().assume_init();
                        for elem in &mut arr {
                            *elem = MaybeUninit::new(src.input());
                        }
                        mem::transmute_copy(&arr)
                    }
                }
            }
        )*}
    }
    array!(1 2 3 4 5 6 7 8);
}