結果
| 問題 |
No.594 壊れた宝物発見機
|
| コンテスト | |
| ユーザー |
aimy
|
| 提出日時 | 2017-11-12 16:49:04 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 110 ms / 2,000 ms |
| コード長 | 3,068 bytes |
| コンパイル時間 | 12,674 ms |
| コンパイル使用メモリ | 394,352 KB |
| 実行使用メモリ | 25,232 KB |
| 平均クエリ数 | 65.70 |
| 最終ジャッジ日時 | 2024-07-16 14:49:40 |
| 合計ジャッジ時間 | 15,941 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 |
コンパイルメッセージ
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:58:9
|
58 | buf.trim_right().parse::<T>().ok().unwrap()
| ^^^^^^^^^^
|
= note: `#[warn(deprecated)]` on by default
help: replace the use of the deprecated method
|
58 | 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:73:22
|
73 | let mut it = buf.trim_right().split_whitespace();
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
73 | 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:91:22
|
91 | let mut it = buf.trim_right().split_whitespace();
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
91 | 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:110:9
|
110 | buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
110 | 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:125:9
|
125 | buf.trim_right().chars().collect()
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
125 | buf.trim_end().chars().collect()
| ~~~~~~~~
ソースコード
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::*;
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 d1.cmp(&d2) {
Less => {hi = k2},
Greater => {lo = k1},
Equal => {lo = k1; hi = k2}
}
}
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()
}
}
aimy