結果
問題 | No.804 野菜が苦手 |
ユーザー |
![]() |
提出日時 | 2020-04-06 21:51:45 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 4,261 bytes |
コンパイル時間 | 11,880 ms |
コンパイル使用メモリ | 396,612 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-07 02:31:32 |
合計ジャッジ時間 | 12,828 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#![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 (a, b, c, d): (u32, u32, u32, u32) = kin.input();let ans = a.min(d / (c + 1)).min(b / c);outputln!("{}", ans);}// -----------------------------------------------------------------------------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);}