제출 #995836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995836		biank	Linear Garden (IOI08_linear_garden)	C++11	0 / 100	62 ms	65536 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6;

int memo[MAX_N][5][5][3][2];
int n, m;
string g;

int dp(int pos, int curr_diff = 2, int min_diff = 2, int max_diff = 2, bool tight = 1) {
    if (curr_diff < 0 || curr_diff >= 5) return 0;
    if (max_diff - min_diff >= 3) return 0;
    if (pos == n) return 1;
    int &res = memo[pos][curr_diff][min_diff][max_diff - min_diff][tight];
    if (res != -1) return res;
    res = dp(pos + 1, curr_diff + 1, min_diff, max(max_diff, curr_diff + 1), tight && g[pos] == 'L');
    if (!tight || g[pos] == 'P') {
        res += dp(pos + 1, curr_diff - 1, min(min_diff, curr_diff - 1), max_diff, tight && g[pos] == 'P');
        if (res >= m) res -= m;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    cin >> n >> m >> g;
    memset(memo, -1, sizeof memo);
    cout << dp(0) << '\n';
    
    return 0;
}

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