This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,ll> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define for(i,s,e) for(int i=s;i<=int(e);++i)
#define dec(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define afor(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 500100
#define inf (ll)1e14
#define mod 1000000007
#define getchar_unlocked _getchar_nolock
int n,q;
char ans[maxn];
bool qry(int a,int b){
cout << "? " << a << ' ' << b << '\n';
cout.flush();
bool res; cin >> res;
return res;
}
int32_t main(){
fast;
cin >> n >> q;
stack <int> st; st.push(1);
for(i,2,n){
if (!st.empty() && qry(st.top(), i)){
ans[i] = ')'; ans[st.top()] = '('; st.pop();
}else st.push(i);
}
int m = st.size();
for(i,1,m){
ans[st.top()] = (i <= m/2 ? '(' : ')'); st.pop();
}
cout << "! "; for(i,1,n) cout << ans[i]; cout << '\n';
cout.flush();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |