oj.uz

Submission #467581

# Submission time Handle Problem Language Result Execution time Memory
467581 2021-08-23T18:11:35 Z couplefire Ljetopica (COI19_ljetopica) C++17
100 / 100
 227 ms 63180 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1005;
const int MOD = 1000000007;

inline int add(int a, int b){return (a+b>=MOD)?a+b-MOD:a+b;}
inline void inc(int& a, int b){a = add(a, b);}
inline int sub(int a, int b){return (a-b<0)?a-b+MOD:a-b;}
inline void dec(int &a, int b){a = sub(a, b);}
inline int mul(int a, int b){return 1ll*a*b%MOD;}
inline void grow(int &a, int b){a = mul(a, b);}

int n, k, dp1[N][N][2][2][2], dp2[N][N][2][2][2], ans;
int moves[N], lo[N], hi[N]; string _str;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k >> _str;
    for(int i = 0; i<n-1; ++i)
        moves[i] = _str[i]=='L'?0:1;
    cin >> _str;
    for(int i = 0; i<n; ++i)
        lo[i] = _str[i]-'0';
    cin >> _str;
    for(int i = 0; i<n; ++i)
        hi[i] = _str[i]-'0';
    dp1[0][0][1][1][0] = dp1[0][0][1][1][1] = dp2[0][0][1][1][0] = dp2[0][0][1][1][1] = 1;
    for(int i = 0; i<n-1; ++i)
        for(int j = 0; j<=k; ++j)
            for(int a = 0; a<2; ++a)
                for(int b = 0; b<2; ++b)
                    for(int f = 0; f<2; ++f){
                        int nxt = moves[i]^f;
                        int v1 = dp1[i][j][a][b][f];
                        int v2 = dp2[i][j][a][b][f];
                        if((!a || (nxt>=lo[i+1])) && (!b || (nxt<=hi[i+1])))
                            inc(dp1[i+1][j][a && nxt==lo[i+1]][b && nxt==hi[i+1]][f], add(mul(v1, 2), mul(nxt==1, v2))),
                            inc(dp2[i+1][j][a && nxt==lo[i+1]][b && nxt==hi[i+1]][f], v2);
                        if(j==k) continue;
                        nxt ^= 1;
                        if((!a || (nxt>=lo[i+1])) && (!b || (nxt<=hi[i+1])))
                            inc(dp1[i+1][j+1][a && nxt==lo[i+1]][b && nxt==hi[i+1]][f^1], add(mul(v1, 2), mul(nxt==1, v2))),
                            inc(dp2[i+1][j+1][a && nxt==lo[i+1]][b && nxt==hi[i+1]][f^1], v2);
                    }
    for(int a = 0; a<2; ++a)
        for(int b = 0; b<2; ++b)
            for(int c = 0; c<2; ++c)
                inc(ans, dp1[n-1][k][a][b][c]);
    cout << ans << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8396 KB Output is correct
2 Correct 6 ms 8012 KB Output is correct
3 Correct 5 ms 7628 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 6 ms 6720 KB Output is correct
6 Correct 6 ms 6348 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 4 ms 5580 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 44156 KB Output is correct
2 Correct 102 ms 33088 KB Output is correct
3 Correct 117 ms 36840 KB Output is correct
4 Correct 227 ms 63180 KB Output is correct
5 Correct 103 ms 31576 KB Output is correct
6 Correct 192 ms 63152 KB Output is correct
7 Correct 63 ms 22524 KB Output is correct
8 Correct 120 ms 36128 KB Output is correct
9 Correct 10 ms 9548 KB Output is correct
10 Correct 100 ms 33596 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8396 KB Output is correct
2 Correct 6 ms 8012 KB Output is correct
3 Correct 5 ms 7628 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 6 ms 6720 KB Output is correct
6 Correct 6 ms 6348 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 4 ms 5580 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 148 ms 44156 KB Output is correct
25 Correct 102 ms 33088 KB Output is correct
26 Correct 117 ms 36840 KB Output is correct
27 Correct 227 ms 63180 KB Output is correct
28 Correct 103 ms 31576 KB Output is correct
29 Correct 192 ms 63152 KB Output is correct
30 Correct 63 ms 22524 KB Output is correct
31 Correct 120 ms 36128 KB Output is correct
32 Correct 10 ms 9548 KB Output is correct
33 Correct 100 ms 33596 KB Output is correct
34 Correct 160 ms 52504 KB Output is correct
35 Correct 54 ms 22852 KB Output is correct
36 Correct 86 ms 32912 KB Output is correct
37 Correct 181 ms 60084 KB Output is correct
38 Correct 28 ms 14800 KB Output is correct
39 Correct 167 ms 56872 KB Output is correct
40 Correct 30 ms 13636 KB Output is correct
41 Correct 105 ms 40288 KB Output is correct
42 Correct 147 ms 49732 KB Output is correct
43 Correct 139 ms 49468 KB Output is correct
44 Correct 172 ms 56500 KB Output is correct
45 Correct 49 ms 21572 KB Output is correct
46 Correct 129 ms 45872 KB Output is correct
47 Correct 132 ms 48140 KB Output is correct
48 Correct 78 ms 30736 KB Output is correct
49 Correct 10 ms 9152 KB Output is correct
50 Correct 150 ms 54768 KB Output is correct
51 Correct 86 ms 28804 KB Output is correct
52 Correct 75 ms 30428 KB Output is correct
53 Correct 188 ms 63176 KB Output is correct
54 Correct 53 ms 23344 KB Output is correct
55 Correct 150 ms 53580 KB Output is correct
56 Correct 171 ms 60052 KB Output is correct
57 Correct 22 ms 13516 KB Output is correct
58 Correct 135 ms 48380 KB Output is correct