QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#718671#9536. Athlete Welcome CeremonypaoxiaomoTL 926ms25168kbC++234.3kb2024-11-06 21:07:342024-11-06 21:07:39

Judging History

This is the latest submission verdict.

  • [2024-11-06 21:07:39]
  • Judged
  • Verdict: TL
  • Time: 926ms
  • Memory: 25168kb
Show
  • [2024-11-06 21:07:34]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
// #define max(a, b) ((a) > (b) ? (a) : (b))
// #define min(a, b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define LNF 1e18
#define INF 0x7fffffff
//#define int long long
#define lowbit(x) ((x) & (-x))
#define abs(x) llabs(x)
#define endl '\n'
#define Y() cout << "Yes" << endl
#define N() cout << "No" << endl
const db eps = 1e-9;
const int mod =1e9+7;
const int MAXN = 2e5 + 5;
int dp[3][305][305][305],nu[305],cnt=0,af[305];
void solve()
{
    int n,m;cin>>n>>m;
    string s;cin>>s;
    for(int i=0;i<n;i++){
        if(s[i]=='?'){
            if(i==0)
                nu[++cnt]=-2;//前面没有
            else if(s[i-1]=='?')
                nu[++cnt]=-1;//前面按照dp数组的来
            else nu[++cnt]=s[i-1]-'a';//前面固定
            if(i!=n-1){
                if(s[i+1]!='?'){
                    af[cnt]=s[i+1]-'a';
                }else af[cnt]=-1;
            }else af[cnt]=-1;
                      
        }
    }
    for(int i=0;i<3;i++)dp[i][0][0][0]=1;
    for(int i=0;i<=300;i++){
        for(int j=0;j<=300;j++){
            for(int k=0;k<=300;k++){
                int po=i+j+k;
                if(po>cnt)break;
                if(po==0){
                  continue;
                }else if(po==1){//不可能有-1
                    if(nu[po]==-2){
                        if(i&&af[po]!=0)
                            dp[0][i][j][k]=(dp[0][i][j][k]+1)%mod;
                        if(j&&af[po]!=1)
                            dp[1][i][j][k]=(dp[1][i][j][k]+1)%mod;
                        if(k&&af[po]!=2)
                            dp[2][i][j][k]=(dp[2][i][j][k]+1)%mod;
                        
                    }else{
                        if(i&&nu[po]!=0&&af[po]!=0)
                            dp[0][i][j][k]=(dp[0][i][j][k]+1)%mod;
                        if(j&&nu[po]!=1&&af[po]!=1)
                            dp[1][i][j][k]=(dp[1][i][j][k]+1)%mod;
                        if(k&&nu[po]!=2&&af[po]!=2)
                            dp[2][i][j][k]=(dp[2][i][j][k]+1)%mod;
                    }
                }else{
                    if(nu[po]==-1){
                       
                        for(int f=0;f<3;f++){
    
                            if(i&&f!=0&&af[po]!=0)
                                dp[0][i][j][k]=(dp[0][i][j][k]+dp[f][i-1][j][k])%mod;
                            if(j&&f!=1&&af[po]!=1)
                                dp[1][i][j][k]=(dp[1][i][j][k]+dp[f][i][j-1][k])%mod;
                            if(k&&f!=2&&af[po]!=2)
                                dp[2][i][j][k]=(dp[2][i][j][k]+dp[f][i][j][k-1])%mod;
                        }
                        
                    }else{
                        for(int f=0;f<3;f++){
    
                            if(i&&nu[po]!=0&&af[po]!=0)
                                dp[0][i][j][k]=(dp[0][i][j][k]+dp[f][i-1][j][k])%mod;
                            if(j&&nu[po]!=1&&af[po]!=1)
                                dp[1][i][j][k]=(dp[1][i][j][k]+dp[f][i][j-1][k])%mod;
                            if(k&&nu[po]!=2&&af[po]!=2)
                                dp[2][i][j][k]=(dp[2][i][j][k]+dp[f][i][j][k-1])%mod;
                        }
                    }
                }
                
            }
        }
    }
    vector<tuple<int,int,int>>v;
    for(int i=0;i<=300;i++){
        for(int j=0;j<=300;j++){
            for(int k=0;k<=300;k++){
                int po=i+j+k;
                if(po==cnt)v.push_back({i,j,k});
                if(po<=cnt){
                    for(int t=1;t>=0;t--){
                     dp[t][i][j][k]=(dp[t][i][j][k]+dp[t+1][i][j][k])%mod;
                    }
                }else break;
            }
        }
    }
    while(m--){
        int aa,bb,cc;cin>>aa>>bb>>cc;
        int ans=0;
   
        for(auto &[x,y,z]:v){
            if(aa>=x&&bb>=y&&cc>=z){
                ans=(ans+dp[0][x][y][z])%mod;
            }
        }cout<<ans<<endl;
    }
    //cout<<dp[0][2][2][2]<<endl;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cout << fixed << setprecision(15);
    // cin >> T;
    while (T--)
        solve();
    return 0;
}
Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 7672kb

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

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: 7696kb

input:

1 1
?
0 1 1

output:

2

result:

ok single line: '2'

Test #4:

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

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

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

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

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

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: 0
Accepted
time: 3ms
memory: 25168kb

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
707864467
10104
219100551
479284703
764218529
903846231
659694548
204287063
105920502
191779504
182802705
215438611
938692318
797581204
903917420
893995828
287222624
578695829
95654849
457810426
709349795
85961844
923330494
783007506
111119718
295402274
241594071
551680...

result:

ok 1000 lines

Test #10:

score: 0
Accepted
time: 4ms
memory: 9660kb

input:

100 1000
c???cacacbcab?cb?acb???ac?bab?bcbcbc?c?bcbcaba??b?ba?c?aca?a?bac?cbcbcba??ca?b????ac?baba?ab?cba?c?c
99 70 32
52 98 84
12 78 77
84 8 87
16 36 0
48 70 100
25 4 15
95 54 35
33 35 90
20 4 69
6 11 76
27 96 48
16 24 18
99 48 1
43 54 35
9 81 75
27 58 52
50 94 14
29 67 27
59 68 53
42 31 46
12 90 2...

output:

380160
380160
226896
64156
0
380160
92
380160
380160
92
0
380160
379648
0
380160
22500
380160
380160
380160
380160
380160
226896
380160
380160
226896
0
380160
380160
380160
380160
152672
380160
5624
226896
380160
380160
379648
0
380160
380160
366848
380160
226896
380160
92
374912
5624
380160
380160
...

result:

ok 1000 lines

Test #11:

score: 0
Accepted
time: 14ms
memory: 7972kb

input:

300 100000
abcacacbabacbcababcacacb?babacbcbacbcababcbcbabcacbcbacacabacacacbacbcbcacbabacbcbcbabcacbababcabcabcabababacbcacbacabcbacbacacacbababababacbcababcbcacacbcbabacabcabababcabacbcbcbabcabacbabacacbcbcacacacbcabcbabcbcabababababcacabcabababcbcbcbcbcabacbabacbabcacbcababacacbcbababababcacacaba...

output:

1
2
2
2
2
1
2
2
2
2
1
1
2
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
2
1
1
2
2
2
1
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
0
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
1
2
2
1
2
2
2
2
1
2
2
1
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
2
2
1
2
2
2
2
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 100000 lines

Test #12:

score: 0
Accepted
time: 20ms
memory: 7748kb

input:

300 100000
bcacbacacabacacbacacbabcabcacabcabcbcaba?cacbabcbacbabcbacacabacabcbacabcacacbcbabcbcabcabacbacbacabacabababcbcbcbabcbacbacabcacacabacbcbababcbcabacbabcbabacabcbabcbababababcbcbabacbacacbcabcabcbcbcbcabacabacacacbcbacabacbabca?acacbcacacbcbabacbcbcabca?babcacbc?acbacabacbcbcbcbacabababacb...

output:

4
4
4
4
0
4
4
4
4
4
4
4
4
4
0
1
3
3
4
4
4
1
4
0
4
0
4
4
4
4
4
4
4
0
4
1
1
4
4
0
4
3
4
4
4
4
4
4
4
3
4
1
1
3
4
0
4
4
3
4
4
4
4
4
4
4
4
4
4
0
4
4
4
3
4
3
4
4
4
1
4
3
0
4
4
4
4
4
0
4
0
4
4
4
4
1
4
4
4
4
4
0
1
4
4
1
4
0
4
3
4
0
4
3
1
0
4
4
1
1
4
4
4
3
4
4
4
3
0
4
1
4
4
4
0
4
4
4
4
1
0
4
1
0
4
4
4
4
4
4
...

result:

ok 100000 lines

Test #13:

score: 0
Accepted
time: 108ms
memory: 9008kb

input:

300 100000
bcbabcab?bab??acacbcabacbacbcacacbabcab?bcbcb?bababcabcabcabca?abcbc?bcacacb?abababcbcbcbcbaba?cba?abcabc?ababacbcbc?acbabcacacbabcab?ca?b?babcbacbacbcbcbacbc?c?cababcacbc?bcbcabcacbabc?acbabcbacac?cbcb?abcbabacabcbacabcacababcbabcbcb??bacbcbacabc?cabacac?cab?cabacacbcacacbabacacabcab?bac...

output:

20336
14528
22504
24576
24576
16992
24576
24576
24576
0
24576
1500
24576
24576
24576
0
23592
7808
24576
0
24576
23592
24576
24576
0
640
24576
2576
24392
24576
624
24576
24576
0
8
24448
8
24576
104
0
24576
24576
24392
0
0
24576
24576
24576
0
24576
24392
24576
24576
24576
23488
24576
24576
24576
24448...

result:

ok 100000 lines

Test #14:

score: 0
Accepted
time: 463ms
memory: 20448kb

input:

300 100000
cbabacacabcaca?abcb?b??cbc??cbacb?acab?b?bcabc?a??bab?a?a?a?ca?acac????c?c?caba?a???bcab?ababababc??babacacacbacabcb?bab?bcab?bacb???ba???c?b?cb?bababac?cb??acacbcba?acaca??bacb?cbc?c?bcbcbab?ba?c??bacacab?b?b?ac??babcbcb?bcbcbcb?c?c?cbac?ba?a?abc?cab?bc?ca?abacaca?abc??ac?aca?a??ca?cac??...

output:

964413406
726709206
0
110704627
192317202
753035749
238645875
836077477
0
0
67075693
196248
337185872
684300992
551066954
512400928
894774207
441158600
632725062
60181080
460670453
301321033
206790308
549405433
258628038
0
719626090
0
800239318
716729053
580760175
749271169
414309213
431703326
12786...

result:

ok 100000 lines

Test #15:

score: 0
Accepted
time: 684ms
memory: 15728kb

input:

300 100000
cbacacacbcba??bc???ab??bca?acabcbcb?cac?babacbac?ba??cbcbac?cb?abacaca?ac?c?caba?ac?cabc?ba?cbaba??ba??abcabac?abab?cabcacbc?cab??aca?bc??babacacab?c?babcacacb?cba?ac?a?abacabcbcbcaca?ab?bcabababc??ababa?abc???acbacbabcac?a?acabcac?cbabac?bacab??c?a??babcbacac??aca?bcba?ab?bcbacbacbabab?b...

output:

868189535
868189535
0
868189535
495627643
0
868189535
929370324
868189535
868189535
1474560
0
0
868189535
868189535
868189535
688551450
868189535
868189535
0
868189535
868189535
868189535
868189535
9381984
868189535
868189535
868189535
868189535
20457120
868189535
868189535
635204610
868189535
86818...

result:

ok 100000 lines

Test #16:

score: 0
Accepted
time: 926ms
memory: 19300kb

input:

300 100000
cbac?cac?cbcbca?abacba?ac?acab????abaca?abcbcabc?c??acb???b?ac??bcb?cacacabac?b?bc?a?b?abcac??a?acacab?bacacab??ca?b?c?acacabcbacacbc?c?acbcabcaca?a?cb?a??abcacab?b?cacb??ac??c?a?bacb?bacbaba?a?bc?babca??bababcababcab?ba?cba??cb?b?abc?cbcab?ba?ca?bacb??ca?bcb??cacbcbca???cbac?bacbc?cac?bc...

output:

63065600
280135711
280135711
280135711
280135711
280135711
280135711
280135711
0
579883317
270080
280135711
0
280135711
280135711
539129922
280135711
280135711
539129922
0
280135711
280135711
280135711
0
280135711
270080
256
280135711
280135711
280135711
280135711
280135711
280135711
631211594
28013...

result:

ok 100000 lines

Test #17:

score: -100
Time Limit Exceeded

input:

300 100000
??????a?a??c?c?????a??????????b???????????????????????????????????bc?b???????b????????c??????????a????????bc??a????????????c????a?????????????a?????b?????a????????c??ba????b?b???????????c?????????cbc?????????????????b???ab?b????ac?b??c??????c??a??ab???a?????b?????????a??b???????????ba????...

output:

356410997
164744264
978926692
879215541
267745269
399413378
667881560
356410997
818851047
356410997
989150636
266480908
0
356410997
303796242
234869176
137612115
356410997
0
24290767
273625930
411968196
567490332
356410997
0
356410997
807134302
646186244
356410997
356410997
577546772
527886169
35641...

result:
English 繁體中文 简体中文

Server Time: 2025-02-07 06:51:35 | OpenSource Project