제출 #648929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648929		Spade1	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	15 ms	6284 KiB

linear_garden

#include<bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 1e6 + 10;

int t[N];

void solve() {
    int n, m; cin >> n >> m;
    string s; cin >> s;

    t[0] = 1;
    for (int i = 1; i <= n; ++i)
        t[i] = 2*t[i-1] % m;

    int ans = 0;
    int mx = 0, mn = 0, cnt = 0;
    for (int i = 1; i <= n; ++i) {
        if (s[i-1] == 'L') {
            cnt--;
            mn = min(mn, cnt);
            continue;
        }
        int nmx = mx, nmn = min(mn, cnt-1);
        if (nmx - nmn > 2) {
            cnt++;
            mx = max(mx, cnt);
            continue;
        }
        if (nmx - nmn == 2) {
            if ((cnt-2) == (nmx+nmn)/2) {
                ans += t[(n-i+1)/2];
                ans %= m;
            }
            else {
                ans += t[(n-i)/2];
                ans %= m;
            }
        }
        else {
            ans += (t[(n-i)/2] + t[(n-i+1)/2] - 1);
            ans %= m;
        }
        cnt++;
        mx = max(mx, cnt);
    }
    cout << (ans+1)%m << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

• 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