제출 #532455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532455		prvocislo	Linear Garden (IOI08_linear_garden)	C++17	95 / 100	97 ms	65540 KiB

linear_garden

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;

int m;
void upd(int& a, int b) { a = (a + b) % m; }
int add(int a, int b) { return (a + b) % m; }
int mul(int a, int b) { return (a * 1ll * b) % m; }

const int maxn = 1e6 + 5;
// dp[kde som][s cim som skoncil][co malo ako posledne dva kusy][nasledujeme ten povodny retazec]
int dp[maxn][3][3][2];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n >> m;
    string s;
    cin >> s;
    vector<int> v(n + 1);
    for (int i = 1; i <= n; i++) v[i] = (s[i - 1] == 'P');
    dp[0][2][2][1] = 1;
    for (int i = 0; i < n; i++)
    {
        for (int lst = 0; lst <= 2; lst++)
        {
            for (int lst2 = 0; lst2 <= 2; lst2++)
            {
                for (int fw = 0; fw < 2; fw++) if (dp[i][lst][lst2][fw])
                {
                    for (int now = 0; now < 2 && (!fw || now <= v[i + 1]); now++)
                    {
                        if (now == lst && now == lst2) continue;
                        upd(dp[i + 1][now][(now == lst) ? now : lst2][fw && now == v[i + 1]], dp[i][lst][lst2][fw]);
                    }
                }
            }
        }
    }
    int ans = 0;
    for (int lst = 0; lst <= 2; lst++)
    {
        for (int lst2 = 0; lst2 <= 2; lst2++)
        {
            for (int fw = 0; fw < 2; fw++)
            {
                upd(ans, dp[n][lst][lst2][fw]);
            }
        }
    }
    cout << ans << "\n";
    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: 0 / 5