CodeChef_QHOUSE.cpp

// Author : md_nihal

#include "bits/stdc++.h"
using namespace std;

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#define Md_Nihal ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

typedef unsigned long long ull;
#define int long long
#define i_64 int64_t
#define sz(a) (int)a.size()
#define vi vector<int>
#define pii pair<int,int>
#define vpi vector<pii>
#define all(x) x.begin(),x.end()
#define ALL(x) x.rbegin(),x.rend()
#define rep(x,n) for (int i = x; i <x+n; i++)
const int mod = 1e9 + 7, inf = LONG_LONG_MAX, N = 1e6 + 7, MAX = 1e14 + 4;

template<class T, class V>istream& operator>>(istream &in, pair<T, V> &a) {in >> a.first >> a.second; return in;}
template<class T>istream& operator>>(istream &in, vector<T> &a) {for (auto &i : a) {in >> i;} return in;}
template<class T, class V>ostream& operator<<(ostream &os, pair<T, V> &a) {os << a.first << " " << a.second; return os;}
template<class T>ostream& operator<<(ostream &os, vector<T> &a) {for (auto &i : a) {os << i << " ";} return os;}

/*----------------------------------------------- PBDS --------------------------------------------*/

using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
template<class key, class value, class cmp = less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;

/*----------------------------------------------- PBDS ends --------------------------------------------*/

#ifndef ONLINE_JUDGE
#include "/home/anonymous/Templates/debug.hpp"
#else
#define debug(x...);
#endif

/*=========================================== SOLUTION ===========================================*/

int query(char cordinate,int val){
    int low=0,high=1000,res=0;
    while(low<=high){
        int mid=low+(high-low)/2;

        if(cordinate=='x'){
            cout<<"? "<<mid<<" "<<val<<endl;
        }else cout<<"? "<<val<<" "<<mid<<endl;

        string resp; cin>>resp;
        if(resp=="YES"){
            res=mid;
            low=mid+1;
        }else high=mid-1;

    }
    return res;
}

void __solve() {

    int square=0,triangle=0,tri_top=0;

    square=2*query('x',0); //leftmost point for square
    triangle=2*query('x',square); //leftmost point for triangle
    tri_top=query('y',0)-square; // topmost point for traingle
    int ans=square*1ll*square + triangle*tri_top/2; //area
    cout<<"! "<<ans;
}



/*============================================= MAIN =============================================*/

int32_t  main()
{
    Md_Nihal;
    int testcases = 1;    //cin >> testcases;
    for (int i = 0; i < testcases; i++,__solve(),cout << endl);
}