QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#749002#9536. Athlete Welcome CeremonyyouyouyouWA 96ms437960kbC++204.1kb2024-11-14 22:19:542024-11-14 22:19:55

Judging History

This is the latest submission verdict.

  • [2024-11-14 22:19:55]
  • Judged
  • Verdict: WA
  • Time: 96ms
  • Memory: 437960kb
Show
  • [2024-11-14 22:19:54]
  • Submitted

answer

#include <bits/stdc++.h>

using namespace std;
using i64 = long long;
i64 dp[305][305][305][3];
i64 prefix[305][305][305] = {0};
// i64 p = 1e9 + 7;

void solve() {
    char c[305] = {0};
    i64 n, m;
    cin >> n >> m;
    for (i64 i = 1; i <= n; i++) {
        cin >> c[i];
    }
    
    i64 qianzhuihe[305] = {0};
    for (i64 i = 1; i <= n; i++) {
        if (c[i] == '?')
            qianzhuihe[i] = qianzhuihe[i - 1] + 1;
        else 
            qianzhuihe[i] = qianzhuihe[i - 1];
    }
    
    if (c[1] == 'a') {
        dp[1][0][0][0] = 1;
    }
    if (c[1] == 'b') {
        dp[1][0][0][1] = 1;
    }
    if (c[1] == 'c') {
        dp[1][0][0][2] = 1;
    }
    if (c[1] == '?') {
        if (c[2] == '?') {
            dp[1][1][0][0] = 1;
            dp[1][0][1][1] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'a') {
            dp[1][0][1][1] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'b') {
            dp[1][1][0][0] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'c') {
            dp[1][1][0][0] = 1;
            dp[1][0][1][1] = 1;
        }
        if(n==1){
            i64 num=0;
            i64 a,b,c;
            cin>>a>>b>>c;
            if(a)num++;
            if(b)num++;
            if(c)num++;
            cout<<num<<"\n";
            return;
        }
    }
    
    for (i64 i = 2; i <= n; i++) {
        for (i64 j = 0; j <= qianzhuihe[i]; j++) {
            for (i64 k = 0; k+j <= qianzhuihe[i]; k++) {
                if (c[i] == 'a') {
                    dp[i][j][k][0] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][2]) ;
                    continue;
                }
                if (c[i] == 'b') {
                    dp[i][j][k][1] = (dp[i - 1][j][k][0] + dp[i - 1][j][k][2]) ;
                    continue;
                }
                if (c[i] == 'c') {
                    dp[i][j][k][2] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][0]) ;
                    continue;
                }
                if (c[i - 1] == 'a' || c[i + 1] == 'a')
                    dp[i][j][k][0] = 0;
                else if (j > 0)
                    dp[i][j][k][0] = (dp[i - 1][j - 1][k][1] + dp[i - 1][j - 1][k][2]) ;
                
                if (c[i - 1] == 'b' || c[i + 1] == 'b')
                    dp[i][j][k][1] = 0;
                else if (k > 0)
                    dp[i][j][k][1] = (dp[i - 1][j][k - 1][0] + dp[i - 1][j][k - 1][2]) ;
                
                if (c[i - 1] == 'c' || c[i + 1] == 'c')
                    dp[i][j][k][2] = 0;
                else if (j + k < qianzhuihe[i])
                    dp[i][j][k][2] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][0]) ;
            }
        }
    }
    
    for (int i = 0; i <= 300; ++i) {
        for (int j = 0; j <= 300; ++j) {
            for (int k = 0; k <= 300; ++k) {
                if (i + j + k == qianzhuihe[n]) {
                    prefix[i][j][k] = dp[n][i][j][0] + dp[n][i][j][1] + dp[n][i][j][2];
                } else {
                    prefix[i][j][k] = 0;
                }
                if (i > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i - 1][j][k]);
                if (j > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i][j - 1][k]) ;
                if (k > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i][j][k - 1]) ;
                if (i > 0 && j > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i - 1][j - 1][k] ) ;
                if (i > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i - 1][j][k - 1] );
                if (j > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i][j - 1][k - 1] );
                if (i > 0 && j > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i - 1][j - 1][k - 1]) ;
            }
        }
    }
    
    while (m--) {
        i64 a, b, c;
        cin >> a >> b >> c;
        cout << prefix[a][b][c]%1000000007 << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    i64 T = 1;
    // cin >> T;
    while (T--)
        solve();

    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 79ms
memory: 235516kb

input:

6 3
a?b??c
2 2 2
1 1 1
1 0 2

output:

3
1
1

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 63ms
memory: 234688kb

input:

6 3
??????
2 2 2
2 3 3
3 3 3

output:

30
72
96

result:

ok 3 lines

Test #3:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

1 1
?
0 1 1

output:

2

result:

ok single line: '2'

Test #4:

score: 0
Accepted
time: 71ms
memory: 243124kb

input:

10 10
acab?cbaca
0 2 0
1 1 2
4 2 3
1 1 1
3 5 1
0 5 2
2 2 0
1 2 5
4 3 0
1 1 3

output:

0
1
1
1
1
0
1
1
1
1

result:

ok 10 lines

Test #5:

score: 0
Accepted
time: 96ms
memory: 243620kb

input:

10 10
?c?c?cbac?
10 5 1
5 8 7
9 2 6
5 7 1
5 2 6
5 6 5
5 10 3
9 1 10
2 5 9
1 2 9

output:

16
16
11
16
11
16
16
5
11
0

result:

ok 10 lines

Test #6:

score: 0
Accepted
time: 72ms
memory: 324092kb

input:

50 100
?abacbacab?cbcbcb?acabcbabcbcacbababc?caba?acacbca
8 3 8
2 4 8
8 7 3
0 9 2
10 8 7
7 6 5
4 10 2
6 9 3
3 6 6
9 10 8
2 5 8
8 1 0
3 5 0
1 0 6
5 0 8
6 5 5
1 7 9
7 7 10
4 7 5
6 6 4
10 1 2
4 1 7
10 0 8
7 6 3
1 9 1
4 7 2
8 4 0
8 6 1
5 10 4
5 8 2
5 8 4
4 5 9
5 2 1
1 10 9
4 10 1
8 4 3
8 9 9
8 0 1
0 8 0...

output:

8
8
8
0
8
8
6
8
8
8
8
0
0
0
1
8
4
8
8
8
2
4
1
8
1
6
0
2
8
6
8
8
1
4
2
8
8
0
0
8
2
0
8
8
8
4
8
8
8
8
2
0
0
4
8
8
1
8
7
6
7
0
8
8
8
0
4
7
8
4
0
8
0
4
8
8
8
7
8
4
7
2
8
8
8
0
2
2
8
8
8
4
4
0
8
0
8
8
1
1

result:

ok 100 lines

Test #7:

score: 0
Accepted
time: 79ms
memory: 330088kb

input:

50 100
b????????bca?????c?b??ca?acac?b?b???ca?ab???a?a???
35 43 36
12 49 47
7 11 34
38 44 22
42 17 10
49 8 38
18 26 44
6 18 14
28 29 6
48 32 47
29 15 48
1 5 33
24 17 18
10 27 32
19 10 34
2 23 9
14 24 39
46 12 34
9 49 26
21 8 46
43 43 3
31 16 2
8 27 7
24 41 35
17 25 31
0 13 47
24 31 23
33 40 30
36 39...

output:

34272000
31599360
497244
34272000
17637520
12290752
34272000
93044
415832
34272000
34272000
0
34272000
16360704
27933952
0
34272000
33886976
7896832
12290752
718
24
0
34272000
34272000
0
34272000
34272000
34272000
32254720
0
5666944
34256640
34272000
34272000
12290752
30493248
34256640
20630016
0
10...

result:

ok 100 lines

Test #8:

score: 0
Accepted
time: 68ms
memory: 425800kb

input:

100 1000
c?cbababcabacbacbacacbacabcbabababacababcbcab?cbabacbacbcbcacbab?bcabcbcababcacbabacbcb?babcbab?baca
13 11 4
4 17 20
14 5 2
16 14 15
8 12 17
19 5 11
5 17 12
20 7 6
19 10 1
6 5 0
13 1 9
7 17 1
20 4 16
11 12 18
19 2 16
18 1 11
19 16 3
7 1 0
6 9 16
6 9 16
6 20 7
0 16 20
1 2 8
16 5 20
18 14 18
...

output:

16
15
14
16
16
16
16
16
8
2
16
8
16
16
16
16
16
2
16
16
16
0
1
16
16
5
1
5
16
16
16
16
16
15
16
13
16
15
2
16
16
1
8
16
16
16
15
0
16
15
16
16
16
16
8
8
16
16
16
16
16
16
8
16
16
1
8
8
16
16
1
16
1
0
16
2
2
16
7
16
16
8
16
16
16
16
1
16
14
16
16
16
16
5
16
16
14
16
11
16
15
11
2
1
8
16
16
7
16
5
16
...

result:

ok 1000 lines

Test #9:

score: -100
Wrong Answer
time: 75ms
memory: 437960kb

input:

100 1000
?????c??????????????????????????b???a????a?????????????????????????c????????????????????????????????
43 38 20
27 40 32
39 27 33
28 50 43
50 3 46
38 46 14
42 48 10
45 25 28
49 10 49
38 17 42
41 49 22
41 18 44
46 47 25
17 44 35
34 43 22
47 42 32
32 44 40
36 41 24
45 38 45
49 44 18
42 34 32
43...

output:

965247998
276779831
-188174560
684432522
10104
219100551
479284703
162688614
903846231
-898905561
651381538
-614328943
978288057
271082686
-421282142
93550713
-696962031
-334451826
648439172
885996584
-893684782
-521906098
-232983940
794495220
58511312
731724717
-84135512
-442127141
-286941734
-7937...

result:

wrong answer 1st lines differ - expected: '490475656', found: '965247998'
English 繁體中文 简体中文

Server Time: 2025-02-06 22:22:07 | OpenSource Project