Submission #653416

#	Time	Username	Problem	Language	Result	Execution time	Memory
653416		Vladth11	Linear Garden (IOI08_linear_garden)	C++11	100 / 100	75 ms	1280 KiB

linear_garden

#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>

#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

#pragma GCC optimize("Ofast")

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;

const int bSize = 11;
const int bits = 18;
const int NMAX = 1000001;

int dp[2][3][3][2];
int MOD;

void add(int &x, int val) {
    x += val;
    if(x >= MOD)
        x -= MOD;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n >> MOD;
    dp[0][0][0][1] = 1;
    for(int i = 0; i < n; i++) {
        char c;
        cin >> c;
        int acu = i % 2;
        int nxt = 1 - acu;
        for(int minim = 0; minim <= 2; minim++) {
            for(int maxim = 0; maxim <= 2; maxim++) {
                /// pun l
                if(maxim != 2) {
                    if(c == 'L') {
                        add(dp[nxt][max(0, minim - 1)][maxim + 1][1], dp[acu][minim][maxim][1]);
                        add(dp[nxt][max(0, minim - 1)][maxim + 1][0], dp[acu][minim][maxim][0]);
                    } else {
                        add(dp[nxt][max(0, minim - 1)][maxim + 1][0], dp[acu][minim][maxim][0]);
                        add(dp[nxt][max(0, minim - 1)][maxim + 1][0], dp[acu][minim][maxim][1]);
                    }
                }
                /// pun P
                if(minim != 2) {
                    if(c == 'P') {
                        add(dp[nxt][minim + 1][max(0, maxim - 1)][1], dp[acu][minim][maxim][1]);
                        add(dp[nxt][minim + 1][max(0, maxim - 1)][0], dp[acu][minim][maxim][0]);
                    } else {
                        add(dp[nxt][minim + 1][max(0, maxim - 1)][0], dp[acu][minim][maxim][0]);
                    }
                }
                dp[acu][minim][maxim][0] = dp[acu][minim][maxim][1] = 0;
            }
        }
    }
    int sum = 0;
    for(int minim = 0; minim <= 2; minim++) {
        for(int maxim = 0; maxim <= 2; maxim++) {
            add(sum, dp[n % 2][minim][maxim][0]);
            add(sum, dp[n % 2][minim][maxim][1]);
        }
    }
    cout << sum;
    return 0;
}

• 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: 5 / 5