제출 #432683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432683		zxcvbnm	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	16 ms	6248 KiB

linear_garden

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, mod;
    cin >> n >> mod;
    int p[n];
    p[0] = 1;
    for(int i = 1; i < n; i++) {
        p[i] = p[i-1] * 2;
        p[i] %= mod;
    }

    string str;
    cin >> str;
    int low = 0, high = 0, curr = 0, ans = 1;
    for(int i = 0; i < n; i++) {
        if (str[i] == 'P') {
            int curr_2 = curr-1;
            int low_2 = min(low, curr_2);
            int high_2 = high;
            curr++;
            if (high_2 - low_2 > 2) continue;
            else if (high_2 - low_2 == 2) {
                if (curr_2 != high_2 && curr_2 != low_2) {
                    ans += p[(n-i)/2];
                    ans %= mod;
                } else {
                    ans += p[(n-i-1)/2];
                    ans %= mod;
                }
            } else if (high_2 - low_2 == 1) {
                ans += p[(n-i)/2] + p[(n-i-1)/2] - 1;
                ans %= mod;
                if (ans < 0) {
                    ans += mod;
                }
            }
        } else {
            curr--;
        }
        low = min(low, curr);
        high = max(high, curr);
//        cout << ans << " " << low << " " << high << "\n";
    }
    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: 5 / 5