제출 #540590

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540590		guest	Linear Garden (IOI08_linear_garden)	C++14	0 / 100	33 ms	5336 KiB

linear_garden

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 const int N=1e6+10;
 int n,m;
int f[N];
string s;
 void solve()
 {
     int h = -1e9, l = 1e9, cnt =0 ; ll ans = 0;
    for (int j = 0; j < n; ++j) {
     int i=j+1;
        h = max(h, cnt);
        l = min(l, cnt);
        if (s[i] == 'L') ++cnt;
        if (s[i] == 'P') {
            ++cnt;
            if (cnt - l > 2) {
              cnt-=2;
               continue;
            }
          if (max(cnt, h) - l == 2){
                 {
                    ans += f[(n-i)/2];
                    ans %= m;
                }
            }
            else {
                ans += f[(n-i)/2] + f[(n-i+1)/2] - 1;
                ans %= m;
            }
            cnt -= 2;
        }
    }
 
    cout<<ans+1;
 }
 int main() {
   cin>>n>>m;
    cin>>s;
    f[0] = 1;
    for (int i = 1; i <= n; ++i) f[i] = (2*f[i - 1]) % m;
    solve();
 
    return 0;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5