#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int N=4e3;
const int off=1<<20;
const int MOD=1e9+7;
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,q;
cin >> n >> q;
int mns=1;
string s;
int cnt=n/2;
for(int i=0;i<n;i++)s+='?';
for(int i=2;i<=n;i++){
if(i-mns<=0)mns=1;
cout.flush()<<"? "<<i-mns<<' '<<i<<endl;
int ans;
cin >> ans;
if(ans){
s[i-mns-1]='(';
s[i-1]=')';
mns+=2;
// i++;
cnt--;
}
else mns=1;
}
int l=cnt,r=cnt;
for(int i=0;i<n;i++){
if(s[i]=='?'){
if(l){
s[i]=')';
l--;
}
else{
s[i]='(';
r--;
}
}
}
cout.flush()<<"! "<<s<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
12 ms |
208 KB |
Output is correct |
3 |
Incorrect |
7 ms |
208 KB |
Mismatch at position 1. Expected (, found ) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
3 |
Incorrect |
8 ms |
256 KB |
Mismatch at position 30. Expected (, found ) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
826 ms |
524 KB |
Output is correct |
3 |
Incorrect |
687 ms |
532 KB |
Mismatch at position 1. Expected (, found ) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
662 ms |
524 KB |
Output is correct |
3 |
Incorrect |
612 ms |
516 KB |
Mismatch at position 11. Expected (, found ) |
4 |
Halted |
0 ms |
0 KB |
- |