# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544609 | rainboy | Vim (BOI13_vim) | C11 | 41 ms | 22520 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.
/* upsolve using analysis */
#include <stdio.h>
#include <string.h>
#define N 70000
#define A 10
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int main() {
static char cc[N + 1], must[N + 1];
static int dp[N + 1][A], dq[N + 1][A][A];
int n, n_, i, a, b, a_, b_, e, ans;
scanf("%d%s", &n, cc), n = strlen(cc);
n_ = 0, e = 1, ans = 0;
for (i = 0; i < n; i++)
if (cc[i] != 'e') {
cc[n_] = cc[i], must[n_] = e, n_++;
e = 0;
} else {
ans += n_ == 0 ? 1 : 2;
e = 1;
}
cc[n_++] = 'e';
n = n_;
cc[n] = 0;
for (i = 0; i < n; i++) {
memset(dp[i], 0x3f, sizeof dp[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... |