#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ins insert
#define pb push_back
// #define endl '\n'
#define putr(x) cout<<x<<endl;return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7, sze = 5e5 +5, inf = INT_MAX, LL = 30;
int ask(int l,int r){
cout<<"? "<<l<<" "<<r<<endl;
int x;cin>>x;
return x;
}
void rush(){
int n;
cin>>n;
vector<int> ans(n+1,'_');
stack<int> st;
for(int i=1;i<=n;i++){
if(st.empty()){
st.push(i);
}
else{
if(ask(st.top(),i)){
ans[st.top()]='(';
st.pop();
ans[i]=')';
}
else{
st.push(i);
}
}
}
int qal = st.size()/2;
for(int i=1;i<=n;i++){
if( ans[i]=='_' ){
qal--;
if(qal>=0){
ans[i]=')';
}
else{
ans[i]='(';
}
}
}
string res;
for(int i=1;i<=n;i++) res+=ans[i];
cout<<"! "<<res<<endl;
}
signed main(){
// ios::sync_with_stdio(0);
// cin.tie(0);
int tt = 1;
// cin>>tt;
while(tt--){
rush();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
3 ms |
504 KB |
Output is correct |
3 |
Incorrect |
4 ms |
336 KB |
Mismatch at position 2. Expected (, found ) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Mismatch at position 2. Expected (, found ) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |