Submission #814269

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP (i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back

using namespace std;

typedef long long ll;

const int INF = 1 << 29;

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

    int longest = 0;
    int idx = 0;
    rep (i, n) {
        int tmp;
        cout << "? 1 " << i + 1<< endl;
        cin >> tmp;
        if (longest < tmp) {
            longest = tmp;
            idx = i + 1;
        }
    }

    int ans = 0;
    rep (i, n) {
        int tmp;
        cout << "? " << idx << " " << i + 1 << endl;
        cin >> tmp;
        ans = max(ans, tmp);
    }

    cout << "! " << ans << endl;
}

Submission Info

Judge Result