Xieldy And His Password 牛客 DP

Xieldy And His Password

solution

$$dp[i][j]表示第i位为止有多少\%3=j的方案数$$
$记前一个状态为tem{p}_{i-1},$
$$s[i]==1时，tem{p}_i=(tem{p}_{i-1}\ast 2+1)\%3$$$$dp[i][0]=dp[i-1][1]$$$$dp[i][1]=dp[i-1][0]+1$$$$dp[i][2]=dp[i-1][2]$$

$$s[i]==0时，tem{p}_i=tem{p}_{i-1}\ast 2\%3$$$$dp[i][0]=dp[i-1][0]+1$$$$dp[i][1]=dp[i-1][2]+1$$$$dp[i][2]=dp[i-1][1]$$

$统计\sum _{i=1}^{len}dp[i][0]的个数即可.$

code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[int(1e6 + 10)][3];
int main() {
    string s; while(cin >> s) {
        int len = s.size(); s = " " + s;
        memset(dp, 0, sizeof dp);
        for(int i = 1; i <= len; ++ i) {
            if(s[i] == '1') {
                dp[i][0] += dp[i - 1][1];
                dp[i][1] += dp[i - 1][0] + 1;
                dp[i][2] += dp[i - 1][2];
            } else {
                dp[i][0] += dp[i - 1][0] + 1;
                dp[i][1] += dp[i - 1][2];
                dp[i][2] += dp[i - 1][1];
            }
        }
        ll res = 0; for(int i = 1; i <= len; ++ i) res += dp[i][0];
        cout << res << '\n';
    }
    return 0;
}