結果

問題 No.3018 目隠し宝探し
ユーザー igeee
提出日時 2025-01-25 14:51:36
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 6,604 bytes
コンパイル時間 5,918 ms
コンパイル使用メモリ 332,508 KB
実行使用メモリ 25,844 KB
平均クエリ数 2.77
最終ジャッジ日時 2025-01-25 23:31:16
合計ジャッジ時間 8,547 ms
ジャッジサーバーID
(参考情報)
judge7 / judge11
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 20 RE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<ll>> vvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!
    =std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}"
    ;return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;}
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
ll ask(ll h,ll w){
cout << "? " << h << " " << w << endl;
LL(ret);
return ret;
}
int main(){
ios::sync_with_stdio(false);cin.tie(nullptr);
LL(h,w);
auto clc = [&](ll h1,ll h2,ll w1,ll w2){
return abs(h1-h2)*abs(h1-h2)+abs(w1-w2)*abs(w1-w2);
};
if(w == 1 or h == 1){
ll s = ask(1,1);
repsn(i,1,h)repsn(j,1,w){
if(clc(i,1,j,1) == s ){
cout<< "! " << i << " " << j << endl;
return 0;
}
}
}
ll s = ask(1,1);
ll g = ask(1,w);
set<pll> se;
repsn(i,1,h)repsn(j,1,w){
if(clc(i,1,j,1) == s && clc(i,1,j,w) == g){
se.insert({i,j});
}
}
assert(sz(se) > 0);
cout << "! " << se.begin()->first << " " << se.begin()->second << endl;
return 0;
// if(sz(se) == 1){
// }
ll t = ask(h,w);
for(auto & [i,j]:se){
if(clc(i,h,j,w) == t){
cout << "! " << i << " " << j << endl;
return true;
}
}
// //3
// ll ah = -1;
// map<ll,ll> mp;
// ll l = 1;//
// ll r = h;//
// auto f = [&](ll m1,ll m2)->bool{
// //m1
// if(!mp.count(m1)){
// mp[m1] = ask(m1,w);
// }
// if(!mp.count(m2)){
// mp[m2] = ask(m2,w);
// }
// return mp[m1] < mp[m2];
// };
// //l,l+1,r
// while(abs(l-r) >2){
// ll m1 = l + (r-l)/3;
// ll m2 = r - (r-l)/3;
// if(f(m1,m2)){
// //m1
// r = m2;
// }else{
// l = m1;
// }
// }
// ll cost =INF;
// if(!mp.count(l)){
// mp[l] = ask(l,w);
// }
// if(chmin(cost,mp[l]))ah = l;
// if(!mp.count(r)){
// mp[r] = ask(r,w);
// }
// if(chmin(cost,mp[r]))ah = r;
// if(!mp.count(l+1)){
// mp[l+1] = ask(l+1,w);
// }
// if(chmin(cost,mp[l+1]))ah = l+1;
// ll tmp = sqrt(cost);
// cout << "! " << ah << " " << w-tmp << endl;
// map<ll,ll> mp;
// //3
// ll l = 1;//
// ll r = w;//
// auto f = [&](ll m1,ll m2)->bool{
// //m1
// if(!mp.count(m1)){
// mp[m1] = ask(ah,m1);
// }
// if(!mp.count(m2)){
// mp[m2] = ask(ah,m2);
// }
// return mp[m1] < mp[m2];
// };
// //l,l+1,r
// while(abs(l-r) >2){
// ll m1 = l + (r-l)/3;
// ll m2 = r - (r-l)/3;
// if(f(m1,m2)){
// //m1
// r = m2;
// }else{
// l = m1;
// }
// }
// ll aw = -1;
// if(!mp.count(l)){
// mp[l] = ask(ah,l);
// }
// if(mp[l] == 0)aw = l;
// if(!mp.count(r)){
// mp[r] = ask(ah,r);
// }
// if(mp[r] == 0)aw = r;
// if(aw == -1)aw = l+1;
// if(!mp.count(l+1)){
// mp[l+1] = ask(ah,l+1);
// }
// if(mp[l+1] == 0)aw = l+1;
// cout << "! " << ah << " " << aw << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0