#1039156 (C++17) No.3018 目隠し宝探し

• 問題: No.3018 目隠し宝探し
• ユーザー: shobonvip
• 提出日時: 2025-01-26 00:09:38
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,963 bytes
• コンパイル時間: 4,189 ms
• コンパイル使用メモリ: 249,428 KB
• 実行使用メモリ: 25,856 KB
• 平均クエリ数: 3.41
• 最終ジャッジ日時: 2025-01-26 00:09:55
• 合計ジャッジ時間: 6,966 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	WA * 1
other	AC * 6 WA * 15

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/**
    author:  shobonvip
    created: 2025.01.25 23:56:56
**/
#include<bits/stdc++.h>
using namespace std;
//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/
/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/
typedef long long ll;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()
template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T> T max(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
    return ret;
}
template <typename T> T min(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
    return ret;
}
template <typename T> T sum(vector<T> &a){
    T ret = 0;
    for (int i=0; i<(int)a.size(); i++) ret += a[i];
    return ret;
}
// [floor_sqrt(N)]
// 0 <= N <= 9e18
long long floor_sqrt(long long N) {
    long long ub = 3'000'000'001;
    long long lb = 0;
    while (ub - lb > 1) {
        long long t = (ub + lb) / 2;
        if (t * t <= N) lb = t;
        else ub = t;
    }
    return lb;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int h, w; cin >> h >> w;
    if (h == 1 && w == 1) {
        cout << "! 1 1" << endl;
        return 0;
    }
    if (h == 1 || w == 1) {
        cout << "? 1 1" << endl;
        ll a; cin >> a;
        ll r = floor_sqrt(a);
        ll x = 1, y = 1;
        if (h == 1) y += r;
        else x += r;
        cout << "! " << x << ' ' << y << endl;
        return 0;
    }
    cout << "? 1 1" << endl;
    ll a; cin >> a;
    cout << "? 1 2" << endl;
    ll b; cin >> b;
    cout << "? 2 1" << endl;
    ll c; cin >> c;
    
    ll p = (+1+(a-b)) / 2;
    ll q = (+1+(a-c)) / 2;
    cout << "! " << 1 + q << " " << 1 + p << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX