#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 1007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;
char ans[M];
int n, q;
bool vist[M];
void solve(int l, int r){
if(l > r) return;
ans[l] = '(';
ans[r] = ')';
++l; --r;
for(int i = l + 1; i <= r; ++i){
cout << "? " << l << " " << i << endl;
bool ret; cin >> ret;
if(ret){
solve(l, i);
if(i + 1 < r) solve(i + 1, r);
}
}
return;
}
int main(){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> q;
solve(0, n + 1);
cout << "! ";
for(int i = 1; i <= n; ++i) cout << ans[i];
cout << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Runtime error |
1485 ms |
288 KB |
Execution killed with signal 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Mismatch at position 1. Expected ), found |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Mismatch at position 1. Expected ), found |
2 |
Halted |
0 ms |
0 KB |
- |