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 int long long
//#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int sor(int x,int y){
cout<<"? "<<x<<" "<<y<<endl;
cout<<endl;
int m;cin>>m;
cout<<endl;
return m;
}
int main(){
// faster
int n,k;cin>>n>>k;
cout<<endl;
vector <int> q;
char dizi[n+1];
dizi[1]='(';
q.push_back(1);
for(int i=2;i<=n;i++){
if(q.size() && sor(q.back(),i)){
dizi[i]=')';
q.pop_back();
}
else{
dizi[i]='(';
q.push_back(i);
}
}
int gec=q.size()/2;
for(int i=0;i<=gec-1;i++){
dizi[q[i]]=')';
}//2-4 subtasks
cout<<"!";
for(int i=1;i<=n;i++)cout<<" "<<dizi[i];
cout<<endl;
//return 0;
}
# | 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... |