Submission #345765

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  int N;
  cin >> N;

  int dist;
  vector<int> d, d2;
  d.push_back(0);
  rep(i,N-1){
    cout << "? " << 1 << " " << i+2 << endl;
    cin >> dist;
    d.push_back(dist);
  }
  int mx_i = -1, mx_v = -1;
  rep(i,d.size()){
    if(mx_v < d[i]){
      mx_i = i;
      mx_v = d[i];
    }
  }
  rep(i,N){
    if(i==mx_i){
      d2.push_back(0);
    }else{
      cout << "? " << mx_i+1 << " " << i+1 << endl;
      cin >> dist;
      d2.push_back(dist);
    }
  }
  sort(ALLOF(d2));
  reverse(ALLOF(d2));
  cout << d2[0] << endl;
  
  return 0;
}

Submission Info

Judge Result