Submission #345481

---

Source Code Expand

#include <bits/stdc++.h>

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i <= _##i; i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i < _##i; i++)
#define downto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i >= _##i; i--)
#define downtil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f); i > _##i; i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

using namespace std;

template<class T> istream& operator>>(istream& in, vector<T>& vec){
	times(vec.capacity(), i) in >> vec[i];
	return in;
}

template<class T> ostream& operator<<(ostream& out, const vector<T>& vec){
	times(vec.capacity(), i) out << (i ? " " : "") << vec[i];
	return out;
}

int main(){
	int N;
	cin >> N;
	times(N, i) cout << "? 1 " << i + 1 << endl;
	int maxd = 0, maxi = 0;
	times(N, i){
		int d;
		cin >> d;
		if(maxd < d){
			maxd = d;
			maxi = i;
		}
	}

	times(N, i) cout << "? " << maxi + 1 << " " << i + 1 << endl;
	maxd = 0;
	maxi = 0;
	times(N, i){
		int d;
		cin >> d;
		if(maxd < d){
			maxd = d;
			maxi = i;
		}
	}
	cout << maxd << endl;
	return 0;
}

Submission Info

Judge Result