#788147 (C) No.2040 010-1 Deletion

• 問題: No.2040 010-1 Deletion
• ユーザー: 👑 ygussany
• 提出日時: 2022-08-12 23:04:04
• 言語: C (gcc 13.3.0)
• 結果: AC
• 実行時間: 12 ms / 3,000 ms
• コード長: 2,362 bytes
• コンパイル時間: 340 ms
• コンパイル使用メモリ: 34,420 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-23 03:43:18
• 合計ジャッジ時間: 1,628 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 33

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <stdio.h>
const int Mod = 998244353;
int main()
{
    int N;
    char S[1501];
    scanf("%d", &N);
    scanf("%s", S);
    
    int i, j, cur, prev;
    long long _dp[2][4501] = {}, *dp[2] = {&(_dp[0][3000]), &(_dp[1][3000])};
    for (i = 0, cur = 1, prev = 0, dp[0][0] = 1; i < N; i++, cur ^= 1, prev ^= 1) {
        if (S[i] == '0') {
            for (j = -i * 2; j < 0; j += 2) {
                dp[cur][j-2] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = -i * 2 + 1; j < -1; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            dp[cur][1] += (dp[prev][-1] + dp[prev][0]) % Mod;
            dp[prev][-1] = 0;
            dp[prev][0] = 0;
            dp[cur][-2] += dp[prev][1] % Mod;
            dp[prev][1] = 0;
            for (j = 2; j <= i; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = 3; j <= i; j += 2) {
                dp[cur][j-2] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
        } else if (S[i] == '1') {
            for (j = -i * 2; j < 0; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = -i * 2 + 1; j < 0; j += 2) {
                dp[cur][j] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            dp[cur][0] += dp[prev][0] % Mod;
            dp[prev][0] = 0;
            for (j = 1; j <= i; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = 2; j <= i; j += 2) {
                dp[cur][j] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
        } else {
            for (j = -i * 2; j < 0; j += 2) dp[cur][j-2] += dp[prev][j] % Mod;
            for (j = -i * 2 + 1; j < -1; j += 2) dp[cur][j+1] += dp[prev][j] % Mod;
            dp[cur][1] += (dp[prev][-1] + dp[prev][0]) % Mod;
            dp[cur][-2] += dp[prev][1] % Mod;
            for (j = 2; j <= i; j += 2) dp[cur][j+1] += dp[prev][j] % Mod;
            for (j = 3; j <= i; j += 2) dp[cur][j-2] += dp[prev][j] % Mod;
            
            for (j = -i * 2; j < 0; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = -i * 2 + 1; j < 0; j += 2) {
                dp[cur][j] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            dp[cur][0] += dp[prev][0] % Mod;
            dp[prev][0] = 0;
            for (j = 1; j <= i; j += 2) {
                dp[cur][j+1] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
            for (j = 2; j <= i; j += 2) {
                dp[cur][j] += dp[prev][j] % Mod;
                dp[prev][j] = 0;
            }
        }
    }
    
    long long ans = 0;
    for (i = 0; i <= N; i++) if (i % 4 == 3 || i % 4 == 0) ans += dp[prev][i];
    printf("%lld\n", ans % Mod);
    fflush(stdout);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX