#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pairll pair<ll,ll>
#define lpairll pair<ll,pairll>
#define repp(i,a,b) for (ll i = a; i <= b; i++)
#define repz(i,a,b) for (ll i = a; i < b; i++)
#define repm(i,a,b) for (ll i = a; i >= b; i--)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
const ll N = 1e5+5, MOD = 1e9+7;
ll tc = 1, n, m, fnd[N];
ll x, y, k;
string s, s1, s2, ye = "YES", no = "NO";
char cr[N];
ll ask(ll l, ll r){
cout << "? " << l << " " << r << endl;
cin >> m; return m;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
vector<ll> ntbgt;
ntbgt.pb(1);
cr[1] = '(';
repp(i,2,n){
ll a1;
if (ntbgt.size() && ask(ntbgt.back(),i)){
cr[i] = ')';
ntbgt.pop_back();
}
else{
cr[i] = '(';
ntbgt.pb(i);
}
}
cout << "! ";
for (ll i = 1; i <= n; i++){
cout << cr[i];
}
cout << endl;
}
Compilation message
zagrade.cpp: In function 'int main()':
zagrade.cpp:37:8: warning: unused variable 'a1' [-Wunused-variable]
37 | ll a1;
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
3 ms |
208 KB |
Output is correct |
3 |
Correct |
13 ms |
208 KB |
Output is correct |
4 |
Correct |
15 ms |
244 KB |
Output is correct |
5 |
Correct |
4 ms |
256 KB |
Output is correct |
6 |
Correct |
9 ms |
208 KB |
Output is correct |
7 |
Correct |
5 ms |
208 KB |
Output is correct |
8 |
Correct |
14 ms |
324 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
431 ms |
592 KB |
Output is correct |
3 |
Correct |
627 ms |
500 KB |
Output is correct |
4 |
Correct |
745 ms |
580 KB |
Output is correct |
5 |
Correct |
747 ms |
604 KB |
Output is correct |
6 |
Correct |
701 ms |
616 KB |
Output is correct |
7 |
Correct |
771 ms |
1032 KB |
Output is correct |
8 |
Correct |
827 ms |
496 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Mismatch at position 1. Expected ), found ( |
2 |
Halted |
0 ms |
0 KB |
- |