Submission #396204

#	Time	Username	Problem	Language	Result	Execution time	Memory
396204		MarcoMeijer	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	71 ms	36576 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e6+10;
const int N = (1<<20);

int n, m;
string s;
int dp[MX][3][3];

int getDP(int x, int tot, int minTot, int maxTot) {
    int res = 0;
    minTot = min(minTot, tot);
    maxTot = max(maxTot, tot);
    RE(i,3) RE(j,3) {
        if(max(i+tot, maxTot) + max(j-tot, -minTot) > 2) continue;
        res += dp[x][i][j];
    }
    return res%m;
}

void program() {
    IN(n,m,s);

    dp[0][0][0] = 1;
    RE(i,n+1) RE(j,3) RE(k,3) {
        dp[i][j][k] %= m;
        if(j + k > 2) dp[i][j][k] = 0;
        
        if(j != 2) dp[i+1][j+1][max(0,k-1)] += dp[i][j][k];
        if(k != 2) dp[i+1][max(0,j-1)][k+1] += dp[i][j][k];
    }

    int ans=0, tot=0, minTot=0, maxTot=0;
    RE(i,n) {
        if(s[i] == 'P')
            ans = (ans + getDP(n-i-1,tot+1,minTot,maxTot))%m;
        tot += (s[i] == 'P' ? -1 : 1);
        minTot = min(minTot, tot);
        maxTot = max(maxTot, tot);
    }
    OUTL((ans+1)%m);
}

• 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