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>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-Ofast")
#define N 200500
#define NN 1005000
#define PB push_back
//#define endl '\n'
#define pri(x) cout << x << endl
#define _ << " " <<
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define M ll(1e9 + 7)
#define F first
#define S second
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//ordered_set se;
void TL()
{
while (1)
{
}
}
int n, q;
int ask(int l, int r)
{
q--;
if (q == -1)
TL();
pri("?" _ l _ r);
int x;
cin >> x;
return x;
}
char ans[N];
int main()
{
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("1.in", "r", stdin);
cin >> n >> q;
for (int i = 1; i <= n; i++)
ans[i] = 'a';
for (int i = 1; i <= n; i++)
{
if (ans[i] == 'a') continue;
for (int j = i + 1; j <= n; j += 2)
{
if (ans[j] == 'a') continue;
if (ask(i, j))
{
ans[i] = '(';
ans[j] = ')';
break;
}
}
}
cout << "! ";
for (int i = 1; i <= n; i++)
cout << ans[i];
cout << endl;
}
# | 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... |