제출 #819789

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
819789		canadavid1	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	121 ms	45312 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x),end(x)

vector<array<int,9>> dp; // 5*diff + min + 2
vector<array<bool,9>> s;
int N,M;

int num_combinations(int off,int mins, int maxs)
{
    if(maxs > 2 || mins < -2) return 0;
    if(off >= N) return 1;
    mins = min(mins,0);
    maxs = max(maxs,0);
    if(s[off][maxs-3*mins]) return dp[off][maxs-3*mins];
    // try L
    int comb = 0;
    comb += num_combinations(off+1,mins-1,maxs-1);
    comb += num_combinations(off+1,mins+1,maxs+1);
    comb %= M;
    dp[off][maxs-3*mins] = comb;
    s[off][maxs-3*mins] = true;
    return comb;
}


signed main()
{
    cin >> N >> M;
    dp.assign(N,array<int,9>{});
    s.assign(N,array<bool,9>{});
    int off = 1;
    int mins = 0;
    int maxs = 0;
    for(int i = dp.size()-1; i >= 0; i--)
    {
        for(int mins = -2; mins <= 0; mins++)
        {
            for(int maxs = 0; maxs < 3; maxs++)
            {
                int64_t comb = 0;
                comb += num_combinations(i+1,mins-1,maxs-1);
                comb += num_combinations(i+1,mins+1,maxs+1);
                if(comb >= M) comb -= M;
                dp[i][maxs-3*mins] = comb;
                s[i][maxs-3*mins] = true;
            }
        }
    }
    for(int i = 0; i < N; i++)
    {
        char c;
        cin >> c;
        if(c=='P') off += num_combinations(i+1,mins-1,maxs-1);
        if(c=='P') {mins++;maxs++;}
        else {mins--;maxs--;}
        mins = min(mins,0);
        maxs = max(maxs,0);
        if(off>=M) off -= M;
    }
    cout << off << "\n";
}

• 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