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;
typedef pair<int,int> pii;
const int MAXN = 1e5+5;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define fr first
#define sc second
int n, q;
string ans;
int main() {
cin >> n >> q;
for(int i = 1; i <= n; i++) ans += '.';
stack<int> fila;
fila.push(1);
for(int i = 2; i <= n; i++) {
int x = fila.top(), aux;
cout << "? " << x << " " << i << endl;
cin >> aux;
if(aux) {
fila.pop();
ans[x-1] = '(';
ans[i-1] = ')';
continue;
}
fila.push(i);
}
int s = sz(fila);
for(int i = 1; i <= s; i++) {
if(i <= s/2) ans[fila.top()-1] = '(';
else ans[fila.top()-1] = ')';
fila.pop();
}
cout << "! " << ans << "\n";
}
# | 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... |