Submission #653356

#	Time	Username	Problem	Language	Result	Execution time	Memory
653356		Vladth11	Linear Garden (IOI08_linear_garden)	C++14	80 / 100	91 ms	65536 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[NMAX][5][5][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;
    string s;
    cin >> s;
    dp[0][2][2][1] = 1;
    for(int i = 0; i < s.size(); i++) {
        char c = s[i];
        for(int minim = 0; minim <= 4; minim++) {
            for(int maxim = 0; maxim <= 4; maxim++) {
                    /// pun l
                    if(maxim != 4) {
                        if(c == 'L') {
                            add(dp[i + 1][minim + 1][max(maxim + 1, 3)][1], dp[i][minim][maxim][1]);
                            add(dp[i + 1][minim + 1][max(maxim + 1, 3)][0], dp[i][minim][maxim][0]);
                        } else {
                            add(dp[i + 1][minim + 1][max(maxim + 1, 3)][0], dp[i][minim][maxim][0]);
                            add(dp[i + 1][minim + 1][max(maxim + 1, 3)][0], dp[i][minim][maxim][1]);
                        }
                    }
                    /// pun P
                    if(minim != 0) {
                        if(c == 'P') {
                            add(dp[i + 1][min(1, minim - 1)][maxim - 1][1], dp[i][minim][maxim][1]);
                            add(dp[i + 1][min(1, minim - 1)][maxim - 1][0], dp[i][minim][maxim][0]);
                        } else {
                            add(dp[i + 1][min(1, minim - 1)][maxim - 1][0], dp[i][minim][maxim][0]);
                        }
                    }
            }
        }
    }
    int sum = 0;
    for(int minim = 0; minim <= 4; minim++){
        for(int maxim = 0; maxim <= 4; maxim++){
            add(sum, dp[s.size()][minim][maxim][0]);
            add(sum, dp[s.size()][minim][maxim][1]);
        }
    }
    cout << sum;
    return 0;
}

Compilation message (stderr)

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0; i < s.size(); i++) {
      |                    ~~^~~~~~~~~~

• 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: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5