#263123 (Rust) No.246 質問と回答

• 問題: No.246 質問と回答
• ユーザー: くれちー
• 提出日時: 2018-06-06 20:51:48
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 45 ms / 2,000 ms
• コード長: 6,562 bytes
• コンパイル時間: 1,874 ms
• コンパイル使用メモリ: 145,944 KB
• 実行使用メモリ: 24,276 KB
• 平均クエリ数: 30.87
• 最終ジャッジ日時: 2023-09-23 20:27:20
• 合計ジャッジ時間: 5,150 ms
• ジャッジサーバーID （参考情報）: judge15 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	45 ms; 23,688 KB
testcase_01	AC	39 ms; 23,412 KB
testcase_02	AC	40 ms; 24,072 KB
testcase_03	AC	39 ms; 23,628 KB
testcase_04	AC	40 ms; 23,352 KB
testcase_05	AC	40 ms; 23,904 KB
testcase_06	AC	39 ms; 24,072 KB
testcase_07	AC	39 ms; 23,652 KB
testcase_08	AC	39 ms; 23,820 KB
testcase_09	AC	39 ms; 23,892 KB
testcase_10	AC	40 ms; 23,640 KB
testcase_11	AC	40 ms; 23,700 KB
testcase_12	AC	40 ms; 23,808 KB
testcase_13	AC	40 ms; 23,712 KB
testcase_14	AC	39 ms; 23,688 KB
testcase_15	AC	39 ms; 24,264 KB
testcase_16	AC	39 ms; 24,036 KB
testcase_17	AC	40 ms; 23,688 KB
testcase_18	AC	39 ms; 24,252 KB
testcase_19	AC	40 ms; 23,604 KB
testcase_20	AC	40 ms; 23,628 KB
testcase_21	AC	42 ms; 23,580 KB
testcase_22	AC	41 ms; 24,036 KB
testcase_23	AC	40 ms; 23,472 KB
testcase_24	AC	38 ms; 24,276 KB
testcase_25	AC	38 ms; 23,592 KB
testcase_26	AC	39 ms; 23,724 KB
testcase_27	AC	38 ms; 23,472 KB
testcase_28	AC	38 ms; 23,700 KB
testcase_29	AC	37 ms; 23,436 KB

ソースコード

fn solve<R: BufRead, W: Write>(_reader: R, _writer: &mut W) {
  let mut _scanner = Scanner::new(_reader);

  #[allow(unused_macros)]
  macro_rules! scan {
    ($t:ty) => {
      _scanner.next::<$t>().unwrap()
    };
    ($($t:ty),+) => {
      ($(scan!($t)),+)
    };
    ($t:ty; $n:expr) => {
      scan_iter!($t; $n).collect::<Vec<_>>()
    };
    ($t_0:ty, $t_1:ty; $n:expr) => {
      scan!($t_0 = 0, $t_1 = 1; $n)
    };
    ($t_0:ty, $t_1:ty, $t_2:ty; $n:expr) => {
      scan!($t_0 = 0, $t_1 = 1, $t_2 = 2; $n)
    };
    ($($t:ty = $i:tt),+; $n:expr) => {{
      let mut vecs = ($(Vec::<$t>::with_capacity($n)),+);
      for _ in 0..$n {$(
        vecs.$i.push(scan!($t));
      )+}
      vecs
    }};
  }

  #[allow(unused_macros)]
  macro_rules! scan_iter {
    ($t:ty; $n:expr) => {
      _scanner.take::<$t>($n).map(|x| x.unwrap())
    };
  }

  #[allow(unused_macros)]
  macro_rules! print {
    ($fmt:expr) => {
      write!(_writer, $fmt).unwrap()
    };
    ($fmt:expr, $($arg:tt)*) => {
      write!(_writer, $fmt, $($arg)*).unwrap()
    };
  }

  #[allow(unused_macros)]
  macro_rules! println {
    () => {
      writeln!(_writer).unwrap()
    };
    ($fmt:expr) => {
      writeln!(_writer, $fmt).unwrap()
    };
    ($fmt:expr, $($arg:tt)*) => {
      writeln!(_writer, $fmt, $($arg)*).unwrap()
    };
  }

  use search::BinarySearch;

  let range = 1..1_000_000_001;
  let ans = range
    .binary_search(|y| {
      println!("? {}", y);
      _writer.flush().unwrap();
      scan!(u8) == b'0'
    })
    .unwrap_or(range.end) - 1;

  println!("! {}", ans);
}

fn main() {
  let stdin = stdin();
  let stdout = stdout();
  #[cfg(debug_assertions)]
  let mut writer = stdout.lock();
  #[cfg(not(debug_assertions))]
  let mut writer = ::std::io::BufWriter::new(stdout.lock());
  solve(stdin.lock(), &mut writer);
  writer.flush().unwrap();
}

use io::Scanner;
use std::io::{stdin, stdout, BufRead, Write};

pub mod io {
  pub use self::scanner::*;

  mod scanner {
    use std::io::BufRead;
    use std::marker::PhantomData;
    use std::str::{from_utf8, FromStr};

    pub struct Scanner<R> {
      reader: R,
      buffer: Vec<u8>,
      position: usize,
    }

    impl<R: BufRead> Scanner<R> {
      pub fn new(reader: R) -> Self {
        Scanner { reader: reader, buffer: vec![], position: 0 }
      }

      pub fn next<T: Parse>(&mut self) -> Option<T> {
        Parse::parse(self.next_bytes().unwrap_or(&[]))
      }

      pub fn take<T: Parse>(&mut self, n: usize) -> Take<R, T> {
        Take { scanner: self, n: n, _marker: PhantomData }
      }

      pub fn next_bytes(&mut self) -> Option<&[u8]> {
        if self.buffer.is_empty() {
          self.read_line();
        }
        loop {
          match self.buffer.get(self.position) {
            Some(&b' ') => self.position += 1,
            Some(&b'\n') => self.read_line(),
            Some(_) => break,
            None => return None,
          }
        }
        let start = self.position;
        loop {
          match self.buffer.get(self.position) {
            Some(&b' ') | Some(&b'\n') | None => break,
            Some(_) => self.position += 1,
          }
        }
        Some(&self.buffer[start..self.position])
      }

      fn read_line(&mut self) {
        self.position = 0;
        self.buffer.clear();
        self.reader.read_until(b'\n', &mut self.buffer).unwrap();
      }
    }

    pub struct Take<'a, R: 'a, T> {
      scanner: &'a mut Scanner<R>,
      n: usize,
      _marker: PhantomData<fn() -> T>,
    }

    impl<'a, R: BufRead, T: Parse> Iterator for Take<'a, R, T> {
      type Item = Option<T>;

      fn next(&mut self) -> Option<Self::Item> {
        if self.n > 0 {
          self.n -= 1;
          Some(self.scanner.next())
        } else {
          None
        }
      }

      fn size_hint(&self) -> (usize, Option<usize>) {
        (self.n, Some(self.n))
      }
    }

    impl<'a, R: BufRead, T: Parse> ExactSizeIterator for Take<'a, R, T> {}

    pub trait Parse: Sized {
      fn parse(bytes: &[u8]) -> Option<Self>;
    }

    impl Parse for u8 {
      fn parse(bytes: &[u8]) -> Option<Self> {
        if bytes.len() == 1 {
          Some(*unsafe { bytes.get_unchecked(0) })
        } else {
          None
        }
      }
    }

    macro_rules! parse_impl {
      ($($t:ident)+) => {$(
        impl Parse for $t {
          fn parse(bytes: &[u8]) -> Option<Self> {
            from_utf8(bytes).ok().and_then(|s| $t::from_str(s).ok())
          }
        }
      )+};
    }

    parse_impl! { i32 i64 isize u32 u64 usize String }
  }
}

pub mod search {
  pub use self::binary_search::*;

  mod binary_search {
    use std::ops::Range;

    pub trait BinarySearch<T> {
      type Output;

      fn binary_search<F: FnMut(&T) -> bool>(&self, f: F) -> Option<Self::Output>;

      fn lower_bound(&self, x: &T) -> Option<Self::Output>
      where
        T: Ord,
      {
        self.binary_search(|t| t >= x)
      }

      fn upper_bound(&self, x: &T) -> Option<Self::Output>
      where
        T: Ord,
      {
        self.binary_search(|t| t > x)
      }
    }

    macro_rules! binary_search_impl {
      ($ok:expr, $ng:expr, $cond1:expr, $cond2:expr) => {{
        let mut ok_end = $ok;
        let mut ng_start = $ng;
        while ok_end - ng_start > 1 {
          let mid = ng_start + (ok_end - ng_start) / 2;
          if $cond1(mid) {
            ok_end = mid;
          } else {
            ng_start = mid;
          }
        }
        if $cond2(ok_end) {
          None
        } else {
          Some(ok_end as Self::Output)
        }
      }};
    }

    impl<T> BinarySearch<T> for [T] {
      type Output = usize;

      fn binary_search<F: FnMut(&T) -> bool>(&self, mut f: F) -> Option<Self::Output> {
        binary_search_impl!(self.len() as isize, -1isize, |mid| f(&self[mid as usize]), |ok_end| ok_end as usize == self.len())
      }
    }

    macro_rules! binary_search_impl_range {
      ($t:ty, $it:ty) => {
        impl BinarySearch<$t> for Range<$t> {
          type Output = $t;

          fn binary_search<F: FnMut(&$t) -> bool>(&self, mut f: F) -> Option<$t> {
            assert!(self.start <= self.end);
            binary_search_impl!(self.end as $it, self.start as $it - 1, |mid| f(&(mid as $t)), |ok_end| ok_end == self.end as $it)
          }
        }
      };
      ($($ut:ty, $it:ty);+) => {$(
        binary_search_impl_range! { $ut, $it }
        binary_search_impl_range! { $it, $it }
      )+};
    }

    binary_search_impl_range! { usize, isize; u32, i32; u64, i64 }
  }
}