QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#737695#9536. Athlete Welcome CeremonyguanghereWA 12ms104028kbC++233.2kb2024-11-12 16:38:082024-11-12 16:38:09

Judging History

This is the latest submission verdict.

  • [2024-11-12 16:38:09]
  • Judged
  • Verdict: WA
  • Time: 12ms
  • Memory: 104028kb
Show
  • [2024-11-12 16:38:08]
  • Submitted

answer

//
// Created by 24087 on 24-11-12.
//
#include <iostream>
#include <string>

#define int long long

constexpr int mod = 1e9 + 7;

int dp[305][305][305][3] = {0};  // i, a, b, color
int sum[305][305][305] = {0};

signed main() {
    int n, q;
    std::cin >> n >> q;
    std::string str;
    std::cin >> str;

    int num_a = 0, num_b = 0, num_c = 0;
    for (char ch : str) {
        if (ch == 'a') {
            num_a++;
        } else if (ch == 'b') {
            num_b++;
        } else if (ch == 'c') {
            num_c++;
        }
    }

    if (str[0] == '?' || str[0] == 'a') {
        dp[1][1][0][0] = 1;
    }
    if (str[0] == '?' || str[0] == 'b') {
        dp[1][0][1][1] = 1;
    }
    if (str[0] == '?' || str[0] == 'c') {
        dp[1][0][0][2] = 1;
    }

    for (int i = 2; i <= n; i++) {
        for (int a = 0; a <= i; a++) {
            for (int b = 0; a + b <= i; b++) {
                int c = i - a - b;
                if (a > 0 && (str[i - 1] == '?' || str[i - 1] == 'a')) {
                    dp[i][a][b][0] = static_cast<int>(1ll * dp[i][a][b][0] +
                                                      dp[i - 1][a - 1][b][1] +
                                                      dp[i - 1][a - 1][b][2]) %
                                     mod;
                }
                if (b > 0 && (str[i - 1] == '?' || str[i - 1] == 'b')) {
                    dp[i][a][b][1] = static_cast<int>(1ll * dp[i][a][b][1] +
                                                      dp[i - 1][a][b - 1][0] +
                                                      dp[i - 1][a][b - 1][2]) %
                                     mod;
                }
                if (c > 0 && (str[i - 1] == '?' || str[i - 1] == 'c')) {
                    dp[i][a][b][2] = static_cast<int>(1ll * dp[i][a][b][2] +
                                                      dp[i - 1][a][b][0] +
                                                      dp[i - 1][a][b][1]) %
                                     mod;
                }
            }
        }
    }

    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= n + 1; j++) {
            int k = n + 3 - i - j;
            sum[i][j][k] += static_cast<int>(1ll * dp[n][i - 1][j - 1][0] +
                                             dp[n][i - 1][j - 1][1] +
                                             dp[n][i - 1][j - 1][2]);
        }
    }

    for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= n + 1; j++) {
            for (int k = 1; k <= n + 1; k++) {
                sum[i][j][k] +=
                    static_cast<int>(1ll * sum[i - 1][j][k] + sum[i][j - 1][k] +
                                     sum[i][j][k - 1] - sum[i - 1][j - 1][k] -
                                     sum[i - 1][j][k - 1] -
                                     sum[i][j - 1][k - 1] +
                                     sum[i - 1][j - 1][k - 1]) %
                    mod;
            }
        }
    }

    for (int i = 0; i < q; i++) {
        int a, b, c;
        std::cin >> a >> b >> c;
        std::cout << sum[std::min(a + num_a, n) + 1][std::min(b + num_b, n) + 1]
                        [std::min(c + num_c, n) + 1]
                  << '\n';
    }
}
源文件, 语言: C++23

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 9792kb

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: 1ms
memory: 9864kb

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: 1ms
memory: 7708kb

input:

1 1
?
0 1 1

output:

2

result:

ok single line: '2'

Test #4:

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

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: 2ms
memory: 14000kb

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: 3ms
memory: 48444kb

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: 0ms
memory: 48536kb

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: 8ms
memory: 103500kb

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: 12ms
memory: 104028kb

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:

490475656
143989836
119661929
-292135540
10104
219100551
479284703
-235781478
-96153776
-340305459
204287063
-894079505
191779504
182802705
215438611
938692318
-202418803
-96082587
893995828
287222624
-421304178
95654849
457810426
709349795
-914038163
923330494
783007506
-888880289
295402274
-758405...

result:

wrong answer 4th lines differ - expected: '707864467', found: '-292135540'
English 繁體中文 简体中文

服务器时间: 2025-02-07 02:06:35 | 开源项目