# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379491 | qwerty234 | Monochrome Points (JOI20_monochrome) | C++14 | 67 ms | 34156 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>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define int long long
using namespace std;
const int MAXN = 1e6 + 10;
int n, blue[MAXN], red[MAXN], l1_blue[MAXN], r1_blue[MAXN], l2_blue[MAXN], r2_blue[MAXN];
int l1_red[MAXN], r1_red[MAXN], l2_red[MAXN], r2_red[MAXN];
int closest_left_red[MAXN], closest_left_blue[MAXN];
ll ans[MAXN];
char a[MAXN];
void precalc() {
for (int i = 1; i <= n; i++) {
blue[i + n] = blue[i] + 2 * n;
red[i + n] = red[i] + 2 * n;
}
int lastred = 0, lastblue = 0;
for (int i = 1; i <= 4 * n; i++) {
int cur = i; if (i > 2 * n) cur -= 2 * n;
if (a[cur] == 'B') lastblue++; else lastred++;
closest_left_red[i] = lastred;
closest_left_blue[i] = lastblue;
}
for (int i = 1; i <= n; i++) {
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... |