Submission #4013308

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend());//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;


int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n,dist;
  cin >>n;
  int max_len=0,max_node=0;
  for(int i=2;i<=n;i++){
    cout << "? " << 1 << " " << 2 << endl;
    cin >> dist;
    if(dist>max_len){
      max_len = dist;
      max_node=i;
    }
  }
  for(int i=1;i<=n;i++){
    if(i==max_node) continue;
    cout << "? " << max_node << " " << i << endl;
    cin >> dist;
    max_len = max(dist,max_len);
  }
  cout << "! " << max_len << endl;
}

Submission Info

Judge Result