#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAX=100005;
int N=6;
int Q=10;
vector<int> pos={0};
char ans[MAX];
int main(){
cin>>N>>Q;
int l=0;
int r=1;
int t=N;
while (r<N){
cout<<"? "<<l+1<<" "<<r+1<<"\n";
bool res;
cin>>res;
if (res){
ans[l]='(';
ans[r]=')';
t-=2;
pos.pop_back();
if (pos.size()) l=pos.back();
else l=r+1, r=l;
}else{
l++;
pos.push_back(r);
l=pos.back();
}
r++;
}
int x=0;
for (int i=0;i<N;i++){
if (ans[i]==0){
x++;
if (x*2<=t) ans[i]=')';
else ans[i]='(';
}
}
cout<<"! ";
for (int i=0;i<N;i++) cout<<ans[i];
}
# | 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... |