# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704725 | rainboy | 스탬프 수집 (JOI16_ho_t2) | C11 | 6 ms | 6740 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 <stdio.h>
#include <string.h>
#define N 100000
long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
static char cc[N + 1];
static long long dp[N + 1][4], dq[N + 1][4];
int n, i, a;
long long ans;
scanf("%d%s", &n, cc);
dp[0][0] = 1;
for (i = 0; i < n; i++) {
memcpy(dp[i + 1], dp[i], sizeof dp[i]);
if (cc[i] == 'J')
dp[i + 1][1] += dp[i + 1][0];
else if (cc[i] == 'O')
dp[i + 1][2] += dp[i + 1][1];
else
dp[i + 1][3] += dp[i + 1][2];
}
dq[n][3] = 1;
for (i = n - 1; i >= 0; i--) {
memcpy(dq[i], dq[i + 1], sizeof dq[i + 1]);
if (cc[i] == 'J')
dq[i][0] += dq[i][1];
else if (cc[i] == 'O')
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... |