結果

問題 No.1021 Children in Classrooms
ユーザー cotton_fn_
提出日時 2020-04-11 23:31:59
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 17 ms / 2,000 ms
コード長 4,497 bytes
コンパイル時間 26,750 ms
コンパイル使用メモリ 400,224 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-19 16:49:44
合計ジャッジ時間 14,818 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

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(10 * 1024 * 1024)
.spawn(solve)?
.join()
.unwrap();
Ok(())
}
fn solve() {
let stdin = io::stdin();
let mut kin = KInput::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 mut a: VecDeque<u32> = kin.seq(n);
let s = kin.bytes();
for b in s {
match *b {
b'L' => {
*a.front_mut().unwrap() += a.pop_front().unwrap();
a.push_back(0);
}
b'R' => {
*a.back_mut().unwrap() += a.pop_back().unwrap();
a.push_front(0);
}
_ => {}
}
}
for x in a {
output!("{} ", x);
}
outputln!();
}
// -----------------------------------------------------------------------------
pub mod kyoproio {
#![warn(unused)]
use std::io::prelude::*;
pub trait Input {
fn str(&mut self) -> &str;
fn bytes(&mut self) -> &[u8] {
self.str().as_ref()
}
fn input<T: InputParse>(&mut self) -> T {
T::input(self).expect("input error")
}
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: String,
pos: usize,
}
impl<R: BufRead> KInput<R> {
pub fn new(src: R) -> Self {
Self {
src,
buf: String::with_capacity(1024),
pos: 0,
}
}
}
impl<R: BufRead> Input for KInput<R> {
fn str(&mut self) -> &str {
loop {
if self.pos >= self.buf.len() {
self.pos = 0;
self.buf.clear();
if self.src.read_line(&mut self.buf).expect("io error") == 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 {
return &self.buf[range];
}
}
}
}
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<Self::Item> {
Some(self.0.input())
}
}
pub trait InputParse: Sized {
type Err: std::fmt::Debug;
fn input<I: Input + ?Sized>(input: &mut I) -> Result<Self, Self::Err>;
}
macro_rules! from_str_impls {
{ $($T:ty)* } => {
$(impl InputParse for $T {
type Err = <$T as std::str::FromStr>::Err;
fn input<I: Input + ?Sized>(input: &mut I) -> Result<Self, Self::Err> {
input.str().parse::<$T>()
}
})*
};
}
from_str_impls! {
String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
}
macro_rules! tuple_impls {
($H:ident $($T:ident)*) => {
impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
type Err = std::convert::Infallible;
fn input<I: Input + ?Sized>(input: &mut I) -> Result<Self, Self::Err> {
// ?
Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*))
}
}
tuple_impls!($($T)*);
};
() => {};
}
tuple_impls!(A B C D E F G);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0