Submission #540583

#	Time	Username	Problem	Language	Result	Execution time	Memory
540583		guest	Linear Garden (IOI08_linear_garden)	C++14	75 / 100	13 ms	5076 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];
char s[N];
 void solve()
 {
     int h = 0, l = 0; ll ans = 0;
    int cur = 0;
    for (int i = 1; i <= n; ++i) {
        h = max(h, cur);
        l = min(l, cur);
        if (s[i] == 'L') ++cur;
        if (s[i] == 'P') {
            ++cur;
            if (cur - l > 2) {
              
            }
         else if (max(cur, h) - l == 2){
                if (cur == (max(cur, h) - l)/2) {
                    ans += f[(n-i+1)/2];
                    ans %= m;
                }
                else {
                    ans += f[(n-i)/2];
                    ans %= m;
                }
            }
            else {
                ans += f[(n-i)/2] + f[(n-i+1)/2] - 1;
                ans %= m;
            }
            cur -= 2;
        }
    }
 
    cout<<ans+1;
 }
 int main() {
   cin>>n>>m;
    scanf("%s", s + 1);
    f[0] = 1;
    for (int i = 1; i <= n; ++i) f[i] = (2*f[i - 1]) % m;
    solve();
 
    return 0;
}

Compilation message (stderr)

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%s", s + 1);
      |     ~~~~~^~~~~~~~~~~~~

• 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: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 0 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5