제출 #834890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834890		Magikarp4000	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	13 ms	10224 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 1e6+5;
int n,MOD;
string s;
int p[MAXN];

signed main() {
    OPTM;
    cin >> n >> MOD >> s;
    p[0] = 1LL;
    FOR(i,1,n+1) p[i] = (p[i-1]*2LL)%MOD;
    int lb = 0, ub = 0, cur = 0, res = 1LL;
    FOR(i,0,n) {
        if (s[i] == 'L') {
            cur++;
            ub = max(ub,cur);
        }
        else {
            int tcur = cur+1;
            int tub = max(ub,tcur);
            int rem = n-i-1;
            if (tub-lb == 1) res = (res+p[(rem+1)/2]+p[rem/2]-1LL+MOD)%MOD;
            else if (tub-lb == 2) {
                if (tcur == (tub+lb)/2) res = (res+p[(rem+1)/2])%MOD;
                else res = (res+p[rem/2])%MOD;
            }
            cur--;
            lb = min(lb,cur);
        }
    }
    cout << res;
}

• 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