This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pairll pair<ll,ll>
#define lpairll pair<ll,pairll>
#define repp(i,a,b) for (ll i = a; i <= b; i++)
#define repz(i,a,b) for (ll i = a; i < b; i++)
#define repm(i,a,b) for (ll i = a; i >= b; i--)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
const ll N = 1e5+5, MOD = 1e9+7;
ll tc = 1, n, m, fnd[N];
ll x, y, k;
string s, s1, s2, ye = "YES", no = "NO";
char cr[N];
void input(){
  cin >> n >> k; 
}
void solve(){
  ll tot = 0;
  for (ll i = 1; i <= n; i++){
    for (ll j = i+1; j <= n; j += 2){
      cout << "? " << i << " " << j << endl;
      cout.flush();
      cin >> m;
      if (m == 1){
        cr[i] = '(';
        cr[j] = ')';
        if (fnd[i] == 0){
          fnd[i] = 1;
          tot++;
        }
        if (fnd[j] == 0){
          fnd[j] = 1;
          tot++;
        }
      }
      if (tot >= n) break;
    }
    if (tot >= n) break;
  }
  cout << "! ";
  for (ll i = 1; i <= n; i++){
    cout << cr[i];
  }
  cout << endl;
  cout.flush();
}
int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  //cin >> tc;
  while(tc--){
    input();
    solve();
  }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |