結果

問題 No.945 YKC饅頭
ユーザー cotton_fn_cotton_fn_
提出日時 2020-03-24 19:16:32
言語 Rust
(1.77.0)
結果
AC  
実行時間 504 ms / 2,000 ms
コード長 7,586 bytes
コンパイル時間 2,256 ms
コンパイル使用メモリ 165,140 KB
実行使用メモリ 8,484 KB
最終ジャッジ日時 2023-08-30 05:37:04
合計ジャッジ時間 16,694 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 1 ms
4,376 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 3 ms
4,376 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 1 ms
4,376 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 3 ms
4,380 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 3 ms
4,380 KB
testcase_29 AC 1 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 51 ms
4,376 KB
testcase_32 AC 153 ms
4,380 KB
testcase_33 AC 215 ms
4,380 KB
testcase_34 AC 216 ms
4,380 KB
testcase_35 AC 421 ms
6,380 KB
testcase_36 AC 117 ms
4,796 KB
testcase_37 AC 121 ms
4,616 KB
testcase_38 AC 148 ms
4,380 KB
testcase_39 AC 134 ms
4,376 KB
testcase_40 AC 203 ms
4,380 KB
testcase_41 AC 127 ms
4,376 KB
testcase_42 AC 269 ms
5,580 KB
testcase_43 AC 84 ms
4,520 KB
testcase_44 AC 325 ms
5,136 KB
testcase_45 AC 244 ms
6,172 KB
testcase_46 AC 84 ms
4,380 KB
testcase_47 AC 230 ms
4,376 KB
testcase_48 AC 35 ms
4,380 KB
testcase_49 AC 167 ms
4,380 KB
testcase_50 AC 283 ms
6,440 KB
testcase_51 AC 504 ms
7,460 KB
testcase_52 AC 504 ms
7,432 KB
testcase_53 AC 503 ms
8,484 KB
testcase_54 AC 503 ms
8,152 KB
testcase_55 AC 502 ms
8,452 KB
testcase_56 AC 244 ms
4,376 KB
testcase_57 AC 243 ms
4,376 KB
testcase_58 AC 269 ms
5,828 KB
testcase_59 AC 273 ms
6,372 KB
testcase_60 AC 259 ms
4,380 KB
testcase_61 AC 269 ms
5,852 KB
testcase_62 AC 269 ms
5,896 KB
testcase_63 AC 248 ms
4,376 KB
testcase_64 AC 255 ms
4,376 KB
testcase_65 AC 252 ms
4,380 KB
testcase_66 AC 250 ms
4,380 KB
testcase_67 AC 259 ms
4,880 KB
testcase_68 AC 257 ms
4,376 KB
testcase_69 AC 247 ms
4,376 KB
testcase_70 AC 247 ms
4,380 KB
testcase_71 AC 247 ms
4,376 KB
testcase_72 AC 255 ms
4,376 KB
testcase_73 AC 275 ms
6,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused)]

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

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(50 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = Input::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output {
        ($($args:expr),+) => { write!(&mut out, $($args),+) };
    }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!() };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
    }
    let (n, m): (usize, usize) = kin.input();
    let lrt: Vec<(usize, usize, usize)> = kin
        .iter()
        .take(m)
        .map(|(l, r, t): (usize, usize, char)| (l - 1, r, match t {
            'Y' => 1,
            'K' => 2,
            'C' => 3,
            _ => panic!(),
        }))
        .collect();
    let mut sv = SqrtVec::new();
    sv.resize(n, 0);
    for (l, r, t) in lrt.iter().rev().copied() {
        sv.fill(l..r, t);
    }
    let mut res = vec![0; 128];
    for i in 0..n {
        eprint!("{}", ['.', 'Y', 'C', 'K'][sv[i]]);
        res[sv[i]] += 1;
    }
    eprintln!();
    for i in 1..=3 {
        output!("{} ", res[i]);
    }
    outputln!();
}

use std::slice::SliceIndex;
const SIZE: usize = 512;
#[derive(Clone)]
enum Block<T> {
    Covered(T),
    Data([T; SIZE]),
}
impl<T: Copy> Block<T> {
    fn expand(&mut self) {
        if let Self::Covered(v) = self {
            *self = Self::Data([*v; SIZE]);
        }
    }
    fn fill<I: SliceIndex<[T], Output = [T]>>(&mut self, range: I, v: T) {
        self.expand();
        if let Self::Data(a) = self {
            for x in &mut a[range] {
                *x = v;
            }
        }
    }
}
struct SqrtVec<T> {
    blocks: Vec<Block<T>>,
    len: usize,
}
impl<T: Copy> SqrtVec<T> {
    pub fn new() -> Self {
        Self {
            blocks: Vec::new(),
            len: 0,
        }
    }
    pub fn resize(&mut self, n: usize, v: T) {
        self.blocks.resize((n + SIZE - 1) / SIZE, Block::Covered(v));
        self.len = n;
    }
    pub fn fill(&mut self, range: std::ops::Range<usize>, v: T) {
        let ldiv = range.start / SIZE;
        let lrem = range.start % SIZE;
        let rdiv = range.end / SIZE;
        let rrem = range.end % SIZE;
        if ldiv == rdiv {
            self.blocks[ldiv].fill(lrem..rrem, v);
        } else {
            self.blocks[ldiv].fill(lrem.., v);
            for b in &mut self.blocks[ldiv + 1..rdiv] {
                *b = Block::Covered(v);
            }
            self.blocks.get_mut(rdiv).map(|b| b.fill(..rrem, v));
        }
    }
    pub fn get(&self, i: usize) -> Option<&T> {
        if i < self.len {
            self.blocks.get(i / SIZE).map(|b| match b {
                Block::Covered(v) => v,
                Block::Data(a) => &a[i % SIZE],
            })
        } else {
            None
        }
    }
}
impl<T: Copy> std::ops::Index<usize> for SqrtVec<T> {
    type Output = T;
    fn index(&self, i: usize) -> &T {
        self.get(i).unwrap()
    }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]

    pub use std::io::prelude::*;

    pub struct Input<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> Input<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.buf.clear();
                    let len = self.src.read_line(&mut self.buf).expect("io error");
                    self.pos = 0;
                    if len == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end - range.start > 0 {
                    return &self.buf[range];
                }
            }
        }
        pub fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        pub fn input<T: InputParse>(&mut self) -> T {
            self.input_fallible().expect("input error")
        }
        pub fn input_fallible<T: InputParse>(&mut self) -> Result<T> {
            T::input(self)
        }
        pub fn iter<T: InputParse>(&mut self) -> Iter<T, R> {
            Iter {
                input: self,
                _t: std::marker::PhantomData,
            }
        }
        pub fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct Iter<'a, T, R> {
        input: &'a mut Input<R>,
        _t: std::marker::PhantomData<T>,
    }
    impl<'a, T: InputParse, R: BufRead> Iterator for Iter<'a, T, R> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.input.input())
        }
    }
    type Result<T> = std::result::Result<T, Box<dyn std::error::Error + 'static>>;
    pub trait InputParse: Sized {
        fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self>;
    }
    macro_rules! input_from_str_impls {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    input.str().parse::<$T>().map_err(|e| e.into())
                }
            })*
        };
    }
    input_from_str_impls! {
        String char bool f32 f64
        isize i8 i16 i32 i64 i128
        usize u8 u16 u32 u64 u128
    }
    macro_rules! input_tuple_impls {
        { $(($($T:ident),+))* } => {
            $(impl<$($T: InputParse),+> InputParse for ($($T),+) {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    Ok(($($T::input(input)?),+))
                }
            })*
        };
    }
    input_tuple_impls! {
        (A, B)
        (A, B, C)
        (A, B, C, D)
        (A, B, C, D, E)
        (A, B, C, D, E, F)
        (A, B, C, D, E, F, G)
    }
    /*
    macro_rules! input_array_impls {
       { $($N:expr)* } => {
            $(impl<T: InputParse> InputParse for [T; $N] {
                fn input<R: BufRead>(input: &mut Input<R>) -> Result<Self> {
                    use std::{ mem::MaybeUninit, ptr };
                    let mut a = MaybeUninit::<[T; $N]>::uninit();
                    unsafe {
                        for i in 0..$N {
                            match T::input(input) {
                                Ok(v) => ptr::write(&mut (*a.as_mut_ptr())[i], v),
                                Err(e) => {
                                    ptr::drop_in_place(&mut (*a.as_mut_ptr())[..i]);
                                    return Err(e);
                                }
                            }
                        }
                        Ok(a.assume_init())
                    }
                }
            })*
        };
    }
    input_array_impls! {
        1 2 3 4 5 6 7 8
    }
    */
}
0