#1026994 (C++17) No.2962 Sum Bomb Bomber

• 問題: No.2962 Sum Bomb Bomber
• ユーザー: soto800
• 提出日時: 2024-11-16 15:59:03
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: TLE
• 実行時間: -
• コード長: 4,145 bytes
• コンパイル時間: 2,025 ms
• コンパイル使用メモリ: 193,664 KB
• 最終ジャッジ日時: 2025-02-25 04:29:29
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	TLE * 1
other	-- * 64

ソースコード

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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x)                                                                \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y)                                                             \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z)                                                          \
  if (DEBUG)                                                                   \
    cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
         << TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z)                                                       \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z        \
         << endl;
#define LOG5(w, x, y, z, a)                                                    \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b)                                                 \
  if (DEBUG)                                                                   \
    cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
         << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
         << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b        \
         << endl;
#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...)                                                               \
  overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
mt19937 engine;
std::chrono::system_clock::time_point start, endTime;
#define DEBUG 0
lli query(lli x, lli y) {
  cout << "1 " << x << " " << y << endl;
  lli ans;
  cin >> ans;
  return ans;
}
void solve() {
  //  write your code here
  lli N;
  cin >> N;
  const int BIG = 1e9;
  // x方向に対して3分探索する
  lli smallX = -1e9;
  lli largeX = 1e9;
  while (smallX + 1 < largeX) {
    lli smallMid = (smallX * 2 + largeX) / 3;
    lli largeMid = (smallX + largeX * 2) / 3;
    lli smallMidQuery = query(smallMid, BIG);
    lli largeMidQuery = query(largeMid, BIG);
    if (smallMidQuery < largeMidQuery) {
      largeX = largeMid;
    } else {
      smallX = smallMid;
    }
  }
  lli x = (smallX + largeX) / 2;
  // y方向に対して3分探索する
  lli smallY = -1e9;
  lli largeY = 1e9;
  while (smallY + 1 < largeY) {
    lli smallMid = (smallY * 2 + largeY) / 3;
    lli largeMid = (smallY + largeY * 2) / 3;
    lli smallMidQuery = query(BIG, smallMid);
    lli largeMidQuery = query(BIG, largeMid);
    if (smallMidQuery < largeMidQuery) {
      largeY = largeMid;
    } else {
      smallY = smallMid;
    }
  }
  lli y = (smallY + largeY) / 2;
  cout << "2 " << x << " " << y << endl;
}
// Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools  (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
  // Failed to predict input format
  lli N = 1;
  // cin >> N;
  while (N--)
    solve();
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX