#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
const ll maxn=1e5+5;
const int INF=1e9+5;
#define ok ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl '\n'
int n, q, bk, ttp, jwb;
stack<int> st;
char ans[maxn];
int main() {
ok
cin >> n >> q;
for(int i=1; i<=n; i++) {
if(st.empty()) {
ans[i]='(';
st.push(i);
continue;
}
cout << "? " << st.top() << " " << i << endl;
cout.flush();
cin >> jwb;
if(jwb==1) {
ans[i]=')';
st.pop();
} else {
ans[i]='(';
st.push(i);
}
}
cout << "! ";
for(int i=1; i<=n; i++) {
cout << ans[i];
}
cout << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
3 |
Correct |
9 ms |
208 KB |
Output is correct |
4 |
Correct |
8 ms |
208 KB |
Output is correct |
5 |
Correct |
8 ms |
208 KB |
Output is correct |
6 |
Correct |
10 ms |
208 KB |
Output is correct |
7 |
Correct |
8 ms |
208 KB |
Output is correct |
8 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
489 ms |
516 KB |
Output is correct |
3 |
Correct |
768 ms |
712 KB |
Output is correct |
4 |
Correct |
725 ms |
480 KB |
Output is correct |
5 |
Correct |
757 ms |
472 KB |
Output is correct |
6 |
Correct |
759 ms |
408 KB |
Output is correct |
7 |
Correct |
835 ms |
700 KB |
Output is correct |
8 |
Correct |
894 ms |
600 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |