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;
const int MAXN=100005;
int stk[MAXN],top;
int quest(int a,int b){
cout<<"?" << " "<< a<<" "<<b<<endl;
int x;cin>>x;
return x;
}
int main(){
int n,m;cin>>n>>m;
string s;
for(int i=1;i<=n;i++){
s=s+" ";
if(top==0 || !quest(stk[top],i)){
stk[++top]=i;
}
else{
s[stk[top--]-1]='(';
s[i-1]=')';
}
}
for(int i=1;i<=top/2;i++){
s[stk[i]-1]=')';
}
for(int i=top/2;i<=top;i++){
s[stk[i]-1]='(';
}
cout<< "!" << " " << s <<endl;;
}
# | 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... |