結果

問題 No.2962 Sum Bomb Bomber
ユーザー 👑 binapbinap
提出日時 2024-11-16 16:55:57
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 127 ms / 2,000 ms
コード長 2,950 bytes
コンパイル時間 4,602 ms
コンパイル使用メモリ 261,464 KB
実行使用メモリ 25,580 KB
平均クエリ数 207.28
最終ジャッジ日時 2024-11-16 16:56:35
合計ジャッジ時間 14,782 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 84 ms
24,824 KB
testcase_01 AC 105 ms
24,824 KB
testcase_02 AC 100 ms
25,208 KB
testcase_03 AC 127 ms
25,208 KB
testcase_04 AC 94 ms
25,196 KB
testcase_05 AC 101 ms
24,440 KB
testcase_06 AC 78 ms
24,568 KB
testcase_07 AC 93 ms
25,196 KB
testcase_08 AC 90 ms
25,208 KB
testcase_09 AC 92 ms
25,208 KB
testcase_10 AC 95 ms
24,824 KB
testcase_11 AC 93 ms
24,568 KB
testcase_12 AC 114 ms
25,208 KB
testcase_13 AC 106 ms
25,208 KB
testcase_14 AC 104 ms
25,208 KB
testcase_15 AC 82 ms
25,148 KB
testcase_16 AC 96 ms
25,208 KB
testcase_17 AC 106 ms
25,208 KB
testcase_18 AC 100 ms
24,568 KB
testcase_19 AC 90 ms
24,824 KB
testcase_20 AC 98 ms
25,208 KB
testcase_21 AC 83 ms
24,568 KB
testcase_22 AC 94 ms
24,824 KB
testcase_23 AC 99 ms
24,824 KB
testcase_24 AC 98 ms
24,824 KB
testcase_25 AC 89 ms
24,812 KB
testcase_26 AC 102 ms
25,208 KB
testcase_27 AC 100 ms
25,208 KB
testcase_28 AC 97 ms
24,824 KB
testcase_29 AC 98 ms
24,824 KB
testcase_30 AC 94 ms
24,824 KB
testcase_31 AC 83 ms
24,824 KB
testcase_32 AC 91 ms
24,824 KB
testcase_33 AC 93 ms
25,208 KB
testcase_34 AC 100 ms
25,208 KB
testcase_35 AC 99 ms
24,824 KB
testcase_36 AC 98 ms
25,208 KB
testcase_37 AC 108 ms
25,208 KB
testcase_38 AC 95 ms
25,208 KB
testcase_39 AC 102 ms
24,568 KB
testcase_40 AC 102 ms
24,568 KB
testcase_41 AC 93 ms
24,824 KB
testcase_42 AC 101 ms
24,568 KB
testcase_43 AC 90 ms
24,824 KB
testcase_44 AC 101 ms
25,064 KB
testcase_45 AC 105 ms
24,824 KB
testcase_46 AC 94 ms
24,824 KB
testcase_47 AC 97 ms
25,208 KB
testcase_48 AC 94 ms
24,440 KB
testcase_49 AC 95 ms
24,568 KB
testcase_50 AC 92 ms
24,824 KB
testcase_51 AC 102 ms
24,812 KB
testcase_52 AC 83 ms
24,812 KB
testcase_53 AC 103 ms
25,196 KB
testcase_54 AC 78 ms
24,800 KB
testcase_55 AC 79 ms
25,196 KB
testcase_56 AC 78 ms
25,580 KB
testcase_57 AC 93 ms
24,556 KB
testcase_58 AC 100 ms
24,812 KB
testcase_59 AC 95 ms
24,812 KB
testcase_60 AC 97 ms
24,556 KB
testcase_61 AC 96 ms
25,196 KB
testcase_62 AC 97 ms
24,812 KB
testcase_63 AC 90 ms
24,556 KB
testcase_64 AC 91 ms
25,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n;
	cin >> n;
	
	auto func = [&](int cx, int cy){
		long long left = -1001001001;
		long long right = 1001001001;
		
		while(right - left > 2){
			long long low = left + (right - left) / 3;
			long long high = left + (right - left) * 2 / 3;
			long long res_low;
			cout << "1 " << cx * low << ' ' << cy * low << "\n";
			cin >> res_low;
			long long res_high;
			cout << "1 " << cx * high << ' ' << cy * high << "\n";
			cin >> res_high;
			if(res_low < res_high) right = high;
			else left = low;
		}
		return (right + left) / 2;
	};
	
	long long ans_x = func(1, 0);
	long long ans_y = func(0, 1);
	cout << "2 " << ans_x << ' ' << ans_y << "\n";
	return 0;
}
0