#[allow(unused_imports)] use std::cmp::{max, min, Ordering}; #[allow(unused_imports)] use std::collections::{HashMap, HashSet, BinaryHeap}; #[allow(unused_imports)] use std::iter::FromIterator; #[allow(unused_imports)] use std::io::stdin; mod util { use std::io::stdin; use std::str::FromStr; use std::fmt::Debug; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn gets() -> Vec where ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } } #[allow(unused_macros)] macro_rules! get { ($t:ty) => { { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().parse::<$t>().unwrap() } }; ($($t:ty),*) => { { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( $(iter.next().unwrap().parse::<$t>().unwrap(),)* ) } }; ($t:ty; $n:expr) => { (0..$n).map(|_| get!($t) ).collect::>() }; ($($t:ty),*; $n:expr) => { (0..$n).map(|_| get!($($t),*) ).collect::>() }; ($t:ty ;;) => { { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse::<$t>().unwrap()) .collect::>() } }; } #[allow(unused_macros)] macro_rules! debug { ($($a:expr),*) => { println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*); } } fn ask(x: i64, y: i64, z: i64) -> usize { println!("? {} {} {}", x, y, z); get!(usize) } fn bask(axis: usize, v: i64) -> usize { match axis { 0 => ask(v, 0, 0), 1 => ask(0, v, 0), 2 => ask(0, 0, v), _ => 0, } } fn tri_search(axis: usize, low: i64, high: i64, cache: &mut HashMap) -> i64 { if low == high { return low; } let t1 = low + max((high - low) / 3, 1); let t2 = high - max((high - low) / 3, 1); let l = match cache.get(&t1).cloned() { Some(x) => x, _ => bask(axis, t1), }; let r = match cache.get(&t2).cloned() { Some(x) => x, _ => bask(axis, t2), }; cache.insert(t1, l); cache.insert(t2, r); match l.cmp(&r) { Ordering::Less => tri_search(axis, low, t2, cache), Ordering::Equal => tri_search(axis, t1, t2, cache), Ordering::Greater => tri_search(axis, t1, high, cache), } } fn main() { let x = tri_search(0, -150, 150, &mut HashMap::new()); let y = tri_search(1, -150, 150, &mut HashMap::new()); let z = tri_search(2, -150, 150, &mut HashMap::new()); println!("! {} {} {}", x, y, z); }