# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839702 | sleepntsheep | JJOOII 2 (JOI20_ho_t2) | C++17 | 13 ms | 10068 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 <cstdio>
#include <cstring>
#include <algorithm>
#define N 200005
int n, k, f[N][4], far_pos[N][4], near_pos[N][4];
char s[N];
int cnt(int l, int r, int c) { return f[r][c] - f[l-1][c]; }
int suf(int l, int c) { return f[n][c] - f[l-1][c]; }
#define chmax(a, b) a = std::max(a, b)
#define chmin(a, b) a = std::min(a, b)
int ok(int m)
{
/* get O's from l to r */
/*
* --JJJJOOOOOOOOOOOOOIIII-
* l r
*/
int cost[4] = {0};
for (int r = 1; r <= n; ++r)
{
/* c[r][1] - c[l-1][1] == k
* c[l-1][1] == c[r][1] - m */
if (f[r][2] < k) continue;
int l = far_pos[f[r][2] - k][2] + 1;
cost[2] = r-l+1-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... |