oj.uz

Submission #229475

# Submission time Handle Problem Language Result Execution time Memory
229475 2020-05-04T15:11:52 Z apostoldaniel854 Linear Garden (IOI08_linear_garden) C++14
2 / 100
 30 ms 3356 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"

int MOD;

int dp[2][2 + 2 + 1][2];

void _ (int &a, int b) {
    a += b;
    if (a >= MOD)
        a -= MOD;
}

int main() {
    ios::sync_with_stdio (false);
    cin.tie (0); cout.tie (0);

    int n;
    string garden;
    cin >> n >> MOD;
    cin >> garden; garden = " " + garden;
    /// -> L +1
    /// -> P -1
    if (garden[1] == 'L') {
        dp[1][2 + 1][1] = 1; /// put L as first element
    }
    else {
        dp[1][2 - 1][1] = 1; /// put P as first element
        dp[1][2 + 1][0] = 1; /// put L as first element, now we can put anything
    }
    for (int i = 2; i <= n; i++) {
        int cur = i & 1;
        int lst = !cur;
        for (int dif = -2; dif <= 2; dif++)
            for (int p = 0; p < 2; p++)
                dp[cur][2 + dif][p] = 0;
        for (int dif = -2; dif <= 2; dif++) {
            /// without prefix
            if (dif > -2)
                _ (dp[cur][2 + dif][0], dp[lst][2 + dif - 1][0]); /// add L
            if (dif < 2)
                _ (dp[cur][2 + dif][0], dp[lst][2 + dif + 1][0]); /// add P
            /// with prefix
            if (garden[i] == 'P') {
                if (dif > -2)
                    _ (dp[cur][2 + dif][0], dp[lst][2 + dif - 1][1]); /// add L so we get rid of prefix
                if (dif < 2)
                    _ (dp[cur][2 + dif][1], dp[lst][2 + dif + 1][1]); /// add P to continue prefix
            }
            else {
                if (dif > -2)
                    _ (dp[cur][2 + dif][1], dp[lst][2 + dif - 1][1]); /// add L to continue prefix
            }
        }
    }
    int ans = 0;
    for (int dif = -2; dif <= 2; dif++)
        for (int p = 0; p < 2; p++)
            _ (ans, dp[n & 1][2 + dif][p]);
    cout << ans << "\n";

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #8
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 304 KB Output isn't correct

Subtask #9
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #10
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #11
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 384 KB Output isn't correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 640 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 560 KB Output isn't correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1428 KB Output isn't correct

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1684 KB Output isn't correct

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 1988 KB Output isn't correct

Subtask #22
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 2332 KB Output isn't correct

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 3356 KB Output isn't correct
2 Halted 0 ms 0 KB -