Submission #1036575

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036575		VMaksimoski008	Linear Garden (IOI08_linear_garden)	C++17	55 / 100	28 ms	31044 KiB

linear_garden

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int LOG = 20;
const int maxn = 1e5 + 5;

ll n, mod, ans = 0;
vector<ll> vec;
string s;

//neka L = -1 i P = 1
//togas abs(pref[i] - pref[j-1]) <= 2 za site i, j
//ako celo vreme cuvame min pref suma i max pref suma, treba abs(max - min) <= 2
//drugite 2 dimenzii se under i started

ll dp[10005][5][5][5][2];

ll f(int pos, int mn, int mx, int curr, int under) {
    if(mx - mn > 2) return 0;
    if(mx > 4 || mn < 0) return 0;
    if(pos == n + 1) return under;
    // cerr << pos << " " << mn << " " << mx << " " << curr << " " << under << '\n';
    if(dp[pos][mn][mx][curr][under] != -1) return dp[pos][mn][mx][curr][under];

    ll ans = 0;

    //try putting -1
    for(int i=-1; i<=1; i++) {
        if(i == 0) continue;
        if(!under && i > vec[pos]) continue;
        int nmn = min(mn, curr + i);
        int nmx = max(mx, curr + i);
        int nu = under | (i < vec[pos]);
        ans = (ans + f(pos+1, nmn, nmx, curr + i, nu)) % mod;
    }

    return dp[pos][mn][mx][curr][under] = ans;
}

signed main() {
    memset(dp, -1, sizeof(dp));
    cin >> n >> mod >> s;
    vec.push_back(0);

    for(int i=0; i<n; i++) {
        if(s[i] == 'L') vec.push_back(-1);
        else vec.push_back(1);
    }

    ll ans = f(1, 2, 2, 2, 0);
    cout << (ans + 1) % mod << '\n';
    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: 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