結果

問題 No.1266 7 Colors
ユーザー cotton_fn_
提出日時 2020-11-07 05:50:53
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 65 ms / 3,000 ms
コード長 10,409 bytes
コンパイル時間 14,025 ms
コンパイル使用メモリ 379,080 KB
実行使用メモリ 13,888 KB
最終ジャッジ日時 2024-07-22 14:19:40
合計ジャッジ時間 17,393 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused_imports, unused_macros)]
use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};
fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }
    use graph::Graph;
    let (n, m, q): (usize, usize, usize) = kin.input();
    let mut s: Vec<u8> = Vec::with_capacity(n + 1);
    s.push(0);
    for _ in 0..n {
        let mut x = 0;
        for (i, c) in kin.bytes().iter().enumerate() {
            x |= (c & 1) << i;
        }
        s.push(x);
    }
    let mut g = Graph::builder(n + 1);
    for (u, v) in kin.iter::<(usize, usize)>().take(m) {
        g.edge(u, v);
        g.edge(v, u);
    }
    let g = g.build();
    let mut uf = UnionFind::new(7 * (n + 1));
    for u in 1..=n {
        for c in 0..7 {
            let d = (c + 1) % 7;
            if s[u] >> c & s[u] >> d & 1 == 1 {
                uf.unite(7 * u + c, 7 * u + d);
            }
        }
        for &v in &g[u] {
            for c in 0..7 {
                if s[u] >> c & s[v] >> c & 1 == 1 {
                    uf.unite(7 * u + c, 7 * v + c);
                }
            }
        }
    }
    for (t, x, y) in kin.iter::<(u8, usize, usize)>().take(q) {
        if t == 1 {
            let u = x;
            let c = y - 1;
            s[u] |= 1 << c;
            for &d in &[(c + 1) % 7, (c + 6) % 7] {
                if s[u] >> d & 1 == 1 {
                    uf.unite(7 * u + c, 7 * u + d);
                }
            }
            for &v in &g[u] {
                if s[v] >> c & 1 == 1 {
                    uf.unite(7 * u + c, 7 * v + c);
                }
            }
        } else {
            outputln!("{}", uf.size(7 * x));
        }
    }
}
pub struct UnionFind {
    p: Vec<isize>,
}
impl UnionFind {
    pub fn new(n: usize) -> Self {
        Self { p: vec![-1; n] }
    }
    pub fn root(&self, mut u: usize) -> usize {
        while self.p[u] >= 0 {
            u = self.p[u] as usize;
        }
        u
    }
    pub fn size(&self, u: usize) -> usize {
        (-self.p[self.root(u)]) as usize
    }
    pub fn unite(&mut self, u: usize, v: usize) -> bool {
        let mut u = self.root(u);
        let mut v = self.root(v);
        if u == v {
            return false;
        }
        if self.p[u] > self.p[v] {
            swap(&mut u, &mut v);
        }
        self.p[u] += self.p[v];
        self.p[v] = u as isize;
        true
    }
    pub fn is_same(&self, u: usize, v: usize) -> bool {
        self.root(u) == self.root(v)
    }
}
pub mod graph {
    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 std::ops::Index<usize> for Graph {
        type Output = [usize];
        fn index(&self, u: usize) -> &Self::Output {
            unsafe { std::mem::transmute(self.0.index(u)) }
        }
    }
    pub struct GraphBuilder(LabeledGraphBuilder<()>);
    impl GraphBuilder {
        pub fn edge(&mut self, u: usize, v: usize) {
            self.0.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> std::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]]
        }
    }
    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 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(64 * 1024 * 1024)
        .spawn(|| {
            run(
                KInput::new(io::stdin().lock()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}
// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            std::str::from_utf8(self.bytes()).unwrap()
        }
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    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,
            }
        }
    }
    impl<R: Read> Input for KInput<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(delim) = self.buf[self.pos..self.len]
                    .iter()
                    .position(|b| b.is_ascii_whitespace())
                {
                    let range = self.pos..self.pos + delim;
                    self.pos += delim + 1;
                    if delim > 0 {
                        return &self.buf[range];
                    }
                }
                if self.pos > 0 {
                    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);
                }
                let read = self.src.read(&mut self.buf[self.len..]).unwrap();
                if read == 0 {
                    let range = self.pos..self.len;
                    self.pos = self.len;
                    return &self.buf[range];
                }
                self.len += read;
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().unwrap()
                }
            })*
        }
    }
    from_str_impl! { String char bool f32 f64 }
    macro_rules! parse_int_impl {
        { $($I:ty: $U:ty)* } => {
            $(impl InputParse 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 InputParse 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_impl! { isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128 }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    macro_rules! array_impl {
        { $($N:literal)* } => {
            $(impl<T: InputParse> InputParse for [T; $N] {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let mut arr = std::mem::MaybeUninit::uninit();
                    unsafe {
                        let ptr = arr.as_mut_ptr() as *mut T;
                        for i in 0..$N {
                            ptr.add(i).write(src.input());
                        }
                        arr.assume_init()
                    }
                }
            })*
        };
    }
    array_impl! { 1 2 3 4 5 6 7 8 }
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0