結果

問題 No.3161 Find Presents
ユーザー 👑 binap
提出日時 2025-05-23 20:31:19
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 249 ms / 4,000 ms
コード長 3,191 bytes
コンパイル時間 3,831 ms
コンパイル使用メモリ 254,344 KB
実行使用メモリ 26,216 KB
平均クエリ数 3407.01
最終ジャッジ日時 2025-05-23 20:31:39
合計ジャッジ時間 17,889 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 80
権限があれば一括ダウンロードができます

ソースコード

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 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);}

const int D = 1000000;

int main(){
	int dummy;
	cout << "? 0 " << D << " 0 " << D << "\n";
	cin >> dummy;
	vector<pair<int, int>> vec;
	
	auto f = [&](int xl, int xr, int yl, int yr, int n, auto f){
		if(n == 0) return;
		
		if(xr - xl >= 1){
			int xm = (xr + xl) / 2;
			int n1;
			cout << "? " << xl << ' ' << xm << ' ' << yl << ' ' << yr << "\n";
			cin >> n1;
			f(xl, xm, yl, yr, n1, f);
			int n2;
			cout << "? " << xm + 1 << ' ' << xr << ' ' << yl << ' ' << yr << "\n";
			cin >> n2;
			f(xm + 1, xr, yl, yr, n2, f);
		}else if(yr - yl >= 1){
			int ym = (yr + yl) / 2;
			int n1;
			cout << "? " << xl << ' ' << xr << ' ' << yl << ' ' << ym << "\n";
			cin >> n1;
			f(xl, xr, yl, ym, n1, f);
			int n2;
			cout << "? " << xl << ' ' << xr << ' ' << ym + 1 << ' ' << yr << "\n";
			cin >> n2;
			f(xl, xr, ym + 1, yr, n2, f);
		}else{
			assert(xl == xr);
			assert(yl == yr);
			vec.emplace_back(xl, yl);
		}
	};
	f(0, D, 0, D, 1, f);
	int n = vec.size();
	cout << "! " << n << "\n";
	for(auto [x, y] : vec){
		cout << x << ' ' << y << "\n";
	}
	return 0;
}
0