# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61229 | SpaimaCarpatilor | parentrises (BOI18_parentrises) | C++17 | 112 ms | 3628 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<bits/stdc++.h>
using namespace std;
int N;
char sir[1000009], ans[1000009];
const int mod = 1e9 + 7;
void adto (int &x, int y) {x += y; if (x >= mod) x -= mod;}
void addGreens (int l, int r)
{
while (1)
{
while (sir[l] == ')' && l <= N) l ++;
while (sir[r] == '(' && r >= 1) r --;
if (l == N + 1 || r == 0) break;
if (l < r) ans[l] = ans[r] = 'G', l ++, r --;
else break;
}
}
void fillOutRB (bool &ok)
{
int j = 0, k = 0;
for (int i=1; i<=N; i++)
{
if (ans[i] == 'G')
{
if (sir[i] == '(') j ++, k ++;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |