# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585910 | MilosMilutinovic | Zagrade (COI20_zagrade) | C++14 | 888 ms | 1636 KiB |
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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
using namespace std;
#ifdef LOCAL
#define eprintf(...) {fprintf(stderr, __VA_ARGS__);fflush(stderr);}
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int N = 100100;
char ans[N];
int Ask(int l, int r) {
printf("? %d %d\n", l, r);
fflush(stdout);
int x;
scanf("%d", &x);
return x;
}
int main()
{
startTime = clock();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, q;
scanf("%d%d", &n, &q);
vector<int> stk;
for (int i = 1; i <= n; i++)
ans[i] = '!';
for (int i = 1; i <= n; i++) {
if (stk.empty() || !Ask(stk.back(), i))
stk.push_back(i);
else {
ans[stk.back()] = '(';
ans[i] = ')';
stk.pop_back();
}
}
vector<int> pos;
for (int i = 1; i <= n; i++)
if (ans[i] == '!')
pos.push_back(i);
int sz = (int)pos.size();
for (int i = 0; i < sz; i++)
ans[pos[i]] = (i < sz / 2 ? ')' : '(');
printf("! ");
for (int i = 1; i <= n; i++)
printf("%c", ans[i]);
fflush(stdout);
return 0;
}
Compilation message (stderr)
# | 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... |