QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#723565#9536. Athlete Welcome CeremonyustcwaitmeWA 598ms293108kbC++232.3kb2024-11-07 22:54:582024-11-07 22:54:58

Judging History

This is the latest submission verdict.

  • [2024-11-07 22:54:58]
  • Judged
  • Verdict: WA
  • Time: 598ms
  • Memory: 293108kb
Show
  • [2024-11-07 22:54:58]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=301,mod=1e9+7;
int dp[3][N][N][N];
ll s[N][N][N];
void solve()
{
	int n,q;
	cin>>n>>q;
	string ss;cin>>ss;
	int cnt=0;
	if(ss[0]=='a') dp[0][0][0][0]=1;
	else if(ss[0]=='b') dp[1][0][0][0]=1;
	else if(ss[0]=='c') dp[2][0][0][0]=1;
	else dp[0][1][0][0]=dp[1][0][1][0]=dp[2][0][0][1]=1,cnt++;
	for(int i=1;i<n;i++)
	{
		if(ss[i]=='?') cnt++;
		for(int t1=0;t1<=cnt;t1++)
			for(int t2=0;t2+t1<=cnt;t2++)
			{
				int t3=cnt-t1-t2;
				if(ss[i]=='?')
				{
					if(t1) dp[0][t1][t2][t3]=(dp[1][t1-1][t2][t3]+dp[2][t1-1][t2][t3])%mod;
					if(t2) dp[1][t1][t2][t3]=(dp[0][t1][t2-1][t3]+dp[2][t1][t2-1][t3])%mod;
					if(t3) dp[2][t1][t2][t3]=(dp[0][t1][t2][t3-1]+dp[1][t1][t2][t3-1])%mod;
				}
				else
				{
					if(ss[i]=='a') 
					{
						dp[0][t1][t2][t3]=(dp[1][t1][t2][t3]+dp[2][t1][t2][t3])%mod;
						dp[1][t1][t2][t3]=dp[2][t1][t2][t3]=0;
					}
					else if(ss[i]=='b') 
					{
						dp[1][t1][t2][t3]=(dp[0][t1][t2][t3]+dp[2][t1][t2][t3])%mod;
						dp[0][t1][t2][t3]=dp[2][t1][t2][t3]=0;
					}
					else 
					{
						dp[2][t1][t2][t3]=(dp[0][t1][t2][t3]+dp[1][t1][t2][t3])%mod;
						dp[0][t1][t2][t3]=dp[1][t1][t2][t3]=0;
					}
				}
//				cout<<t1<<'.'<<t2<<'.'<<t3<<':'<<dp[0][t1][t2][t3]<<' '<<dp[1][t1][t2][t3]<<' '<<dp[2][t1][t2][t3]<<endl;
			}
//		cout<<endl;
	}
//	cout<<dp[0][1][0][0]<<endl;
	for(int t1=0;t1<=cnt;t1++)
		for(int t2=0;t1+t2<=cnt;t2++)
		{
			int t3=cnt-t1-t2;
			s[t1][t2][t3]=(dp[0][t1][t2][t3]+dp[1][t1][t2][t3]+dp[2][t1][t2][t3])%mod;
		}
	for(int i=0;i<=300;i++)
		for(int j=0;j<=300;j++)
			for(int k=0;k<=300;k++)
			{
				if(i) s[i][j][k]+=s[i-1][j][k],s[i][j][k]%=mod;
				if(j) s[i][j][k]+=s[i][j-1][k],s[i][j][k]%=mod;
				if(k) s[i][j][k]+=s[i][j][k-1],s[i][j][k]%=mod;
				if(i&&j) s[i][j][k]=(s[i][j][k]-s[i-1][j-1][k]+mod)%mod;
				if(i&&k) s[i][j][k]=(s[i][j][k]-s[i-1][j][k-1]+mod)%mod;
				if(j&&k) s[i][j][k]=(s[i][j][k]-s[i][j-1][k-1]+mod)%mod;
				if(i&&j&&k) s[i][j][k]+=s[i-1][j-1][k-1],s[i][j][k]%=mod;
			}
	while(q--)
	{
		int x,y,z;cin>>x>>y>>z;
		cout<<s[x][y][z]<<endl;
	}
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t=1;
	while(t--)
		solve();
	return 0;
}
源文件, 语言: C++23

詳細信息

Test #1:

score: 100
Accepted
time: 557ms
memory: 219924kb

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: 598ms
memory: 226916kb

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: 544ms
memory: 222748kb

input:

1 1
?
0 1 1

output:

2

result:

ok single line: '2'

Test #4:

score: 0
Accepted
time: 563ms
memory: 220032kb

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: 551ms
memory: 225084kb

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: 534ms
memory: 223688kb

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: 554ms
memory: 239944kb

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: 591ms
memory: 222804kb

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: 539ms
memory: 293108kb

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:

195508388
259088039
939792871
858846490
10104
334198754
479284703
174283993
18944427
659694548
894876281
515985973
342761527
182802705
215438611
24903472
898235886
313982884
440599794
337549965
39088634
527160619
688006832
529480730
906092786
448494161
718236644
816152457
705467745
176823209
6667784...

result:

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

伺服器時間: 2025-02-07 07:33:01 | 開源專案