結果

問題 No.594 壊れた宝物発見機
コンテスト
ユーザー aimy
提出日時 2017-11-12 16:24:14
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 3,318 bytes
コンパイル時間 12,640 ms
コンパイル使用メモリ 392,456 KB
実行使用メモリ 25,604 KB
平均クエリ数 83.50
最終ジャッジ日時 2024-07-16 14:49:23
合計ジャッジ時間 16,719 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 2 WA * 18
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
  --> src/main.rs:61:9
   |
61 |     buf.trim_right().parse::<T>().ok().unwrap()
   |         ^^^^^^^^^^
   |
   = note: `#[warn(deprecated)]` on by default
help: replace the use of the deprecated method
   |
61 |     buf.trim_end().parse::<T>().ok().unwrap()
   |         ~~~~~~~~

warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
  --> src/main.rs:76:22
   |
76 |     let mut it = buf.trim_right().split_whitespace();
   |                      ^^^^^^^^^^
   |
help: replace the use of the deprecated method
   |
76 |     let mut it = buf.trim_end().split_whitespace();
   |                      ~~~~~~~~

warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
  --> src/main.rs:94:22
   |
94 |     let mut it = buf.trim_right().split_whitespace();
   |                      ^^^^^^^^^^
   |
help: replace the use of the deprecated method
   |
94 |     let mut it = buf.trim_end().split_whitespace();
   |                      ~~~~~~~~

warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
   --> src/main.rs:113:9
    |
113 |     buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
    |         ^^^^^^^^^^
    |
help: replace the use of the deprecated method
    |
113 |     buf.trim_end().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
    |         ~~~~~~~~

warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
   --> src/main.rs:128:9
    |
128 |     buf.trim_right().chars().collect()
    |         ^^^^^^^^^^
    |
help: replace the use of the deprecated method
    |
128 |     buf.trim_end().chars().collect()
    |         ~~~~~~~~

ソースコード

diff # 

fn main() {
  let x = trisearch(0, -100, 100);
  let y = trisearch(1, -100, 100);
  let z = trisearch(2, -100, 100);

  println!("! {} {} {}", x, y, z);
}

fn trisearch(i: usize, mut lo: i32, mut hi: i32) -> i32 {
  use std::cmp::Ordering::*;
  let mut dl = query(i, lo);
  let mut dr = query(i, hi);

  while hi - lo > 2 {
    let k1 = lo + (hi - lo) / 3;
    let k2 = hi - (hi - lo) / 3;
    let d1 = query(i, k1);
    let d2 = query(i, k2);
    match (dl.cmp(&d1), d1.cmp(&d2), d2.cmp(&dr)) {
      (Less, Less, Less)       => {hi = k1; dr = query(i, hi)},
      (Greater, Less, Less)    => {hi = k2; dr = query(i, hi)},
      (Greater, Greater, Less) => {lo = k1; dl = query(i, lo)},
      _                        => {lo = k2; dl = query(i, lo)} 
    }
  }

  let d1 = query(i, lo);
  let d2 = query(i, (lo+hi)/2);
  let d3 = query(i, hi);

  match [d1,d2,d3].iter().min().unwrap() {
    &d if d == d1 => lo,
    &d if d == d3 => hi,
    _             => (lo + hi) / 2
  }
}

fn getd(x: i32, y: i32, z: i32) -> i32 {
  println!("? {} {} {}", x, y, z);
  get::val::<i32>()
}

fn query(i: usize, k: i32) -> i32 {
  match i {
    0 => getd(k, 0, 0),
    1 => getd(0, k, 0),
    2 => getd(0, 0, k),
    _ => unreachable!()
  }
}

#[allow(dead_code)]
mod get {
  use std::io::*;
  use std::str::*;

  pub fn val<T: FromStr>() -> T {
    let mut buf = String::new();
    let s = stdin();
    s.lock().read_line(&mut buf).ok();
    buf.trim_right().parse::<T>().ok().unwrap()
  }

  pub fn vals<T: FromStr>(n: usize) -> Vec<T> {
    let mut vec: Vec<T> = vec![];
    for _ in 0 .. n {
      vec.push(val());
    }
    vec
  }

  pub fn tuple<T1: FromStr, T2: FromStr>() -> (T1, T2) {
    let mut buf = String::new();
    let s = stdin();
    s.lock().read_line(&mut buf).ok();
    let mut it = buf.trim_right().split_whitespace();
    let x = it.next().unwrap().parse::<T1>().ok().unwrap();
    let y = it.next().unwrap().parse::<T2>().ok().unwrap();
    (x, y)
  }

  pub fn tuples<T1: FromStr, T2: FromStr>(n: usize) -> Vec<(T1, T2)> {
    let mut vec: Vec<(T1, T2)> = vec![];
    for _ in 0 .. n {
      vec.push(tuple());
    }
    vec
  }

  pub fn tuple3<T1: FromStr, T2: FromStr, T3: FromStr>() -> (T1, T2, T3) {
    let mut buf = String::new();
    let s = stdin();
    s.lock().read_line(&mut buf).ok();
    let mut it = buf.trim_right().split_whitespace();
    let x = it.next().unwrap().parse::<T1>().ok().unwrap();
    let y = it.next().unwrap().parse::<T2>().ok().unwrap();
    let z = it.next().unwrap().parse::<T3>().ok().unwrap();
    (x, y, z)
  }

  pub fn tuple3s<T1: FromStr, T2: FromStr, T3: FromStr>(n: usize) -> Vec<(T1, T2, T3)> {
    let mut vec: Vec<(T1, T2, T3)> = vec![];
    for _ in 0 .. n {
      vec.push(tuple3());
    }
    vec
  }

  pub fn list<T: FromStr>() -> Vec<T> {
    let mut buf = String::new();
    let s = stdin();
    s.lock().read_line(&mut buf).ok();
    buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
  }

  pub fn lists<T: FromStr>(h: usize) -> Vec<Vec<T>> {
    let mut mat: Vec<Vec<T>> = vec![];
    for _ in 0 .. h {
      mat.push(list());
    }
    mat
  }

  pub fn chars() -> Vec<char> {
    let mut buf = String::new();
    let s = stdin();
    s.lock().read_line(&mut buf).ok();
    buf.trim_right().chars().collect()
  }
}
0