結果

問題 No.49 算数の宿題
ユーザー cotton_fn_
提出日時 2020-04-07 17:36:47
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 4,856 bytes
コンパイル時間 20,062 ms
コンパイル使用メモリ 379,496 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-23 02:08:59
合計ジャッジ時間 16,886 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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 mut s = kin.bytes().to_owned();
s.push(b'$');
let mut ns = Vec::new();
let mut os = Vec::new();
let mut v = 0;
for b in s {
if matches!(b, b'+' | b'*' | b'$') {
if let Some(o) = os.pop() {
let x = ns.pop().unwrap();
ns.push(match o {
b'+' => v * x,
b'*' => v + x,
_ => panic!()
});
} else {
ns.push(v);
}
v = 0;
os.push(b);
} else {
v = 10 * v + (b - b'0') as i32;
}
}
assert_eq!(ns.len(), 1);
assert_eq!(os.len(), 1); // $
outputln!("{}", ns.pop().unwrap());
}
// -----------------------------------------------------------------------------
pub mod kyoproio {
#![warn(unused)]
use std::io::prelude::*;
pub trait Input: Sized {
fn str(&mut self) -> &str;
fn bytes(&mut self) -> &[u8] {
self.str().as_ref()
}
fn input<T: InputParse>(&mut self) -> T {
self.input_fallible().expect("input error")
}
fn input_fallible<T: InputParse>(&mut self) -> Result<T, T::Err> {
T::input(self)
}
fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
Iter {
input: self,
_t: 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> {
input: &'a mut I,
_t: std::marker::PhantomData<*const T>,
}
impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> {
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
Some(self.input.input())
}
}
pub trait InputParse: Sized {
type Err: std::fmt::Debug;
fn input<I: Input>(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>(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 = ();
fn input<I: Input>(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