Submission #1248317

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248317		Lithanium	Linear Garden (IOI08_linear_garden)	C++20	95 / 100	165 ms	78808 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;

bitset<1000005> num;
int dp[1000005][2][2];
int N, M;

int solve(int n, short L, short P, bool lim) {
    if (L > 2 or P > 2) return 0;
    if (n == N) return 1;
    if (!lim and max(L, P) < 2 and dp[n][L][P] != -1) return dp[n][L][P];
    int top = 1;
    if (lim and num[n+1] == 0) top = 0;
    int ans = 0;
    // put a 0
    if (L != 2) (ans += solve(n+1, L+1, max(0, P-1), lim and (top == 0))) %= M;
    // put a 1
    if (top and P != 2) (ans += solve(n+1, max(0, L-1), P+1, lim)) %= M;
    if (!lim and max(L, P) < 2) return dp[n][L][P] = ans;
    return ans;
}

int main() {
    memset(dp, -1, sizeof(dp));
    cin >> N >> M;
    for (int i = 1; i <= N; i ++) {
        char c;
        cin >> c;
        if (c == 'P') num[i] = 1;
    }
    cout << solve(0, 0, 0, 1);
}

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 4 / 4
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5