Submission #1020333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020333		aaaaaarroz	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	10 ms	10232 KiB

linear_garden

    #include <bits/stdc++.h>
     
    #define ll long long
    #define F first
    #define S second
    #define all(x) x.begin(), x.end()
    #define pb push_back
    #define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
     
    using namespace std;
     
    typedef pair <ll, ll> pii;
     
    const int N = 1e6 + 7;
     
    int n, mod;
    string s;
    ll ps[N];
     
    int main () {
    	FIO;
    	cin >> n >> mod >> s;
    	
    	ps[n] = ps[n-1] = 1;
    	for (int i = n-2; i >= 0; i--) {
    		ps[i] = 2*ps[i+2] % mod;
    	}
    	
    	ll res = 1;
    	
    	int la = 0;
    	for (int i = 0; i < n; i++) {
    		if (i > 1 && s[i-1] == s[i-2]) la = i-1;
    		if (s[i] == 'L') continue;
    		if (la && s[la] == 'L' && s[i-1] == 'L') continue;
    		if (!i) res = (res + ps[0] + ps[1] - 1 + mod) % mod;
    		else if (s[i-1] == 'L') res = (res + ps[i+1]) % mod;
    		else {
    			if (!la) res = (res + ps[i] + ps[i+1] + mod - 1) % mod;
    			else res = (res + ps[i+1]) % mod;
    		}
    	}
    	
    	cout << res;
     
    	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