제출 #163351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163351		dolphingarlic	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	39 ms	10260 KiB

linear_garden

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll pw[1000001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    string s;
    cin >> n >> m >> s;

    pw[0] = 1;
    FOR(i, 1, n + 1) pw[i] = (2 * pw[i - 1]) % m;
    
    ll ans = 1;
    int mn = 0, mx = 0, curr = 0;
    FOR(i, 0, n) {
        if (s[i] == 'L') mx = max(mx, ++curr);
        else {
            int temp_mx = max(mx, curr + 1);
            int k = n - i - 1;

            if (temp_mx - mn == 2) {
                if (curr + 1 == temp_mx - 1) ans = (ans + pw[(k + 1) / 2]) % m;
                else ans = (ans + pw[k / 2]) % m;
            } else if (temp_mx - mn == 1) ans = (ans + pw[k / 2] + pw[(k + 1) / 2] - 1) % m;

            mn = min(mn, --curr);
        }
    }

    cout << ans;
    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