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 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 = 500007;
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;
int main(){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cout.flush();
cin >> n >> q;
for(int i = 1; i <= n; ++i) if(!ans[i]){
bool ok = 0;
for(int j = i + 1; j <= n; ++j) if(!ans[j]){
cout << "? " << i << " " << j << endl;
cin >> ok;
if(ok){
ans[i] = '(';
ans[j] = ')';
break;
}
}
if(!ok) ans[i] = ')';
}
cout << "! ";
for(int i = 1; i <= n; ++i) cout << ans[i];
cout << endl;
return 0;
}
# | 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... |