제출 #538299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538299		timreizin	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	19 ms	10228 KiB

linear_garden

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <array>
#include <set>
#include <string>

using namespace std;

using ll = long long;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    ll m;
    string s;
    cin >> n >> m >> s;
    ll res = 1;
    array<ll, 1000001> powers;
    powers[0] = 1;
    for (ll i = 1; i <= 1e6; ++i) powers[i] = (powers[i - 1] * 2) % m;
    int pref = 0, maxP = 0, minP = 0;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] == 'P')
        {
            --pref;
            int nmax = max(maxP, pref), nmin = min(minP, pref);
            if (nmax - nmin <= 2)
            {
                if (nmax - nmin == 2) res += (pref != nmax && pref != nmin ? powers[(n - i) / 2] : powers[(n - i - 1) / 2]);
                else
                {
                    res += powers[(n - i) / 2] + powers[(n - i - 1) / 2] - 1;
                    if (res >= m) res -= m;
                }
                if (res >= m) res -= m;
            }
            ++pref;
        }
        pref += (s[i] == 'P' ? 1 : -1);
        maxP = max(maxP, pref);
        minP = max(minP, pref);
    }
    cout << res;
    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