Submission #1046110

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1046110	2024-08-06 10:11:27	Zicrus	Linear Garden (IOI08_linear_garden)	C++17	80 / 100	55 ms	65536 KiB

linear_garden

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    ll n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    vector<vector<vector<ll>>> dp(n+1, vector<vector<ll>>(3, vector<ll>(3)));
    dp[n][0][0] = dp[n][1][1] = 1;
    dp[n][1][0] = dp[n][0][1] = 1;
    dp[n][2][0] = dp[n][0][2] = 1;
    for (int i = n-1; i >= 0; i--) {
        dp[i][0][0] = (dp[i+1][1][0] + dp[i+1][0][1]) % m;
        dp[i][1][1] = (dp[i+1][2][0] + dp[i+1][0][2]) % m;
        dp[i][1][0] = (dp[i+1][2][0] + dp[i+1][0][1]) % m;
        dp[i][0][1] = (dp[i+1][1][0] + dp[i+1][0][2]) % m;
        dp[i][2][0] = dp[i][0][2] = dp[i+1][1][1] % m;
    }
    ll res = 1;
    ll low = 0, high = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'P') {
            if (low > -2) res += dp[i+1][-(low-1)][max(0ll, high-1)];
            res %= m;
            low = min(0ll, low+1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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